标题: 跳跃式不允许等待生产线排程方法之研究
Scheduling for M-Machine Jumping No-Wait Flowshop
作者: 刘鉴宽
Liu, Jian-Kuan
许锡美
Hsu, hsi-mei
工业工程与管理学系
关键字: 禁忌搜寻法;总排程时间;no-wait;JNWF;tabu search;makespan;no-wait;JNWF
公开日期: 2009
摘要: 本论文探讨JNWF的排程问题。JNWF排程问题是限制工件在生产过程中不能有等待机台的情况发生,且各工件经过机台的先后顺序相同,但依工件的不同,加工过程中可能会跳过某些机台加工。本研究根据JNWF排程问题的特性,以总排程时间最小化为目标。利用禁忌搜寻法(tabu search)提出演算法(FBS、FBS2),求解各工件占用机台的优序。本研究针对FBS、FBS2,李氏的TS2及蔡氏的ITS四种求解JNWF排程问题方法,分别就起始解、最终解,及运算时间的绩效进行比较。结果显示,在起始解及最终解的总排程时间显着优于TS2及ITS,唯在运算时间及机台数较少的情境,无显着差异。
This study investigates the scheduling of jumping no-wait flowshop(JNWF) problems. These problems have a constraint that jobs can not wait for machine during production process; the sequencing of jobs by the machine is similar, but due to the difference of jobs' types, jobs may skip some process of machines. This research is based on the specific of JNWF sequencing problems, with the minimum makespan as the target. By deriving 2 new algorithms (FBS and FBS2) from tabu search, we determine the priority of the jobs from the machine. 4 methods (FBS, FBS2, Li’s TS2 and Tsai’s ITS) are compared in terms of initial solution, final solution and computed time. It is found that FBS and FBS2 are significantly better than TS2 and ITS in terms of initial and final solution, but there is not much difference between these 4 methods in terms of computed time and during scenario when lesser machines are used.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT079333543
http://hdl.handle.net/11536/40615
显示于类别:Thesis