| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6897904 | European Journal of Operational Research | 2013 | 7 Pages |
Abstract
⺠We study a scheduling problem of identical jobs on parallel uniform machines. ⺠A common due-window is assumed, and job-dependent earliness/tardiness unit costs are considered. ⺠The objective function is minimum total earliness/tardiness cost. ⺠A non-restrictive and restrictive due-window are studied. ⺠We introduce efficient polynomial-time algorithms for both cases.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Enrique Gerstl, Gur Mosheiov,