JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES

被引：576

作者：

BRUCKER, P

SCHLIE, R

机构：

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

来源：

COMPUTING | 1990年 / 45卷 / 04期

关键词：

JOB-SHOP SCHEDULING; FLEXIBLE MANUFACTURING; SHORTEST PATH;

D O I：

10.1007/BF02238804

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job. The operation can be processed on any of the machines in this set. For each assignment mu of operations to machines let P(mu) be the corresponding job-shop problem and f(mu) be the minimum makespan of P(mu). How to find an assignment which minimizes f(mu)? For problems with two jobs a polynomial algorithm is derived.

引用

页码：369 / 375

页数：7

共 5 条

[1] A GRAPHICAL APPROACH TO PRODUCTION SCHEDULING PROBLEMS
AKERS, SB
[J]. OPERATIONS RESEARCH, 1956, 4 (02) : 244 - 245
[2] AN EFFICIENT ALGORITHM FOR THE JOB-SHOP PROBLEM WITH 2 JOBS
BRUCKER, P
[J]. COMPUTING, 1988, 40 (04) : 353 - 359
[3] A GEOMETRIC MODEL AND A GRAPHICAL ALGORITHM FOR A SEQUENCING PROBLEM
HARDGRAVE, WW
NEMHAUSER, GL
[J]. OPERATIONS RESEARCH, 1963, 11 (06) : 889 - 900
[4] SOTSKOV YN, IN PRESS EUROPEAN J
[5] SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM
SZWARC, W
[J]. OPERATIONS RESEARCH, 1960, 8 (06) : 782 - 788

← 1 →