Solving Two Production Scheduling Problems with Sequence-Dependent Set-Up Times

Abstract

In today's competitive markets, the importance of good scheduling strategies in manufacturing companies lead to the need of developing efficient methods to solve complex scheduling problems.In this paper, we studied two production scheduling problems with sequence-dependent setups times. The setup times are one of the most common complications in scheduling problems, and are usually associated with cleaning operations and changing tools and shapes in machines.The first problem considered is a single-machine scheduling with release dates, sequencedependent setup times and delivery times. The performance measure is the maximum lateness.The second problem is a job-shop scheduling problem with sequence-dependent setup times where the objective is to minimize the makespan.We present several priority dispatching rules for both problems, followed by a study of their performance. Finally, conclusions and directions of future research are presented.2

Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis

“…We have shown that some fundamental dominance properties are lost when considering simple extensions of the nondelay and Giffler-Thompson SGSs based on operation appending to sequence-dependent setup times, as performed by most previous studies on priority rule-based heuristics for the SDST-JSP in the literature, e.g. Allahverdi, Gupta and Aldowaisan (1999) [11] Kim and Bobrowski (1994), [14] and Ovacik and Uzsoy (1994). On the other hand, we have demonstrated that the serial algorithm based on operation insertion (Kolisch (1996)) has the ability to generate a dominant set of schedules.…”

A branch and bound method for the job-shop problem with sequence-dependent setup times

“…Kim and Bobrowski (1994) extend the preceding work to various performance measures and propose compound priority rules. Noivo and Ramalhinho-Lourenço (1998) propose also new priority-rules considering setup times and compare them with classical priority-rules. Ovacik and Uzsoy (1994a) propose a more sophisticated priority-rule based algorithm for problem J |s ij |L max with reentrant jobs (a job may use a machine more than once).…”

Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times

“…They propose a priority rule which aims at selecting the job yielding the smallest setup time when a machine becomes available. Later, Kim and Bobrowski (1994) consider various performance measures and propose compound priority rules; and Noivo and Ramalhinho-Lourenço (1998) propose new priority rules and compare with previous ones. Brucker and Thiele (1996) propose a priority rule as an extension of the G&T algorithm (Giffler and Thomson 1960).…”