Paper #338

Títol:

Solving two production scheduling problems with sequence-dependent set-up times

Autors:

Joao António Noivo i Helena Ramalhinho-Lourenço

Data:

Desembre 1998

Resum:

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, sequence-dependent 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.

Paraules clau:

Production-scheduling, set-up times, priority dispatching rules

Codis JEL:

C61, M11, L60

Àrea de Recerca:

Gestió de la Producció i de les Operacions

Descarregar el paper en format PDF