Elimination methods in them ×n sequencing problem

DOI10.1002/NAV.3800180302zbMATH Open0237.90044OpenAlexW1561813989MaRDI QIDQ5648151FDOQ5648151

Authors: Wlodzimierz Szwarc 

Publication date: 1971

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800180302

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited In (9)

• An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
• A new integer programming formulation for the permutation flowshop problem
• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
• 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
• An adaptive branching rule for the permutation flow-shop problem
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
• The job shop scheduling problem: Conventional and new solution techniques
• Flowshop scheduling research after five decades

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)