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

DOI10.1080/00207549108948058MaRDI QIDQ3354532zbMATH OpenOpenAlexFDO

Authors Farzad Mahmoodi, Kevin Dooley

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

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

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3354532)