Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663622 | European Journal of Operational Research | 2005 | 13 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jeriad Zoghby, J. Wesley Barnes, John J. Hasenbein,