A GENETIC ALGORITHM FOR FLOW SHOP WITH MULTIPLE PROCESSORS
-
摘要: 讨论了多阶段多机的Flow Shop问题（Flow Shopwith Multiple Procesors问题，简称FSMP问题），问题的目标是使工件的提前/拖期总成本最小．这是一个NP-难题．为此，首先给出了问题的数学模型，然后构造了一个有效的遗传算法．在本文的最后给出了实验结果和结论．Abstract: This paper considers the scheduling problem of a flow shop with multiple processor satoneor more stages(FSMP). The objective is tominimize the total earliness and tar diness costs of jobs. This is an NP-hard problem. We present amodel of FSMP and construct a genetic assigning heuristic algorithm. Finally,experiment results are shown.
-
Keywords:
- FSMP /
- duedate /
- earliness and tardiness /
- genetic algorithm
-
-
[1] Salvador M S.A Solution of a Special Class of Flow Shop Scheduling and Its Application.Springer-Verlag,Berlin,1973 [2] Wit trock R J. Scheduling Algorithms for Flexible Flow Line.IBM Journal of Research and Development,1985,29(4):401～412 [3] Wit trock R J.An Adaptable Scheduling Algorithm for Flexible Flow Lines.Opers Res,1988,33(4):445～453 [4] KochharS,Morris RJT.Heuristic Methods for Flexible Flow Line Scheduling.Journal of Manu facturing System,1987,6(4):299～314 [5] Brah S A,Hunsucker J L. Optimal Schedulingin a Flow Shop with Multiple Processors. Paper Presented at the TIMS/ORSA Joint Nation Meeting in New Orleans,Louisiana,1987,5:4～6 [6] Brah S A,Hunsucker J L. Branch and Bound Algorithm for a Flow Shop with Multiple Processors. Eur J Opl Res,1991,51(1):88～99 [7] Gupta J N D. Two-stage Hybrid Flowshop Scheduling Problem. JOpl Res Soc,1988,39(4):359～364 [8] Tsubone H. A Production Scheduling System for a Hybrid Flow Shop-a Case Study. OMEGA,Int Jof Mgmt Sci,1993,21(2):205～214 [9] Hun sucker J H,Shah J R.Performance of Priority Rules in a Due Date Flow Shop. OMEGA,Int Jof Mgmt Sci,1992,20(1):73～89 [10] Peng S O,Morton T E. The Single Machine Early/Tardy Problem. Management Science,1989,35(2):177～191
计量
- 文章访问数: 736
- HTML全文浏览量: 0
- PDF下载量: 384
下载:
