标题: 一般化不允许待机流程式生产线排程方法之探讨
Generalized No-Wait Flowshop Scheduling with Makespan Criterion
作者: 许锡美
HSU HSI-MEI
国立交通大学工业工程与管理学系(所)
关键字: 不可待机;流程式生产;平行机台;总排程时间;No-wait;Flowshop
公开日期: 2010
摘要: 本计画探讨No-wait Flowshop with jumping(NWF-J)及No- wait Flowshop with Parallel
Machines(NWF-P)的排程问题特性。经由问题特性提出起始解的演算法,及改善解
的方向,进而提出有效的演算法。本计画第三年将依前二年的研究成果设计No-wait
Flowshop 的排程软体,以供业界使用。该软体可提供工件占用机台的优序序列,及可查询
机台各时间区段的负荷及排程甘特图,工件的加工开始时间及完工时间,可查询各工件的
产出时间。
尚未見文献探讨NWF-J 排程问题,因全球化及客制化的需求日增,NWF-J 及NWF-P 排
程问题存在于半导体业,玻璃制造业、制药业、钢铁业、化工业、食品制造业、与塑
胶业等产业。该研究可提升机台的利用率及缩短产品的生产周期时间,增加业界的竞
争力。
In this study, we intend to develop a software to solve the scheduling problems of no-wait
flow shop which includes traditional no-wait flowshop problem (NWF), no-wait flowshop
with jumping problem(NWF-J), and no-wait flowshop with parallel machines problem
(NWF-P). We propose a new scheduling problem of no-wait flowshop with jumping that
generalizes the traditional NWF problem. First year, we investigate the characteristics of NWF-J
problem. Based on these characteristics, we develop a heuristic algorithm to solve NWF-J
problem for minimizing the makespan. Second year, we will research the characteristics of
NWF-P problem and propose an algorithm to solve it. Third Year, based on the results of the
preceding two years, we will develop a software to solve the scheduling problems of NWF,
NWF-J and NWF-P.
官方说明文件#: NSC97-2221-E009-109-MY3
URI: http://hdl.handle.net/11536/100468
https://www.grb.gov.tw/search/planDetail?id=1986637&docId=324428
显示于类别:Research Plans