PREEMPTIVE DUE-DATE SCHEDULING WITH MINIMUM MAKESPAN.

Research output: Journal article publicationJournal articleAcademic researchpeer-review

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)137-140
Number of pages4
JournalInternational Journal on Policy and Information
Volume9
Issue number2
Publication statusPublished - 1 Dec 1985
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Cite this