Two-Machine Flow Shop Scheduling Problem with Blocking for Minimizing Total Tardiness
碩士 === 國立中央大學 === 工業管理研究所 === 102 === This paper considers a flow shop scheduling problem with blocking where the objective is to minimize total tardiness. There are two machines and n jobs, each job has different due date and the sequence of job is decided by machine 1. In two-machine flow shop wit...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73946716093643842354 |