JOB-SHOP SCHEDULING HEURISTICS FOR SEQUENCE-DEPENDENT SETUPS

In this paper we develop a more realistic algorithm which addresses the job shop scheduling problem with sequence dependent setup times, and some complex constraints such as multiple machines, multiple resources, and alternate routes; then, we evaluate the performance of the algorithm relative to the performance criteria used in the real world shops. To illustrate the potential impact of addressed problem, we simulate the scheduling jobs using three different approaches under a variety of conditions. Experimental designs are used to find the difference among these approaches, and to justify the value of the more realistic approach.