Robustness of single machine scheduling problems to earliness and tardiness penalty errors

R.J.W. James and J.T. Buchanan

Annals of Operations Research, 1998, vol. 76, issue 0, 219-232

Abstract: The Early/Tardy Machine Scheduling Problem is often proposed as a model of the situation faced by just-in-time manufacturers, whereby the objective is to minimize the weighted sum of early and tardy penalties for each job, and each penalty is proportional to the amount of time the job is early or tardy. Relatively little attention has been given in the literature to either the determination of these penalties or the effect that errors in estimating these penalties have on the final schedule. In this paper, we examine the sensitivity of the final schedule to errors in estimating these penalties. Results indicate that for some classes of problems, very large estimation errors can be sustained without compromising solution quality, whereas other problem classes require more careful evaluation of these penalties. Fortunately, the different classes of problem situations are relatively easy to identify. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018996505037 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:76:y:1998:i:0:p:219-232:10.1023/a:1018996505037

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018996505037

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().