Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
From MaRDI portal
Publication:3163328
DOI10.1080/00207540802534707zbMath1197.90185OpenAlexW2090851837MaRDI QIDQ3163328
Zne-Jung Lee, Jatinder N. D. Gupta, Shih-Wei Lin, Kuo-Ching Ying
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
schedulingmakespansimulated annealing algorithmdue datesnon-permutation schedulesflowshop manufacturing cellsequence dependent family setups
Related Items (7)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Effect of solution representations on tabu search in scheduling applications ⋮ A comprehensive review of flowshop group scheduling literature ⋮ Flow shop batching and scheduling with sequence-dependent setup times ⋮ Family scheduling with batch availability in flow shops to minimize makespan ⋮ A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ 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
This page was built for publication: Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
