An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
DOI10.1287/IJOC.2020.0988zbMATH Open1492.90062OpenAlexW3100759455MaRDI QIDQ5085478FDOQ5085478
Authors: Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson 
Publication date: 27 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.0988
Recommendations
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- A branch and bound algorithm for minimizing weighted completion times with deadlines
- An improved heuristic for one-machine scheduling with delays constraints
- scientific article; zbMATH DE number 4055356
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Mixed integer programming: analyzing 12 years of progress
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- The one-machine sequencing problem
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- A modified shifting bottleneck procedure for job-shop scheduling
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- Sequencing with due-dates and early start times to minimize maximum tardiness
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- Minimizing maximum lateness on one machine: computational experience and some applications
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- An efficient ILP formulation for the single machine scheduling problem
- Jackson's semi-preemptive scheduling on a single machine
- Cyclic best first search: using contours to guide branch-and-bound algorithms
Cited In (3)
Uses Software
This page was built for publication: An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085478)
