Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut

DOI10.1007/978-3-319-45587-7_27zbMATH Open1451.90060OpenAlexW2516019428MaRDI QIDQ2835686FDOQ2835686

Authors Imed Kacem, Sébastien Martin, Izzeldin M. Osman 

Publication date 30 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-45587-7_27

zbMATH Keywords

schedulingbranch-and-cutvalid inequalitiesprecedence constraintsunrelated parallel machinespolyhedral

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A cutting plane algorithm for the unrelated parallel machine scheduling problem
• Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes
• Multiprocessor scheduling under precedence constraints: polyhedral results
• A branch-and-bound algorithm for uniform machines scheduling problem with in-tree precedence constraints
• Single-Machine Scheduling Polyhedra with Precedence Constraints

Cites work

• scientific article; zbMATH DE number 780782 (Why is no real title available?)
• A cutting plane algorithm for the unrelated parallel machine scheduling problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Multiprocessor scheduling under precedence constraints: polyhedral results
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel dedicated machines scheduling with chain precedence constraints
• Parallel machine scheduling with precedence constraints and setup times
• Polyhedral techniques in combinatorial optimization II: applications and computations
• Representation of a finite graph by a set of intervals on the real line
• Scheduling on unrelated machines under tree-like precedence constraints

Cited in

(3)

• Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes
• A new heuristic and an exact approach for a production planning problem
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem

This page was built for publication: Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut

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