Improved approaches to the exact solution of the machine covering problem
From MaRDI portal
Publication:2398644
DOI10.1007/s10951-016-0477-xzbMath1373.90064OpenAlexW2339014329MaRDI QIDQ2398644
Alexander Lawrinenko, Martin Wirth, Rico Walter
Publication date: 18 August 2017
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-016-0477-x
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
A characterization of optimal multiprocessor schedules and new dominance rules, Improved algorithms to minimize workload balancing criteria on identical parallel machines
Cites Work
- Comparing the minimum completion times of two longest-first scheduling-heuristics
- Inverse scheduling: Two-machine flow-shop problem
- Optimal semi-online algorithms for machine covering
- Maximizing the minimum completion time on parallel machines
- Inverse scheduling with maximum lateness objective
- The exact LPT-bound for maximizing the minimum completion time
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- An exact algorithm for the dual bin packing problem
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Inverse Optimization
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Scheduling of Tasks on Identical Parallel Processors
- SEMI-ONLINE MACHINE COVERING
- Bounds on Multiprocessing Timing Anomalies
- Max-min Online Allocations with a Reordering Buffer
- Approximation and Online Algorithms
- On-line machine covering
