Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm
From MaRDI portal
Publication:3168941
DOI10.1080/00207540903490163zbMath1210.90076MaRDI QIDQ3168941
Publication date: 27 April 2011
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540903490163
job shop; capacity planning; task assignment; closed Jackson queueing networks; concurrent genetic algorithm; coupled optimisation problems
Cites Work
- Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem
- Capacity planning in manufacturing networks with discrete options
- Heuristics for capacity planning problems with congestion
- Stochastic programming based capacity planning for semiconductor wafer fab with uncertain demand and capacity
- A review of open queueing network models of manufacturing systems
- Design of manufacturing systems using queueing models
- Tool capacity planning for semiconductor fabrication facilities under demand uncertainty
- Tool capacity planning in semiconductor manufacturing.
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- Dynamic task assignment for throughput maximization with worksharing
- Performance evaluation and capacity planning in a metallurgical job-shop system using open queueing network models
- Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches
- An improved mathematical program to solve the simple assembly line balancing problem
- Two-stage simulation optimization for agile manufacturing capacity planning
- Robust capacity planning in semiconductor manufacturing
- Computational algorithms for closed queueing networks with exponential servers
