Elimination methods in them ×n sequencing problem
From MaRDI portal
Cited in
(9)- A new integer programming formulation for the permutation flowshop problem
- An adaptive branching rule for the permutation flow-shop problem
- The job shop scheduling problem: Conventional and new solution techniques
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
- Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
- Flowshop scheduling research after five decades
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
- An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
This page was built for publication: Elimination methods in them ×n sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5648151)
