A capacity allocation problem with integer side constraints

DOI10.1016/S0377-2217(98)80011-8zbMath0951.90033OpenAlexW1996515188MaRDI QIDQ1296707

L. Beril Toktay, Reha Uzsoy

Publication date: 2 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)80011-8

zbMATH Keywords

schedulingnetwork flowssemiconductor manufacturing

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90)

Related Items

Infinite capacity planning for IC packaging plants, Capacity planning of serial and batch machines with capability constraints for wafer fabrication plants, Production systems with limited repair capacity, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting, A batch arrival queue under randomised multi-vacation policy with unreliable server and repair, Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches, Lower bounding techniques for the degree-constrained network design problem, Heuristic algorithms to solve the capacity allocation problem in photolithography area (CAPPA), Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems, Tool capacity planning in semiconductor manufacturing.

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A facet generation and relaxation technique applied to an assignment problem with side constraints
• Networks synthesis and optimum network design problems: Models, solution methods and applications