TY - JOUR

T1 - Minmax scheduling problems with common flow-allowance

AU - Mor, B.

AU - Mosheiov, G.

PY - 2012/9

Y1 - 2012/9

N2 - In due-date assignment problems with a common flow-allowance, the due-date of a given job is defined as the sum of its processing time and a job-independent constant. We study flow-allowance on a single machine, with an objective function of a minmax type. The total cost of a given job consists of its earliness/tardiness and its flow-allowance cost components. Thus, we seek the job schedule and flow-allowance value that minimize the largest cost among all the jobs. Three extensions are considered: the case of general position-dependent processing times, the model containing an explicit cost for the due-dates, and the setting of due-windows. Properties of optimal schedules are fully analysed in all cases, and all the problems are shown to have polynomial time solutions.

AB - In due-date assignment problems with a common flow-allowance, the due-date of a given job is defined as the sum of its processing time and a job-independent constant. We study flow-allowance on a single machine, with an objective function of a minmax type. The total cost of a given job consists of its earliness/tardiness and its flow-allowance cost components. Thus, we seek the job schedule and flow-allowance value that minimize the largest cost among all the jobs. Three extensions are considered: the case of general position-dependent processing times, the model containing an explicit cost for the due-dates, and the setting of due-windows. Properties of optimal schedules are fully analysed in all cases, and all the problems are shown to have polynomial time solutions.

KW - due-date assignment

KW - flow-allowance

KW - minmax

KW - scheduling

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

U2 - 10.1057/jors.2011.135

DO - 10.1057/jors.2011.135

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84864723759

SN - 0160-5682

VL - 63

SP - 1284

EP - 1293

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 9

ER -