Abstract
Given a set of identical parallel machines and a set of jobs with different due dates and release times, we consider the problem of finding a schedule such that the number of late jobs is minimized, where the given due dates and release times are assumed to be agreeable. A heuristic algorithm is presented and a dynamic programming lower bounding procedure is developed. Computational experiments are performed to show the effectiveness of the heuristic. © 1995.
| Original language | English |
|---|---|
| Pages (from-to) | 277-283 |
| Journal | Computers and Operations Research |
| Volume | 22 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Mar 1995 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Fingerprint
Dive into the research topics of 'A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver