Scheduling identical jobs and due-window on uniform machines |
| |
| Authors: | Gur Mosheiov Assaf Sarig |
| |
| Affiliation: | School of Business Administration and Department of Statistics, The Hebrew University, Jerusalem 91905, Israel |
| |
| Abstract: | We extend a classical common due-window assignment problem to a setting of parallel uniform machines. Jobs are assumed to have identical processing times. The objective is minimum earliness, tardiness, due-window starting time, and due-window size. We focus on the case of two machines. Despite the many (12) candidate schedules for optimality, an efficient constant time solution is introduced. |
| |
| Keywords: | Scheduling Earliness Tardiness Uniform machines Due-window |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
