SCHEDULING IN NORMAL-JOB, META-STAGE FLOWSHOP WITH PARALLEL PROCESSORS TO MINIMIZE MAKESPAN

被引：38

作者：

RAJENDRAN, C

CHAUDHURI, D

机构：

[1] Division of Industrial Engineering and Management, Department of Humanities and Social Sciences, Indian Institute of Technology, Madras

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 1992年 / 27卷 / 02期

关键词：

D O I：

10.1016/0925-5273(92)90006-S

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The existing algorithms for optimizing the flowshop scheduling problem with the objective of minimizing makespan assume that every stage has a single processor. This paper relaxes this assumption and presents a branch-and-bound algorithms for scheduling in the flowshop with parallel processors. The computational experience on the working of the algorithm is also reported.

引用

页码：137 / 143

页数：7

共 15 条

[1]

Ignal, Schrage, Application of the branch and bound technique to some flowshop scheduling problems, Operations Research, 13, pp. 400-412, (1965)

[2]

Lominicki, A branch and bound algorithm for the exact solution of the three machine scheduling problem, Journal of the Operational Research Society, 16, pp. 89-100, (1965)

[3]

Brown, Lominicki, Some applications of the branch and bound algorithm to the machine scheduling problem, Journal of the Operational Research Society, 17, pp. 173-186, (1966)

[4]

McMahon, Burton, Flow-shop scheduling with the branch and bound method, Operations Research, 15, pp. 473-481, (1967)

[5]

Charlton, Death, A method of solution for the general machine scheduling problem, Operations Research, 18, pp. 689-707, (1970)

[6]

Bestwick, Hastings, A new bound for machine scheduling, Oper. Res. Quart., 27, pp. 479-486, (1976)

[7]

Arthanari, Ramamurthy, An extension of two machines sequencing problem, Opsearch, 8, pp. 10-22, (1971)

[8]

Mittal, Bagga, Two machine sequencing problem with parallel machines, Opsearch, 9, pp. 50-59, (1972)

[9]

Murthy, On two machine sequencing problems with parallel machines, Opsearch, 11, pp. 42-44, (1974)

[10]

Sambandam, Rajendran, Shanthi, Heuristic method for solving m-stage with parallel-machine scheduling problem, Proc. XVIII Ann. Convention Oper. Res. Soc. India, (1985)

← 1 2 →