Optimal assignment of due-dates for a single processor scheduling problem

A. Seidmann, S. S. Panwalkar, M. L. Smith

Research output: Contribution to journalArticle

141 Scopus citations

Abstract

Given processing times of n jobs on a single machine with penalties for earliness and tardiness and penalties associated with assignment of due-dates, the objective is to select optimal due-dates and optimal sequence. Scheduling procedure for the solution of this problem is presented along with proof of optimality and illustrative numerical examples.

Original languageEnglish
Pages (from-to)393-399
Number of pages7
JournalInternational Journal of Production Research
Volume19
Issue number4
DOIs
StatePublished - 1981

Fingerprint Dive into the research topics of 'Optimal assignment of due-dates for a single processor scheduling problem'. Together they form a unique fingerprint.

  • Cite this