Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
Loading tools to machines in flexible manufacturing systems
Computers and Industrial Engineering
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Tool capacity planning in semiconductor manufacturing
Computers and Operations Research
Computers and Operations Research
Beam search algorithm for capacity allocation problem in flexible manufacturing systems
Computers and Industrial Engineering
Capacity investment decision in co-opetitive network by information sharing
Computers and Industrial Engineering
| Hi-index | 0.01 |
We address an operation assignment and capacity allocation problem that arises in semiconductor industries and flexible manufacturing systems. We assume the automated machines have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. We show that the problem is NP-hard in the strong sense, develop two heuristics and a Tabu Search procedure. The results of our computational tests have revealed that our Tabu Search procedure produces near optimal solutions very quickly.