TY - JOUR

T1 - Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems

AU - Federgruen, Awi

AU - Mosheiov, Gur

PY - 1993/12

Y1 - 1993/12

N2 - Manufacturing and service organizations routinely face the challenge of scheduling jobs, orders, or individual customers in a schedule that optimizes either (i) an aggregate efficiency measure, (ii) a measure of performance balance, or (iii) some combination of these two objectives. We address these questions for single‐machine job scheduling systems with fixed or controllable due dates. We show that a large class of such problems can be optimized by solving either a single instance or a finite sequence of instances of the so‐called (SQC) problem, in which the sum of general quasiconvex functions of the jobs' completion times is to be minimized. To solve a single instance of (SQC), we develop an efficient, though pseudopolynomial algorithm, based on dynamic programming. The algorithm generates a solution that is optimal among all schedules whose starting time is restricted to the points of a prespecified (arbitrary) grid. The algorithm is embedded in an iterative procedure, where in each iteration a specific instance of (SQC) is solved. Special attention is given to the simultaneous minimization of the mean and variance of completion times. © 1993 John Wiley & Sons, Inc.

AB - Manufacturing and service organizations routinely face the challenge of scheduling jobs, orders, or individual customers in a schedule that optimizes either (i) an aggregate efficiency measure, (ii) a measure of performance balance, or (iii) some combination of these two objectives. We address these questions for single‐machine job scheduling systems with fixed or controllable due dates. We show that a large class of such problems can be optimized by solving either a single instance or a finite sequence of instances of the so‐called (SQC) problem, in which the sum of general quasiconvex functions of the jobs' completion times is to be minimized. To solve a single instance of (SQC), we develop an efficient, though pseudopolynomial algorithm, based on dynamic programming. The algorithm generates a solution that is optimal among all schedules whose starting time is restricted to the points of a prespecified (arbitrary) grid. The algorithm is embedded in an iterative procedure, where in each iteration a specific instance of (SQC) is solved. Special attention is given to the simultaneous minimization of the mean and variance of completion times. © 1993 John Wiley & Sons, Inc.

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

U2 - 10.1002/1520-6750(199312)40:7<951::AID-NAV3220400707>3.0.CO;2-1

DO - 10.1002/1520-6750(199312)40:7<951::AID-NAV3220400707>3.0.CO;2-1

M3 - Article

AN - SCOPUS:0027886805

SN - 0894-069X

VL - 40

SP - 951

EP - 970

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 7

ER -