Two-Machine Flow Shops Scheduling to Minimize Job Independent Earliness and Tardiness Penalties with a Given Common Due Date

碩士 === 國立中央大學 === 工業管理研究所 === 93 === This study deals with the two-machine flow shops scheduling problem with the consideration of earliness and tardiness penalties. There are multiple jobs with a given common due date to be scheduled. All jobs have equal earliness and tardiness weights, and the wei...

Full description

Bibliographic Details
Main Authors: Shih-Kai Hsu, 徐士凱
Other Authors: Gwo-Ji Sheen
Format: Others
Language:en_US
Published: 2005
Online Access:http://ndltd.ncl.edu.tw/handle/86456208992008676701

Similar Items