Elimination methods in them ×n sequencing problem

DOI10.1002/nav.3800180302zbMath0237.90044OpenAlexW1561813989MaRDI QIDQ5648151

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

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

Related Items

A new integer programming formulation for the permutation flowshop problem, Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem, An adaptive branching rule for the permutation flow-shop problem, Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems, Elimination conditions and lower bounds for the permutation flow-shop sequencing problem, The job shop scheduling problem: Conventional and new solution techniques, Flowshop scheduling research after five decades, Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems