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.
|Number of pages||4|
|Journal||International Journal on Policy and Information|
|Publication status||Published - 1 Dec 1985|
ASJC Scopus subject areas