Rescheduling for new orders on a single machine with setup times

• Published in: European journal of operational research Vol. 223; no. 1; pp. 40 - 46
• Main Authors: Hoogeveen, H., Lenté, C., T’kindt, V.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 16.11.2012; Elsevier; Elsevier Sequoia S.A
• Subjects: Applied sciences; Complexity proofs; Computer Science; Cost engineering; Disruption; Exact algorithms; Exact sciences and technology; Job shops; Mathematical problems; Multicriteria; New orders; Operational research; Operational research and scientific management; Operational research. Management science; Operations Research; Optimization; Optimization algorithms; Pareto optimality; Pareto optimum; Production scheduling; Schedules; Scheduling; Scheduling, sequencing; Setup times; Studies; Scheduling; Complexity proofs; New orders; Multicriteria; Exact algorithms; Costs; Pareto optimum; Optimal algorithm; Multicriteria analysis; Polynomial time; Production management; Minimum time; NP hard problem; Setup time; Single machine
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2012.05.046

► We consider new rescheduling models for new orders. ► We provide exact algorithms. ► We prove the hardness of some problems. We focus on some single machine scheduling problems for which a set of new jobs have to be scheduled after a schedule of old jobs has been set. Each new and old job belongs to a family and changing the production from one family to another requires a setup. The initial schedule of old jobs is assumed to minimize the sum of setup times. The new jobs can be either scheduled after the old jobs or inserted within the existing schedule, which results in a disruption cost that has to be minimized together with the sum of setup times of the overall schedule. In this paper we tackle several simple setup time configurations yielding different scheduling problems for which we propose optimal polynomial time algorithms or provide NP-hardness proofs. In the former case we consider the problem of enumerating the set of strict Pareto optima for the sum of setup times and disruption cost criteria.