Tight bounds for the identical parallel machine scheduling problem

DOI10.1111/j.1475-3995.2006.00562.xzbMath1135.90015OpenAlexW2046340429MaRDI QIDQ3429035

Mohamed Haouari, Mahdi Jemmali, Anis Gharbi

Publication date: 30 March 2007

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2006.00562.x

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (14)

A characterization of optimal multiprocessor schedules and new dominance rules ⋮ Ergonomic workplace design in the fast pick area ⋮ An optimization-based heuristic for the machine reassignment problem ⋮ Improved algorithms to minimize workload balancing criteria on identical parallel machines ⋮ Tight bounds for the identical parallel machine‐scheduling problem: Part II ⋮ Partial solutions and multifit algorithm for multiprocessor scheduling ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ Minimizing the maximal ergonomic burden in intra-hospital patient transportation ⋮ Bee colony optimization for scheduling independent tasks to identical processors ⋮ A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations ⋮ A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules ⋮ Maximizing the minimum completion time on parallel machines ⋮ Heuristics and exact methods for number partitioning ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem

Cites Work

• Lower bounds for scheduling on identical parallel machines with heads and tails
• A general lower bound for the makespan problem
• Design and evaluation of tabu search algorithms for multiprocessor scheduling
• Local search metaheuristics for discrete-continuous scheduling problems
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• Applying tabu search with influential diversification to multiprocessor scheduling
• An exact algorithm for the identical parallel machine scheduling problem.
• Dynamic programming on the word RAM
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• Improving local search heuristics for some scheduling problems. I
• Fast lifting procedures for the bin packing problem
• Algorithms for Scheduling Independent Tasks
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Improving local search heuristics for some scheduling problems. II

This page was built for publication: Tight bounds for the identical parallel machine scheduling problem