標題: Permutation flowshop scheduling to minimize the total tardiness with learning effects
作者: Lee, Wen-Chiung
Chung, Yu-Hsiang
工業工程與管理學系
Department of Industrial Engineering and Management
關鍵字: Scheduling;Permutation flowshop;Total tardiness;Learning effect
公開日期: 1-一月-2013
摘要: Scheduling with learning effects has received considerable attention recently. Often, numbers of operations have to be done on every job in many manufacturing and assembly facilities. However, it is seldom discussed in the general multiple-machine setting, especially without the assumptions of identical processing time on all the machines or dominant machines. With the current emphasis of customer service and meeting the promised delivery dates, we consider a permutation flowshop scheduling problem with learning effects where the objective is to minimize the total tardiness. A branch-and-bound algorithm and two heuristic algorithms are established to search for the optimal and near-optimal solutions. Computational experiments are also given to evaluate the performance of the algorithms. (C) 2012 Elsevier B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/j.ijpe.2012.08.014
http://hdl.handle.net/11536/20794
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2012.08.014
期刊: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume: 141
Issue: 1
起始頁: 327
結束頁: 334
顯示於類別:期刊論文


文件中的檔案:

  1. 000312759600030.pdf