Due date (found 83 titles)

Pregnancy Card: Due Date Calculator and Data Card

Author: A. Arturo Rodriguez
Publisher: Rodram Corporacion
Publication date: 2007-01
ISBN: 9685325448
Price: $4.95

Economic batch scheduling with discrete demands and due dates (Working paper)

Author: Myungsub Park
Publisher: Bentley College, Institute for Research and Faculty Development
Publication date: 1988
ISBN:
Pages: 21
Price:

Federal Circuit allows cash-method issuer to deduct interest payments before due date.: An article from: The Tax Adviser

Authors: Rich Godshalk, Frank Devlin, Don Herskovitz
Publisher: American Institute of CPA's
Publication date: 2000-03-01
ISBN:
Pages: 2
Price: $5.95

This digital document is an article from The Tax Adviser, published by American Institute of CPA's on March 1, 2000. The length of the article is 456 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

Citation Details
Title: Federal Circuit allows cash-method issuer to deduct interest payments before due date.
Author: Rich Godshalk
Publication: The Tax Adviser (Magazine/Journal)
Date: March 1, 2000
Publisher: American Institute of CPA's
Volume: 31 Issue: 3 Page: 158

Distributed by Thomson Gale

On satisfying due-dates in large job shops: idle time insertion.: An article from: IIE Transactions

Authors: Thom J. Hodgson, Russell E. King, Kristin Thoney, Natalie Stanislaw, Alexander J. Weintraub, Jr, Andrew Zozom
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Publication date: 2000-02-01
ISBN:
Pages: 9
Price: $5.95

This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on February 1, 2000. The length of the article is 2440 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

Citation Details
Title: On satisfying due-dates in large job shops: idle time insertion.
Author: Thom J. Hodgson
Publication: IIE Transactions (Refereed)
Date: February 1, 2000
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: 32 Issue: 2 Page: 177

Distributed by Thomson Gale

On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties [An article from: Computers and Operations Research]

Authors: V. Lauff, F. Werner
Publisher: Elsevier
Publication date: 2004-03-01
ISBN:
Price: $5.95

This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
In this paper, the complexity and some other properties of several multi-stage problems with a non-regular performance measure are investigated. Mainly, we deal with two-machine problems. The problems are extensions of a one-machine problem with a common due date and a non-regular optimization criterion, where the sum of absolute deviations of the completion times from the due date is to be minimized. There are two reasonable generalizations: Either, the objective function is kept the same as in the one-machine problem, where the completion time is now the completion time of the last operation of the job, or a second penalty is added to this term which takes into account the storage costs of the intermediate. For both types of problems, we study the flow shop, the job shop, and the open shop environment. In the case of intermediate storage costs, we distinguish the cases of a due date d=0 (which leads to a regular optimization criterion) and a non-restrictive due date. We obtain the following results. The two-machine flow shop problem with intermediate storage costs defined in this paper is NP-hard in the strong sense for d=0 as well as for a non-restrictive due date. We prove the similar results for the two-machine open shop problem. In absence of intermediate storage costs, the open shop and the job shop problem are polynomially solvable for a non-restrictive due date. Scope and purpose: The just-in-time production philosophy has lead to a growing interest in scheduling problems considering both earliness and tardiness penalties. Most publications considering these so-called non-regular objective functions are devoted to single-stage problems. This paper describes the two main approaches to extend the objective function to multi-stage environments and investigates the computational complexity of the problems obtained. The investigations in this paper may serve as a starting point for the development of appropriate algorithms for the type of problem considered.

Christmas Due Date (SR 1629)

Authors: Moyra Tarling
Publisher: Silhouette
Publication date: 2002-11-02
ISBN:
Price:

Baby arrives early, but just in time to be the year's first.(Holidays)(Grace Marie Dillon is born before her due date at McKenzie-Willamette): An article from: The Register-Guard (Eugene, OR)

Publisher: The Register Guard
Publication date: 2005-01-03
ISBN:
Pages: 28
Price: $5.95

This digital document is an article from The Register-Guard (Eugene, OR), published by The Register Guard on January 3, 2005. The length of the article is 8233 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

Citation Details
Title: Baby arrives early, but just in time to be the year's first.(Holidays)(Grace Marie Dillon is born before her due date at McKenzie-Willamette)
Publication: The Register-Guard (Eugene, OR) (Newspaper)
Date: January 3, 2005
Publisher: The Register Guard
Page: b1

Distributed by Thomson Gale

Emergency diesel generator component failures due to vibration: Event date February 15, 1985 (LER 85-002-00)

Authors: Chuck Hsu
Publisher: U.S. Nuclear Regulatory Commission, Office for Analysis and Evaluation of Operational Data]
Publication date: 1986
ISBN:
Pages: 9
Price:

Scheduling with controllable release dates and processing times: Total completion time minimization [An article from: European Journal of Operational Research]

Authors: T.C.E. Cheng, M.Y. Kovalyov, N.V. Shakhlevich
Publisher: Elsevier
Publication date: 2006-12-01
ISBN:
Price: $7.95

This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
The single machine scheduling problem with two types of controllable parameters, job processing times and release dates, is studied. It is assumed that the cost of compressing processing times and release dates from their initial values is a linear function of the compression amounts. The objective is to minimize the sum of the total completion time of the jobs and the total compression cost. For the problem with equal release date compression costs we construct a reduction to the assignment problem. We demonstrate that if in addition the jobs have equal processing time compression costs, then it can be solved in O(n^2) time. The solution algorithm can be considered as a generalization of the algorithm that minimizes the makespan and total compression cost. The generalized version of the algorithm is also applicable to the problem with parallel machines and to a range of due-date scheduling problems with controllable processing times.

Denied access due to negative room pressure: Event date December 26, 1985

Authors: Theodore C Cintula
Publisher: U.S. Nuclear Regulatory Commission, Office for Analysis and Evaluation of Operational Data]
Publication date: 1986
ISBN:
Price:

Pages: 1 2 3 4 5 6 7 8 9