Tight bounds for the identical parallel machine scheduling problem
From MaRDI portal
Recommendations
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- Lower bounds for scheduling on identical parallel machines with heads and tails
- A general lower bound for the makespan problem
- Lower bounds for parallel machine scheduling problems
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
Cites work
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- A general lower bound for the makespan problem
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Algorithms for Scheduling Independent Tasks
- An exact algorithm for the identical parallel machine scheduling problem.
- Applying tabu search with influential diversification to multiprocessor scheduling
- Design and evaluation of tabu search algorithms for multiprocessor scheduling
- Dynamic programming on the word RAM
- Fast lifting procedures for the bin packing problem
- Improving local search heuristics for some scheduling problems. I
- Improving local search heuristics for some scheduling problems. II
- Local search metaheuristics for discrete-continuous scheduling problems
- Lower bounds for scheduling on identical parallel machines with heads and tails
- Optimal Scheduling of Tasks on Identical Parallel Processors
Cited in
(26)- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
- Maximizing the minimum completion time on parallel machines
- Heuristics and exact methods for number partitioning
- A general lower bound for the makespan problem
- Improved bounds on relaxations of a parallel machine scheduling problem
- Ergonomic workplace design in the fast pick area
- Improved algorithms to minimize workload balancing criteria on identical parallel machines
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
- On lower and upper bounds for single machine parallel batch scheduling
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
- Heuristic and exact algorithms for the identical parallel machine scheduling problem
- An optimization-based heuristic for the machine reassignment problem
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- Bee colony optimization for scheduling independent tasks to identical processors
- A simulation-based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations
- Lower bounds for scheduling on identical parallel machines with heads and tails
- Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
- Measuring the slack between lower bounds for scheduling on parallel machines
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- A characterization of optimal multiprocessor schedules and new dominance rules
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- Partial solutions and multifit algorithm for multiprocessor scheduling
- Lower bounds for parallel machine scheduling problems
This page was built for publication: Tight bounds 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 Q3429035)
