Exact solution procedures for certain planning problems in flexible manufacturing systems

DOI10.1016/S0305-0548(97)81035-0zbMath0889.90076MaRDI QIDQ1374031

Meltem Denizel, S. Selcuk Erenguc

Publication date: 2 December 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound; single machine; production planning; lot-sizing; flexible manufacturing; machine loading; multiple machines; multi-period planning horizon; part-type selection

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B30: Production models

Related Items

Optimal inventory costs in a complementary flexible manufacturing system, Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems, An effective genetic algorithm approach to large scale mixed integer programming problems

Cites Work

• Unnamed Item
• A polynomial algorithm for a multi-item capacitated production planning problem
• Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• Modelling and solving an FMS part selection problem
• A due date-based approach to part type selection in flexible manufacturing systems