Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
From MaRDI portal
Recommendations
- Approximation algorithms for scheduling unrelated parallel machines
- Improved approximation schemes for scheduling unrelated parallel machines
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
Cited in
(25)- Heuristics for unrelated machine scheduling with precedence constraints
- Unrelated parallel machine scheduling using local search
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Modeling and solving rich quay crane scheduling problems
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Exploiting process plan flexibility in production scheduling: A multi-objective approach
- Workload balancing and loop layout in the design of a flexible manufacturing system
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Exact makespan minimization of unrelated parallel machines
- An exact approach for the personnel task rescheduling problem with task retiming
- Zero duality gap in surrogate constraint optimization: a concise review of models
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling
- Unrelated parallel machine scheduling -- perspectives and progress
- The duality of jobs and machines in scheduling
- Scheduling tasks on unrelated machines: large neighborhood improvement procedures
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Revisiting the development trajectory of parallel machine scheduling
- Branch-and-bound algorithms as polynomial-time approximation schemes
- Iterated greedy local search methods for unrelated parallel machine scheduling
This page was built for publication: Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202586)
