Abstract
We consider the problem of optimal assignment of NOP due-dates ton jobs and sequencing them on a single machine to minimize a penalty function depending on the values of assigned constant waiting allowance and maximum job tardiness. It is shown that the earliest due date (EDD) order is an optimal sequence. For finding optimal constant waiting allowance, we reduce the problem to a multiple objective piecewise linear programming with single variable. An efficient algorithm for optimal solution of the problem is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alidaee B (1991) Optimal Assignment of Slack Due-Dates and Sequencing in a Single-Machine Shop, Appl Math Lett 4:9–11
Baker KR, Scudder GD (1990) Sequencing with Earliness and Tardiness Penalties: A Review. Operat Res 38:22–36
Cheng TCE (1989) Optimal Assignment of Slack Due-Dates and Sequencing in a Single-Machine Shop, Appl Math Lett Vol 2 No 4:333–335
Cheng TCE, Gupta MC (1989) Survay of Scheduling Research Involving Due-date Determination Decisions. Eur J Operat Res 38:156–166
Lawler EL (1973) Optimal Sequencing of a Single Machine Subject to Precedence Constraints, Management Sci 19:544–546
Preparrata PP, Shamos IS (1985) Computational Geometry. Springer Verlag, New York
Smith ML, Dudek RA, Blair EL (1986) In: Stecke KE, Suri R (Eds) Flexible Manufacturing Systems. Characteristics of US flexible manufacturing system. — A survey. Elsevier, Amsterdam
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Alidaee, B. Optimal assignment of NOP due-dates and sequencing in a single machine shop. ZOR Zeitschrift für Operations Research Methods and Models of Operations Research 36, 333–341 (1992). https://doi.org/10.1007/BF01416232
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01416232