An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
From MaRDI portal
Publication:968014
DOI10.1007/S11590-009-0163-4zbMATH Open1190.90072OpenAlexW2080478733WikidataQ57185725 ScholiaQ57185725MaRDI QIDQ968014FDOQ968014
Ming Liu, Yinfeng Xu, Feifeng Zheng, Chengbin Chu
Publication date: 3 May 2010
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0163-4
Recommendations
- On-line scheduling of two-machine open shops where jobs arrive over time
- An optimal online algorithm for scheduling two machines with release times
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
- Tighter bounds on preemptive job shop scheduling with two machines
- On-line scheduling of small open shops
Cites Work
- Title not available (Why is that?)
- Scheduling algorithms
- Title not available (Why is that?)
- Open Shop Scheduling to Minimize Finish Time
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Semi on-line scheduling on two identical machines
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- Semi-on-line scheduling on two parallel processors with an upper bound on the items
- New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
- Title not available (Why is that?)
- On-line scheduling of small open shops
Cited In (3)
This page was built for publication: An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968014)
