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

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

doi:10.1080/00207548108956667

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

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

Industrial Engineering

Research output: Contribution to journal › Article › peer-review

163 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 language	English
Pages (from-to)	393-399
Number of pages	7
Journal	International Journal of Production Research
Volume	19
Issue number	4
DOIs	https://doi.org/10.1080/00207548108956667
State	Published - 1981

Access to Document

10.1080/00207548108956667

Cite this

@article{b5bef61dab2c464a9280e020536dc691,

title = "Optimal assignment of due-dates for a single processor scheduling problem",

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.",

author = "A. Seidmann and Panwalkar, {S. S.} and Smith, {M. L.}",

year = "1981",

doi = "10.1080/00207548108956667",

language = "English",

volume = "19",

pages = "393--399",

journal = "International Journal of Production Research",

issn = "0020-7543",

number = "4",

}

TY - JOUR

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

AU - Seidmann, A.

AU - Panwalkar, S. S.

AU - Smith, M. L.

PY - 1981

Y1 - 1981

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0019593685&partnerID=8YFLogxK

U2 - 10.1080/00207548108956667

DO - 10.1080/00207548108956667

M3 - Article

AN - SCOPUS:0019593685

SN - 0020-7543

VL - 19

SP - 393

EP - 399

JO - International Journal of Production Research

JF - International Journal of Production Research

IS - 4

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this