Abstract
This paper presents an algorithm to schedule n independent jobs on m identical and parallel machines so that the job due dates are met and the total elapsed time to complete the jobs is minimized. Results of some computer simulation experiments to test the algorithm are presented and discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 137-140 |
| Number of pages | 4 |
| Journal | International Journal on Policy and Information |
| Volume | 9 |
| Issue number | 2 |
| Publication status | Published - 1 Dec 1985 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Engineering