OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
From MaRDI portal
Publication:4903636
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
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- On-line scheduling of small open shops
- Scheduling algorithms
Cited in
(5)- Online algorithms to schedule a proportionate flexible flow shop of batching machines
- Optimal semi-online algorithm for scheduling on two parallel batch processing machines
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
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)