Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut

DOI10.1007/978-3-319-45587-7_27zbMath1451.90060OpenAlexW2516019428MaRDI QIDQ2835686

No author found.

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

schedulingvalid inequalitiesunrelated parallel machinesprecedence constraintsbranch-and-cutpolyhedral

Mathematics Subject Classification ID

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

Related Items (1)

A new heuristic and an exact approach for a production planning problem

Cites Work

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

This page was built for publication: Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut