Heuristic and exact algorithms for the identical parallel machine scheduling problem
DOI10.1287/IJOC.1070.0246zbMATH Open1243.90060OpenAlexW2052841853MaRDI QIDQ2901015FDOQ2901015
Authors: Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci 
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1070.0246
Recommendations
- An exact algorithm for the identical parallel machine scheduling problem.
- Heuristic algorithms for a complex parallel machine scheduling problem
- On the exact solution of a large class of parallel machine scheduling problems
- A new \(n \log n\) algorithm for the identical parallel machine scheduling problem
- Tight bounds for the identical parallel machine scheduling problem
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- On the complexity of scheduling problems with a fixed number of parallel identical machines
- Heuristic algorithms for scheduling jobs on identical parallel machines via measures of spread
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (24)
- Minimizing the makespan on two identical parallel machines with mold constraints
- A characterization of optimal multiprocessor schedules and new dominance rules
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- An exact algorithm for the identical parallel machine scheduling problem.
- A composite algorithm for multiprocessor scheduling
- Partial solutions and multifit algorithm for multiprocessor scheduling
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- An exact algorithm for parallel machine scheduling with conflicts
- Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems
- Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
- Improved approaches to the exact solution of the machine covering problem
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
- Heuristic algorithms for scheduling jobs on identical parallel machines via measures of spread
- An exact framework for the discrete parallel machine scheduling location problem
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- Friendly bin packing instances without integer round-up property
This page was built for publication: Heuristic and exact algorithms for the identical parallel machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901015)
