Exact algorithms for single-machine scheduling with time windows and precedence constraints

DOI10.1007/S10951-015-0428-YzbMath1347.90037OpenAlexW2021426411MaRDI QIDQ310349

Roel Leus, Fabrice Talla Nobibon, Morteza Davari, Erik L. Demeulemeester

Publication date: 8 September 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/494595

zbMATH Keywords

single-machine schedulingbranch and boundmixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Minimizing makespan on a single machine with release dates and inventory constraints ⋮ Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints ⋮ Precedence theorems and dynamic programming for the single-machine weighted tardiness problem ⋮ Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers

Uses Software

• RanGen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The concrete delivery problem
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Scheduling with release dates on a single machine to minimize total weighted completion time
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• A dynamic programming method for single machine scheduling
• Scheduling problems in parallel systems for telecommunications
• An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
• Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• Dual decomposition of a single-machine scheduling problem
• An exact algorithm for single-machine scheduling without machine idle time
• An exact algorithm for the precedence-constrained single-machine scheduling problem
• The two-machine flow shop problem with arbitrary precedence relations
• Maximum series-parallel subgraph
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• Rangen: A random network generator for activity-on-the-node networks
• A Dynamic Programming Approach to Sequencing Problems
• A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Minimizing Weighted Completion Times with Deadlines
• A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Recognition of Series Parallel Digraphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine scheduling with deadlines, release and due dates
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Scheduling
• A new dominance rule to minimize total weighted tardiness with unequal release dates.

This page was built for publication: Exact algorithms for single-machine scheduling with time windows and precedence constraints