A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell

DOI10.1080/00207549108948058zbMath0729.90531OpenAlexW2026751151MaRDI QIDQ3354532

Kevin J. Dooley, Farzad Mahmoodi

Publication date: 1991

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Non-exhaustive family based dispatching heuristics–exploiting variances of processing and set-up times ⋮ A comprehensive review of flowshop group scheduling literature ⋮ Performance of hybrid cellular manufacturing systems: A computer simulation investigation ⋮ Reducing flow between manufacturing cells: a sensitivity analysis ⋮ Impact of family-based scheduling on transfer batches in a job shop manufacturing cell ⋮ Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times ⋮ Family-based dispatching: anticipating future jobs ⋮ Group scheduling on two cells with intercell movement ⋮ An evaluation of group scheduling heuristics in a flow-line manufacturing cell ⋮ A comparison of scheduling philosophies for manufacturing cells

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell