OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
From MaRDI portal
Publication:4903636
DOI10.1142/S1793830912500516zbMATH Open1259.68021MaRDI QIDQ4903636FDOQ4903636
Authors: Ming Liu, Chengbin Chu
Publication date: 24 January 2013
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Recommendations
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
- Optimal semi-online algorithm for scheduling on two parallel batch processing machines
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
- Online algorithms to schedule a proportionate flexible flow shop of batching machines
- Optimal Semi-online Scheduling Algorithms on a Small Number of Machines
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
- On-line and semi-online scheduling for flow shop problems on two machines
- Semi-online algorithms for parallel machine scheduling problems
Cites Work
Cited In (5)
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- Optimal semi-online algorithm for scheduling on two parallel batch processing machines
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
- Online algorithms to schedule a proportionate flexible flow shop of batching machines
This page was built for publication: OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903636)