Developing Dispatching Rules for the Scheduling Problem on Flexible flow shop
Date Issued
2005
Date
2005
Author(s)
Jiang, Pey-Jen
DOI
zh-TW
Abstract
As technology advances, to assist the businesses who are in face with shortened product life cycle, ambiguous demand level, and challenges from the diversification of product offering, the manufacturers have consistently strived for efficient production planning and shop floor scheduling, so that businesses can attain a higher order fulfillment and real time production of shop floor capacity. The automobile manufacture, printed circuit board manufacture and IC packing are categorized as flexible flow shop. There are many unrelated pareall machines at each stage, but in past studies, the focues have been on the indentical machines in the flexible flow shop or the unrelated machines at individual stage by using huristic methods; very few studies discussed about the scheduling for the unrelated machine at mutilple stages.
This paper considers the the special features of the unrelated machines in flexible flow shop, then proposes three new dispatching rules and six look-ahead dispatching rules by using the look-ahead method. The results indicate the three new dispatching rules product good results on maximum flow, mean flow time criterias and the six look-ahead dispatching rules product excellent result on all criterias. In addition, we observe the look-ahead dispatching rule will product better when the unrelated machines are more different.
Subjects
彈性流程式生產
非等效平行機器
派工法則
前瞻式方法
flexible flow shop
unrelated parallel machine
dispatching rule
look -ahead method
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92725044-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):7bcdbf6afcbc644027879a7981506da3