Scheduling multi‐operation jobs on a single machine

A.E. Gerodimos, C.A. Glass, C.N. Potts and T. Tautenhahn

Annals of Operations Research, 1999, vol. 92, issue 0, 87-105

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. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018959420252 (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:92:y:1999:i:0:p:87-105:10.1023/a:1018959420252

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

DOI: 10.1023/A:1018959420252

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 ().