The generalization of scheduling with machine cost
From MaRDI portal
Recommendations
- On-line scheduling with general machine cost functions
- General stochastic single-machine scheduling with regular cost functions
- Publication:4941834
- Online scheduling with general machine cost functions
- Single-machine scheduling with general costs under compound-type distributions
- An optimal online algorithm for scheduling with general machine cost functions
- Machine scheduling problems with a general learning effect
- A revision of machine scheduling problems with a general learning effect
- Scheduling with machine cost and rejection
- scientific article; zbMATH DE number 437570
Cites work
- scientific article; zbMATH DE number 1418274 (Why is no real title available?)
- A note on online strip packing
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
- Better Online Algorithms for Scheduling with Machine Cost
- Improved Lower Bound for Online Strip Packing
- Improved online algorithms for parallel job scheduling and strip packing
- Lower bounds for on-line two-dimensional packing algorithms
- New upper and lower bounds for online scheduling with machine cost
- Online Mixed Packing and Covering
- Online multiple-strip packing
- Online scheduling of parallel jobs on two machines is 2-competitive
- Online scheduling with general machine cost functions
- Online scheduling with machine cost and rejection
- Online strip packing with modifiable boxes
- Preemptive online algorithms for scheduling with machine cost
- Scheduling parallel jobs to minimize the makespan
- Scheduling with machine cost and rejection
- Shelf Algorithms for Two-Dimensional Packing Problems
- Shelf algorithms for on-line strip packing
Cited in
(4)
This page was built for publication: The generalization of scheduling with machine cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392182)