標題: A combined dispatching criteria approach to scheduling dual flow-shops
作者: Chiou, Chie-Wun
Chen, Wen-Min
Wu, Muh-Cherng
工業工程與管理學系
Department of Industrial Engineering and Management
關鍵字: scheduling;cross-shop production;dual flow-shops;combined dispatching criteria;genetic algorithm (GA)
公開日期: 1-Feb-2013
摘要: This study investigates a dual flow-shops scheduling problem. In the scheduling context, there are two flow shops and each shop involves three processing stages. The two shops are functionally identical but their stage processing times for a job are different. While sequentially going through the three processing stages, each job is allowed to travel between the two shops. That is, for a job, each of its three stages could be processed in any of the two shops. Such a context is called dual flow-shops in the sense that the two flow shops capacities are completely shared. The scheduling problem involves two decisions: (1) route assignment (i.e. assigning the processing stages of a job to a shop), and (2) job sequencing (i.e. sequencing the jobs waiting before each stage). The scheduling objective is to minimise the coefficient of variation of slack time (CVS ), in which the slack time (also called lateness) denotes the difference between the due date and total completion time of a job. We propose five genetic-algorithm-based (GA-based) solution methods to solve the scheduling problem, which are called GA-EDD, GA-FIFO, GA-SPT, GA-LFO, and GA-COMBO respectively. Numerical experiments indicate that GA-COMBO outperforms the other four methods.
URI: http://dx.doi.org/10.1080/00207543.2012.693636
http://hdl.handle.net/11536/21245
ISSN: 0020-7543
DOI: 10.1080/00207543.2012.693636
期刊: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume: 51
Issue: 3
起始頁: 927
結束頁: 939
Appears in Collections:Articles


Files in This Item:

  1. 000313036700019.pdf