Scheduling on Multiple Flowshops to Minimize the Makespan

碩士 === 國立交通大學 === 資訊管理研究所 === 95 === In this thesis, we consider a multi-flowshop scheduling problem, where a set of jobs is to be processed on multiple identical flowshops. The objective is to minimize the makespan, i.e. the maximum completion time of the jobs. This problem is NP-hard because it is...

Full description

Bibliographic Details
Main Authors: Y.T. Lin, 林延聰
Other Authors: B.M.T. Lin
Format: Others
Language:en_US
Published: 2007
Online Access:http://ndltd.ncl.edu.tw/handle/12038431092997468673