A hybrid branch-and-cut algorithm for the one-machine scheduling problem
From MaRDI portal
Recommendations
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- scientific article; zbMATH DE number 702559
- Minimizing late jobs in the general one machine scheduling problem
- New exact algorithms for one-machine earliness-tardiness scheduling
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
Cited in
(9)- Constraint programming and operations research
- Scheduling a single machine to minimize a regular objective function under setup constraints
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- Logic-based Benders decomposition for large-scale optimization
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- Minimizing the weighted number of tardy jobs on a single machine with release dates
This page was built for publication: A hybrid branch-and-cut algorithm for the one-machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713895)
