Minimizing flow time in a flow-line manufacturing cell with family setup times
From MaRDI portal
Publication:5200787
DOI10.1057/palgrave.jors.2601971zbMath1090.90082MaRDI 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
lower bounds; heuristic algorithms; flowshop scheduling; empirical results; family setups; manufacturing cells
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90B30: Production models
Related Items
Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times, A comprehensive review of flowshop group scheduling literature, A survey of scheduling problems with setup times or costs, Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups