Two-machine flowshop scheduling with truncated learning to minimize the total completion time

Der Chiang Li, Peng Hsiang Hsu, Chin Chia Wu, T. C.E. Cheng

研究成果: Article同行評審

15 引文 斯高帕斯(Scopus)

摘要

Scheduling with learning effects has received a lot of research attention lately. However, the flowshop setting is relatively unexplored. On the other hand, the actual processing time of a job under an uncontrolled learning effect will drop to zero precipitously as the number of jobs increases. This is rather absurd in reality. Motivated by these observations, we consider a two-machine flowshop scheduling problem in which the actual processing time of a job in a schedule is a function of the job's position in the schedule and a control parameter of the learning function. The objective is to minimize the total completion time. We develop a branch-and-bound and three simulated annealing algorithms to solve the problem. Computational results show that the proposed algorithms are efficient in producing near-optimal solutions.

原文English
頁(從 - 到)655-662
頁數8
期刊Computers and Industrial Engineering
61
發行號3
DOIs
出版狀態Published - 2011 十月

All Science Journal Classification (ASJC) codes

  • 電腦科學(全部)
  • 工程 (全部)

指紋

深入研究「Two-machine flowshop scheduling with truncated learning to minimize the total completion time」主題。共同形成了獨特的指紋。

引用此