Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups

DOI10.1080/00207540802534707zbMath1197.90185MaRDI QIDQ3163328

Jatinder N. D. Gupta, Shih-Wei Lin, Kuo-Ching Ying, Zne-Jung Lee

Publication date: 25 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802534707

zbMATH Keywords

scheduling; makespan; simulated annealing algorithm; due dates; non-permutation schedules; flowshop manufacturing cell; sequence dependent family setups

Mathematics Subject Classification ID

90B30: Production models

Related Items

The third comprehensive survey on scheduling problems with setup times/costs, Effect of solution representations on tabu search in scheduling applications, Flow shop batching and scheduling with sequence-dependent setup times, A comprehensive review of flowshop group scheduling literature, Family scheduling with batch availability in flow shops to minimize makespan, Minimizing shifts for personnel task scheduling problems: a three-phase algorithm

Cites Work

• The two-machine sequence dependent flowshop scheduling problem
• Permutation vs. non-permutation flow shop schedules
• Scheduling a flowline manufacturing cell with sequence dependent family setup times
• A survey of scheduling problems with setup times or costs
• A one-step tabu search algorithm for manufacturing cell design
• An evaluation of group scheduling heuristics in a flow-line manufacturing cell
• Group scheduling in a two-stage flowshop
• Heuristics and sequence-dependent set-up jobs in flow line cells
• Minimizing flow time in a flow-line manufacturing cell with family setup times