Tabu-search for the multi-mode job-shop problem

被引：33

作者：

Brucker P. ^{[1
]}

Neyer J̈. ^{[1
]}

机构：

[1] Fachbereich Mathematik/Informatik, Universität Osnabrück, D-49076 Osnabrück

来源：

Operations-Research-Spektrum | 1998年 / 20卷 / 1期

关键词：

Multi-mode job-shop; Multi-purpose-machine job-shop; Multiprocessor-task job-shop; Tabu-search;

D O I：

10.1007/BF01545525

中图分类号：

学科分类号：

摘要：

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. © Springer-Verlag 1998.

引用

页码：21 / 28

页数：7

共 11 条

[1]

Adams J., Balas E., Zawack D., The shifting bottleneck procedure for job-shop scheduling, Management Science, 34, pp. 391-401, (1988)

[2]

Brucker P., Kramer A., Shop scheduling problems with multiprocessor tasks on dedicated processors, Annals of Operations Research, 57, pp. 13-27, (1995)

[3]

Brucker P., Schlie R., Job-shop scheduling with multi-purpose machines, Computing, 45, pp. 369-375, (1990)

[4]

Dauzere-Peres S., Paulli J., A Global Tabu Search Procedure for the General Multiprocessor Job-shop Scheduling Problem., (1995)

[5]

Fisher H., Thompson G.L., Probabilistic Learning Combinations of Local Job-shop Scheduling Rules., pp. 225-251, (1963)

[6]

Hurink J., Jurisch B., Thole M., Tabu Search for the Jobshop Scheduling Problem with Multi-purpose Machines., OR-Spektrum, 15, pp. 205-215, (1994)

[7]

Jurisch B., Scheduling Jobs in Shops with Multi-purpose Machines., (1992)

[8]

Kramer A., Scheduling Multiprocessor Tasks on Dedicated Processors., (1995)

[9]

Roy B., Sussmann B., Les Problèmes D'ordonnancement Avec Constraintes Disjunctives., (1964)

[10]

Sprecher A., Drexl A., 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, 385, (1996)

← 1 2 →