Minimizing flow time in a flow-line manufacturing cell with family setup times

DOI10.1057/palgrave.jors.2601971zbMath1090.90082OpenAlexW2028078907MaRDI QIDQ5200787

Jatinder N. D. Gupta, Jeffrey E. Schaller

Publication date: 11 April 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601971

zbMATH Keywords

lower boundsheuristic algorithmsflowshop schedulingempirical resultsfamily setupsmanufacturing cells

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups ⋮ A comprehensive review of flowshop group scheduling literature ⋮ A survey of scheduling problems with setup times or costs ⋮ Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times