Article ID: | iaor19992320 |
Country: | Netherlands |
Volume: | 106 |
Issue: | 2/3 |
Start Page Number: | 277 |
End Page Number: | 300 |
Publication Date: | Apr 1998 |
Journal: | European Journal of Operational Research |
Authors: | Valls Vicente, Perez M. Angeles, Quintanilla M. Sacramento |
Keywords: | heuristics |
In this paper we apply the tabu search (TS) technique to a complex machine scheduling problem. The problem can be considered as a generalization of the job-shop problem with both simple and parallel machines, job batches, setup times and release and due dates. The goal is to obtain feasible schedules by minimizing the makespan