Some Properties of Optimal Schedule of Jobs with a Common Due Date
Kanet (Naval Research Logistics Quarters, 1981) considered the problem of minimizing the average deviation of job completion times above a common due date. Under the condition that the common due date exceeds the makespan of the job set, he obtained a procedure SCHED which yields optimal sequence for the problem. In this paper, we consider the general problem without any condition and some general properties and in particular the V – shape of optimal schedule is proved. It is also shown that the SCHED algorithm of Kanet gives optimal sequence under less restrictive and a more practical condition on d. A few special cases including the complete solution for n=3 jobs are also given.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||01 Jun 1983|
|Contact details of provider:|| Phone: 91 79 2630 7241|
Fax: 91 79 2630 6896
Web page: https://web.iima.ac.in/publications
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:iim:iimawp:wp00536. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.