Search tree based approaches for parallel machine scheduling

DOI10.1016/j.cor.2006.07.008zbMath1179.90148OpenAlexW2065829321MaRDI QIDQ941538

Francis Sourd, Emmanuel Néron, Fabrice Tercinet

Publication date: 1 September 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.008

zbMATH Keywords

makespanrelease datestailsparallel machine schedulingsearch tree

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling preparation of doses for a chemotherapy service ⋮ A simulated annealing approach to minimize the maximum lateness on uniform parallel machines ⋮ Jackson's semi-preemptive scheduling on a single machine ⋮ Parallel machine scheduling with precedence constraints and setup times ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints ⋮ A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem

Cites Work

• Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
• Looking ahead with the pilot method
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• A general lower bound for the makespan problem
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• Minimizing makespan on parallel machines subject to release dates and delivery times
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Fiber-to-object assignment heuristics
• An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
• Scheduling tasks on unrelated machines: large neighborhood improvement procedures