A branch and bound algorithm for the minimum storage-time sequencing problem

DOI10.1002/nav.11zbMath1077.90080OpenAlexW2128330077MaRDI QIDQ4434517

Paolo Detti, Dario Pacciarelli

Publication date: 10 November 2003

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.11

zbMATH Keywords

linear orderingsingle processor scheduling

Mathematics Subject Classification ID

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

Related Items

Memory management optimization problems for integrated circuit simulators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More facets from fences for linear ordering and acyclic subgraph polytopes
• On the integral dicycle packings and covers and the linear ordering polytope
• Edmonds polytopes and a hierarchy of combinatorial problems
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
• The Recognition of Series Parallel Digraphs
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Single Machine Job Sequencing with Precedence Constraints
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Algoristics for Single-Machine Sequencing with Precedence Constraints
• Optimal Linear Ordering
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints