Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches

• Published in: European journal of operational research Vol. 167; no. 2; pp. 336 - 348
• Main Authors: Zoghby, Jeriad, Wesley Barnes, J., Hasenbein, John J.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.12.2005; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: Algorithms; Applied sciences; Exact sciences and technology; Flexible manufacturing systems; Graph theory; Heuristic; Job shops; Manufacturing; Metaheuristics; Operational research and scientific management; Operational research. Management science; Operations research; Scheduling; Scheduling, sequencing; Studies; Scheduling; Graph theory; Manufacturing; Metaheuristics; Flexible manufacturing systems; Time dependence; Flexible manufacturing system; Job shop; Task scheduling; Setup time; Search algorithm; Workload
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2004.03.027

We consider modeling the reentrant job shop scheduling problem with sequence dependent setup times in the context of metaheuristic search methods. We begin by investigating feasibility conditions when sequence dependent setups are incorporated into the traditional job shop scheduling problem. The investigation reveals that traditional methods of avoiding infeasible solutions for iterative search techniques do not suffice. The conditions under which these infeasible solutions occur are presented and an algorithm is presented to remove such infeasibilities. Reentrancy and its relationship to the traditional model are then illustrated, and the new features of the disjunctive graph are introduced. We conclude with a simple algorithm for obtaining an initial feasible solution, benefits of this research, and an application to the reentrant job shop scheduling problem with sequence dependent setups.