Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/1069
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Raghavachari, M. | - |
dc.date.accessioned | 2010-03-13T12:18:21Z | - |
dc.date.available | 2010-03-13T12:18:21Z | - |
dc.date.copyright | 1983-06 | - |
dc.date.issued | 2010-03-13T12:18:21Z | - |
dc.identifier.uri | http://hdl.handle.net/11718/1069 | - |
dc.description.abstract | 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. | en |
dc.language.iso | en | en |
dc.relation.ispartofseries | WP;1983/460 | - |
dc.subject | Jobs | en |
dc.subject | Optimal sequencing | en |
dc.title | Some properties of optimal schedule of jobs with a common due date | en |
dc.type | Working Paper | en |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP 1983_460.pdf | 410.97 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.