DESIGN OF A SCHEDULING SYSTEM FOR FLEXIBLE MANUFACTURING CELLS

被引：21

作者：

CHAN, DY

BEDWORTH, DD

机构：

[1] Department of Information Science, Providence University, Taiwan, Taichung Tsien

[2] Department of Industrial and Management Systems Engineering, Arizona State University, Tempe, AZ

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1990年 / 28卷 / 11期

关键词：

D O I：

10.1080/00207549008942851

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The objective of this paper is to describe an effective scheduling system for flexible manufacturing cells (FMC). Based on FMC characteristics, cell scheduling can be categorized for a dynamic, modified flow shop working in a real-time environment. A heuristic static cell scheduling methodology for minimizing mean flowtime is first proposed. This is then modified to allow dynamic cell scheduling to reflect the real-world situation of continuous job introduction to the cell. Computational results show that the proposed algorithms yield optimal or near optimal job sequences in a very short period of time, thus satisfying a real-time need of rapid computation. © 1990 Taylor & Francis Group, LLC.

引用

页码：2037 / 2049

页数：13

共 18 条

[1]

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

[2]

Bansal S.P., Minimizing the sum of completion times of n-jobs over m-machines in a flow shop-a branch and bound approach, AIIE Transactions, 9, (1977)

[3]

Bartos F.J., Cell and area controls make automation building blocks, Control Engineering, 35, (1988)

[4]

Campbell H.G., Dudeck R.A., Smith M.L., A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science, 16, (1970)

[5]

Conway R.W., Maxwell W.L., Miller L.W., Theory of Scheduling, (1967)

[6]

Foley R.D., Suresh S., Minimizing the expected flowtime in stochastic flow shops, AIIE Transactions, 4, (1984)

[7]

Gupta J.N., Heuristic algorithms for the multistage flow-shop scheduling problem, AIIE Transactions, 4, (1972)

[8]

Gupta J.N., Reddi S.S., Improved dominance conditions for the three-machine flow-shop scheduling problem, Operations Research, 26, (1978)

[9]

Ignall E., Schrage L., Applications of the branch and bound technique to some flow-shop scheduling problems, Operations Research, 13, (1965)

[10]

Krone M., Heuristic programming solution of a flow-shop scheduling problem, Operations Research, 22, (1974)

← 1 2 →