LOWER BOUNDS IN PERMUTATION FLOWSHOP PROBLEMS

被引：2

作者：

BANSAL, SP

机构：

[1] A.R.S.D. College, Delhi University, New Delhi, 110021, Dhaula Kuan

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1979年 / 17卷 / 04期

关键词：

D O I：

10.1080/00207547908919624

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper presents an algorithm for finding an improved machine-based lower bound of make-span by introducing the concept of maximum effective preprocessing time for a machine. The usefulness is indicated by developing machino-based lower bounds without presequence of jobs. Numerical examples illustrate the improvement in the value of machine-based bound which in turn improves the global lower bound for permutation flows hop problems only. © 1979 Taylor & Francis Group, LLC.

引用

页码：411 / 418

页数：8

共 10 条

[1]

Baker K.R., Introduction to Sequencing and Scheduling, (1974)

[2]

Bansal S.P., Global lower bound in the flow shop problem, OPSEARCH, 13, (1976)

[3]

Bestwick P.F., Productions Scheduling by Branch and Bwnd, (1976)

[4]

Bestwick P.F., Hastingsn A.J., A new bound for machine scheduling, Opns Res, 27, (1976)

[5]

Bestwick P.F., Lockyerk G., A practical scheduling system for batch production, Proceedings of the Fifth International Seminar on Algorithms for Production Control and Scheduling, pp. 70-78, (1976)

[6]

Brown A., Lomnicki Z.A., Some applications of the branch and bound algorithm to the machine scheduling problem, Opl Res. Q, 17, (1966)

[7]

Ignall E., Schragel L., Applications of branch and bound techniques to some flowshop scheduling problems, Opns Res, 13, (1965)

[8]

Lockyer K.G., Production Control in Practice, (1975)

[9]

Lomnickzi Z.A., A branch and bound algorithm for the exact solution of the three-machine scheduling problem, Opl Res. Q, 16, (1965)

[10]

McMahon G.B., Burton P.G., Flowshop scheduling with the branch and bound method, Opns Res, 15, (1967)

← 1 →