A characterization of optimal multiprocessor schedules and new dominance rules
From MaRDI portal
Publication:830925
DOI10.1007/S10878-020-00634-9zbMath1468.90057OpenAlexW3048379760MaRDI QIDQ830925
Rico Walter, Alexander Lawrinenko
Publication date: 10 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00634-9
Cites Work
- Unnamed Item
- On an extension of the Sort \& Search method with application to scheduling theory
- Dominance rules in combinatorial optimization problems
- Bee colony optimization for scheduling independent tasks to identical processors
- A composite algorithm for multiprocessor scheduling
- Inverse scheduling: Two-machine flow-shop problem
- Scheduling and fixed-parameter tractability
- Inverse scheduling with maximum lateness objective
- An exact algorithm for the identical parallel machine scheduling problem.
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- The longest processing time rule for identical parallel machines revisited
- Improved approaches to the exact solution of the machine covering problem
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
- Tight bounds for the identical parallel machine scheduling problem
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- Inverse Optimization
- An Application of Bin-Packing to Multiprocessor Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: A characterization of optimal multiprocessor schedules and new dominance rules
