Abstract
We consider the problem of scheduling n multi‐operationjobs on a single machine. Eachjob comprises up to F operations that belong to different families.Changeovers of production from one family to another have associated set‐up times.A job completes when all of its operations have been processed. This type of problem arisesin the manufacture of food products. It combines the batching aspect of the well‐knownfamily scheduling models with an assembly element (where the job's operationsare assembled to make the final product).Our analysis covers three classic optimality criteria: the maximum lateness, theweighted number of late jobs, and the sum of job completion times. We show that the problemof minimizing the maximum lateness is equivalent to its counterpart without assembly.This enables us to derive extensions of known complexity results and to indicate appropriatealgorithms. The number of late jobs problem is shown to be binary NP‐hard when thereare two families, and unary NP‐hard when there are an arbitrary number of families,even when all set‐up times are identical. For a fixed number of families, we give adynamic programming algorithm to minimize the weighted number of late jobs, which requirespseudo‐polynomial running time. A similar algorithm solves the sum of completion timesproblem in polynomial time, under the additional assumption that the processing times ofoperations between families are agreeable.
Similar content being viewed by others
References
K.R. Baker, Scheduling the production of components at a common facility, IIE Transactions 20 (1988)32-35.
J. Bruno and P. Downey, Complexity of task sequencing with deadlines, set-up times and changeover costs, SIAM Journal on Computing 7(1978)393-404.
E.G. Coffman, Jr, A. Nozari and M. Yannakakis, Optimal scheduling of products with two subassemblies on a single machine, Operations Research 37(1989)426-436.
E.G. Coffman, Jr, M. Yannakakis, M.J Magazine and C.A. Santos, Batch sizing and job sequencing on a single machine, Annals of Operations Research 26(1990)135-147.
M.R. Garey and D.S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, Freeman, 1979.
A.E. Gerodimos, C.A. Glass and C.N. Potts, Scheduling the production of two-component jobs on a single machine, European Journal of Operational Research, to appear.
A.E. Gerodimos, C.A. Glass and C.N. Potts, Batching and sequencing of customised jobs on a single machine: The item availability case, Preprint OR88, University of Southampton, UK, 1997.
J.B. Ghosh, Batch scheduling to minimize total completion time, Operations Research Letters 16(1994)271-275.
J.B. Ghosh and J.N.D. Gupta, Batch scheduling to minimize maximum lateness, Operations Research Letters 21(1997)77-80.
R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics 5(1979)287-326.
H. Groenevelt, The just-in-time system, in: Logistics of Production and Inventory, eds. S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, Handbooks in Operations Research and Management Science, Vol. 4, North-Holland, 1993, pp. 629-670.
J.N.D. Gupta, J.C. Ho and J.A.A. van der Veen, Single machine hierarchical scheduling with customer orders and multiple job classes, Annals of Operations Research 70(1997)127-143.
F.M. Julien and M.J. Magazine, Scheduling customer orders: An alternative production scheduling approach, Journal of Manufacturing and Operations Management 3(1990)177-199.
R.M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations, eds. R.E. Miller and J.W. Thatcher, Plenum Press, 1972, pp. 85-103.
E.L. Lawler and J.M. Moore, A functional equation and its application to resource allocation and sequencing problems, Management Science 16(1969)77-84.
C.L. Monma and C.N. Potts, On the complexity of scheduling with batch setup times, Operations Research 37(1988)798-804.
J.M. Moore, An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15(1968)102-109.
C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot sizing: A review of algorithms and complexity, Journal of the Operational Research Society 43(1992)395-406.
C.A. Santos and M.J. Magazine, Batching in single operation manufacturing systems, Operations Research Letters 4(1985)99-103.
R. Simons, Planning and scheduling in oil refineries, OR Newsletter 313(1997)26-28.
R.G. Vickson, M.J. Magazine and C.A. Santos, Batching and sequencing of components at a single facility, IIE Transactions 25(1993)65-70.
H.M. Wagner and T.M. Whitin, Dynamic version of the economic lot size model, Management Science 5(1958)89-96.
Rights and permissions
About this article
Cite this article
Gerodimos, A., Glass, C., Potts, C. et al. Scheduling multi‐operation jobs on a single machine. Annals of Operations Research 92, 87–105 (1999). https://doi.org/10.1023/A:1018959420252
Issue Date:
DOI: https://doi.org/10.1023/A:1018959420252