Non-resumable scheduling on a single bounded parallel-batch machine with flexible maintenance
From MaRDI portal
Cites work
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- A survey of scheduling with parallel batch (p-batch) processing
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Imperfect maintenance
- Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities
- Improved bounds for batch scheduling with nonidentical job sizes
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
- Machine scheduling with an availability constraint
- Machine scheduling with availability constraints
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
- Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Scheduling with limited machine availability
- Single-machine scheduling with periodic maintenance to minimize makespan
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
This page was built for publication: Non-resumable scheduling on a single bounded parallel-batch machine with flexible maintenance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955216)
