Heuristic and exact algorithms for the identical parallel machine scheduling problem
From MaRDI portal
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
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 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
Cited in
(29)- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
- An exact algorithm for the identical parallel machine scheduling problem.
- Minimizing the makespan on two identical parallel machines with mold constraints
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
- Friendly bin packing instances without integer round-up property
- Improved approaches to the exact solution of the machine covering problem
- An exact algorithm for parallel machine scheduling with conflicts
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- 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
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
- Heuristic algorithms for scheduling jobs on identical parallel machines via measures of spread
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems
- A composite algorithm for multiprocessor scheduling
- A k-swap local search for makespan scheduling
- Smart automated guided vehicle scheduling with flexible battery management: a new formulation and an exact approach
- Revisiting the development trajectory of parallel machine scheduling
- Approximation schemes for parallel machine scheduling to maximize total weighted early work with a common due date
- A branch and price algorithm for scheduling in surgery pre-admission testing clinics
- A characterization of optimal multiprocessor schedules and new dominance rules
- Partial solutions and multifit algorithm for multiprocessor scheduling
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)
