An exact algorithm for the identical parallel machine scheduling problem.
From MaRDI portal
Publication:1416605
DOI10.1016/S0377-2217(02)00726-9zbMath1043.90030MaRDI QIDQ1416605
Publication date: 14 December 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (21)
A characterization of optimal multiprocessor schedules and new dominance rules ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times ⋮ An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences ⋮ The affine hull of the schedule polytope for servicing identical requests by parallel devices ⋮ Tight bounds for the identical parallel machine‐scheduling problem: Part II ⋮ Partial solutions and multifit algorithm for multiprocessor scheduling ⋮ Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time ⋮ Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests ⋮ 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 ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Bee colony optimization for scheduling independent tasks to identical processors ⋮ A cutting plane approach for integrated planning and scheduling ⋮ Two branch-and-bound algorithms for the robust parallel machine scheduling problem ⋮ A composite algorithm for multiprocessor scheduling ⋮ Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments ⋮ Optimal and heuristic solution methods for a multiprocessor machine scheduling problem ⋮ A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times ⋮ Tight bounds for the identical parallel machine scheduling problem ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Valid inequalities for mixed 0-1 programs
- List scheduling algorithms to minimize the makespan on identical parallel machines
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
- Scheduling with Deadlines and Loss Functions
- An Application of Bin-Packing to Multiprocessor Scheduling
- Computational Complexity of Discrete Optimization Problems
This page was built for publication: An exact algorithm for the identical parallel machine scheduling problem.
