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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/86456208992008676701 |
| Summary: | 碩士 === 國立中央大學 === 工業管理研究所 === 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 weight of a job depends on whether the job is early or late, which are job-independent. The objective is to find a schedule that minimizes the weighted sum of earliness and tardiness penalties.
We propose a number of propositions and revised Bagchi’s algorithm as a lower bound, which are implemented in our branch-and-bound algorithm to eliminate nodes efficiently in the branching tree. We also conduct computational analysis to show the validation and the effectiveness of our algorithm compared with enumeration.
|
|---|