On-line scheduling of two-machine open shops where jobs arrive over time
From MaRDI portal
Publication:1383798
DOI10.1023/A:1009786526733zbMath0897.90123OpenAlexW1562890522MaRDI QIDQ1383798
Bo Chen, Gerhard J. Woeginger, Arjen P. A. Vestjens
Publication date: 13 April 1998
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009786526733
makespanheuristic algorithmon-line schedulingtwo-machine open shopsworst-case guaranteeworst-case performance ratios
Related Items (6)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan ⋮ On-line two-machine open shop scheduling with time lags ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Non-clairvoyant weighted flow time scheduling on different multi-processor models ⋮ A linear time approximation scheme for makespan minimization in an open shop with release dates
This page was built for publication: On-line scheduling of two-machine open shops where jobs arrive over time
