TY - JOUR

T1 - Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps

AU - Lann, Avital

AU - Mosheiov, Gur

AU - Rinott, Yosef

PY - 1998/3/1

Y1 - 1998/3/1

N2 - The assumption that different operations of a given job cannot be processed simultaneously is accepted in most classical multi-operation scheduling models. There are, however, real-life applications where parallel processing (within a given job) is possible. In this paper we study open shops with job overlaps, i.e., scheduling systems in which each job requires processing operations by M different machines, and different operations of a single job may be processed in parallel. The problem of computing an optimal schedule, that is, ordering the jobs' operations for each machine with the objective of minimizing the sum of job completion times, is NP-hard. A simple heuristic, based on ordering the jobs by the average processing time of the M operations required for each job, and a lower bound on the optimal cost are introduced. The lower bound is used to prove asymptotic optimality (in probability) of the heuristic when the processing times are i.i.d. from any distribution with a finite variance.

AB - The assumption that different operations of a given job cannot be processed simultaneously is accepted in most classical multi-operation scheduling models. There are, however, real-life applications where parallel processing (within a given job) is possible. In this paper we study open shops with job overlaps, i.e., scheduling systems in which each job requires processing operations by M different machines, and different operations of a single job may be processed in parallel. The problem of computing an optimal schedule, that is, ordering the jobs' operations for each machine with the objective of minimizing the sum of job completion times, is NP-hard. A simple heuristic, based on ordering the jobs by the average processing time of the M operations required for each job, and a lower bound on the optimal cost are introduced. The lower bound is used to prove asymptotic optimality (in probability) of the heuristic when the processing times are i.i.d. from any distribution with a finite variance.

KW - Convergence in probability

KW - Parallel machines

KW - Scheduling

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

U2 - 10.1016/s0167-6377(98)00007-8

DO - 10.1016/s0167-6377(98)00007-8

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

AN - SCOPUS:0032010271

SN - 0167-6377

VL - 22

SP - 63

EP - 68

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2-3

ER -