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

DOI10.1016/S0167-6377(98)00007-8zbMath0911.90213OpenAlexW1977082874MaRDI QIDQ1271382

Yosef Rinott, Gur Mosheiov, Avital Lann

Publication date: 15 November 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00007-8

zbMATH Keywords

parallel machineslower boundNP-hardparallel processingasymptotic optimalityconvergence in probabilityjob overlapsmulti-operation schedulingopen shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ A new heuristic for open shop total completion time problem

Cites Work

• Large deviation theorems for empirical probability measures
• Open shops with jobs overlap
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps