Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
From MaRDI portal
Publication:6046629
Recommendations
- Parallel-machine scheduling problem under the job rejection constraint (extended abstract)
- Penalty cost constrained identical parallel machine scheduling problem
- scientific article; zbMATH DE number 6672186
- Parallel-machine scheduling with release dates and rejection
- Parallel machine scheduling with restricted job rejection
Cites work
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A polynomial algorithm for the multiple knapsack problem with divisible item sizes
- A survey on offline scheduling with rejection
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bin packing with divisible item sizes
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms.
- Fifty years of scheduling: a survey of milestones
- Multiprocessor Scheduling with Rejection
- On-line uniform machine scheduling with rejection
- Penalty cost constrained identical parallel machine scheduling problem
- Scheduling with Rejection to Minimize the Makespan
- Scheduling. Theory, algorithms, and systems.
Cited in
(1)
This page was built for publication: Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046629)