Tight bounds for the identical parallel machine‐scheduling problem: Part II

DOI10.1111/J.1475-3995.2007.00605.XMaRDI QIDQ3502134zbMATH OpenOpenAlexFDO

Authors Mohamed Haouari, Mahdi Jemmali

Publication date 22 May 2008

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.2007.00605.x

zbMATH Keywords

lower bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tight bounds for the identical parallel machine scheduling problem
• An exact algorithm for the identical parallel machine scheduling problem.
• Maximizing the minimum completion time on parallel machines
• A general lower bound for the makespan problem
• 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 multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• An exact algorithm for the identical parallel machine scheduling problem.
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Improving Discrete Model Representations via Symmetry Considerations
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Tight bounds for the identical parallel machine scheduling problem

Cited in

(15)

• Maximizing the minimum completion time on parallel machines
• Heuristics and exact methods for number partitioning
• Improved bounds on relaxations of a parallel machine scheduling problem
• An exact algorithm for the identical parallel machine scheduling problem.
• FPTAS for the two identical parallel machine problem with a single operator under the free changing mode
• Two branch-and-bound algorithms for the robust parallel machine scheduling problem
• MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints
• A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
• Tight bounds for the identical parallel machine scheduling problem
• Relaxations and exact solution of the variable sized bin packing problem
• 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
• A joint scheduling approach for production and material handling under customized manufacturing paradigm
• A characterization of optimal multiprocessor schedules and new dominance rules

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3502134)