scientific article; zbMATH DE number 4191384
From MaRDI portal
Publication:3211098
DOI10.1002/1520-6750(199012)37:6%3C967::AID-NAV3220370616%3E3.0.CO;2-KzbMATH Open0722.90033MaRDI QIDQ3211098FDOQ3211098
Recommendations
- Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
- scientific article; zbMATH DE number 432995
- scientific article; zbMATH DE number 1834660
- Lower bounds for parallel machine scheduling problems
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
Cited in
(12)- Two very large-scale neighborhoods for single machine scheduling
- A tight lower bound for the best-\(\alpha\) algorithm
- Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
- Scheduling with target start times
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
- Multi-machine scheduling lower bounds using decision diagrams
- A mixed integer programming approach for the single machine problem with unequal release dates
- Range of lower bounds
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- Title not available (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211098)
