PRACTICAL APPROACH TO PRODUCTION SCHEDULING

被引：7

作者：

BESTWICK, PF

LOCKYER, KG

机构：

[1] Management Centre, University of Bradford, Bradford, WC, WC2B 5NF, U.K. Published by Taylor, Francis Ltd

来源：

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

关键词：

D O I：

10.1080/00207547908919598

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The paper gives a practical, branch and bound based solution to the scheduling problem as found in real life. Organizational aspects of solving the scheduling problem are considered, and two organizational ideas, ’ the area of responsibility ’ and ’ the time span of action ’, are presented. Intelligibility to administrators and operatives of the output from any scheduling system is emphasized, and the adoption of a wholly new concept, the ’ Generalized Ordered Schedule ’, is advocated as a means of achieving intuitive appeal and improved control. The requirements which any useful scheduling system must satisfy are identified, from field Btudies, and reported. Data are presented on a collection of real problems, and comparisons of decision rule solution procedures with the branch and bound procedure given. These demonstrate that the usually accepted results from conventional simulation and other techniques using artificial job and sol;operation time and technological route matrices are misleading. © 1979, Taylor & Francis Group, LLC.

引用

页码：95 / 109

页数：15

共 36 条

[1]

Ashoitr S., Hiremath S., A branch and bound approach to the job shop scheduling problem, Int.J. Prod. Res, 11, (1973)

[2]

Balas E., Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Algorithm, (1968)

[3]

Berry W.L., Priority scheduling and inventory control in job lot manufacturing systems, A.I.I.E. Trans, 4, (1972)

[4]

Bestwick P.F., Production Scheduling by Branch and Bound, (1976)

[5]

Bbstwick P.F., Hastings N., A new bound in machine scheduling, Opl. Res. Q, 27, (1976)

[6]

Bbstwick P.F., Lockyer K.G., A practical scheduling system for batch production, Proceedings 5Th International Seminar on Algorithms for Production Control and Scheduling, pp. 70-78, (1976)

[7]

Bratley P., Floriak M., Robillard P., On sequencing with earliest start and due date with application to computing bounds for the (N/m/G/F/max) problem, Nav. Res. Log. Q, 20, (1973)

[8]

Brooks G.H., White C.R., An algorithm for finding optimal or near optimal solutions to the production scheduling problem, J. Ind. Engng, 16, (1965)

[9]

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

[10]

Campbell H.G., Dudek R.A., Smith M.L., A heuristic algorithm for the n job m machine sequencing problem, Mgmt. Sci, 16, (1970)

← 1 2 3 4 →