Abstract
A one machine job shop is considered. Associated with each job is its processing time and due date. There exists a subset of jobs which must be completed on time in any feasible schedule. A feasible sequencing of the jobs is sought which minimizes the number of late jobs.
An algorithm is stated, and proved optimal. In addition, the resulting optimal set is further characterized. A second optimal algorithm is also presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jackson, J.R., “Scheduling a Production Line to Minimize Maximum Tardiness,” Research Report 43, Management Sciences Research Project, UCLA, January, 1955.
Moore, J. Michael, “Sequencing Problems with Due Date Oriented Objective Functions,” Ph.D. dissertation, Univ. of Michigan, 1967.
Moore, J. Michael, “An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs,” Management Science, Vol. 15, No. 1 (Sept. 1968).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Sidney, J.B. (1973). An Extension of Moore’s Due Date Algotithm. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-80784-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06437-4
Online ISBN: 978-3-642-80784-8
eBook Packages: Springer Book Archive