Abstract
In a multi-processor-tasks job-shop problem (MPTJSP) there is a machine set associated with each operation. All machines are needed for the whole processing period to process the operation. The objective is to find a schedule which minimizes the makespan. In a multi-mode job-shop problem (MMJSP) there is a set of machine sets associated with each operation. One has to assign a machine set to each operation and to solve the resulting MPTJSP such that the resulting makespan is minimized. For the MMJSP a tabu-search algorithm is presented. Computational results are reported.
Zusammenfassung
In einem Multi-Processor-Task Job-Shop Problem (MPTJSP) wird jeder Operation eine Maschinenmenge zugeordnet. Für die Bearbeitung einer Operation werden dabei während des gesamten Bearbeitungszeitraums alle Maschinen benötigt. Ziel ist es nun, einen Bearbeitungsplan zu bestimmen, in dem die Gesamtbearbeitungsdauer minimal ist. In einem Multi-Mode Job-Shop Problem (MMJSP) wird jeder Operation eine Menge von Maschinenmengen zugeordnet. Hierbei muß jeder Operation eine Maschinenmenge zugewiesen werden und das sich daraus ergebene MPTJSP mit dem Ziel der Minimierung der Gesamtbearbeitungsdauer gelöst werden. Für das MMJSP wird ein Tabu-Suche Algorithmus vorgestellt. Außerdem werden die erhaltenen Rechenergebnisse aufgeführt.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job-shop scheduling. Management Science 34:391–401
Brucker P, Krämer A (1995) Shop scheduling problems with multiprocessor tasks on dedicated processors. Annals of Operations Research 57:13–27
Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45:369–375
Dauzère-Pérès S, Paulli J (1995) A global tabu search procedure for the general multiprocessor job-shop scheduling problem. Department of Operations Research, University of Aarhus, No 5/95
Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial scheduling, pp. 225–251. Englewood Cliffs: Prentice Hall
Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR-Spektrum 15:205–215
Jurisch B (1992) Scheduling jobs in shops with multi-purpose machines. PhD thesis, Department of Mathematics/Informatics, Universität Osnabrück
Krämer A (1995) Scheduling multiprocessor tasks on dedicated processors. PhD thesis, Department of Mathematics/Informatics, Universität Osnabrück
Roy B, Sussmann B (1964) Les problèmes d'ordonnancement avec constraintes disjonctives. Note DS no 9 bis, SEMA, Paris
Sprecher A, Drexl A (1996a) Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. Part I: Theory. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No 385
Sprecher A, Drexl A (1996b) Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. Part II: Computation. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No 386
Author information
Authors and Affiliations
Additional information
Supported by the Deutsche Forschungsgemeinschaft, Project Br389/15-1
Rights and permissions
About this article
Cite this article
Brucker, P., Neyer, J. Tabu-search for the multi-mode job-shop problem. OR Spektrum 20, 21–28 (1998). https://doi.org/10.1007/BF01545525
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01545525