Dynamic task assignment for throughput maximization with worksharing

DOI10.1016/j.ejor.2004.07.033zbMath1083.90504OpenAlexW2094772745MaRDI QIDQ2569071

Ronald G. Askin, Jiaqiong Chen

Publication date: 17 October 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.033

zbMATH Keywords

productionthroughput maximizationcross-trainingdynamic line balancingworksharing

Mathematics Subject Classification ID

Production models (90B30)

Related Items

Sample Path Optimal Policies for Serial Lines with Flexible Workers ⋮ Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm ⋮ A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs ⋮ Prioritized customer order scheduling to maximize throughput ⋮ Dynamic control of a closed two-stage queueing network for outfitting process in shipbuilding ⋮ Dynamic load balancing with flexible workers ⋮ Throughput optimization in two-machine flowshops with flexible operations ⋮ Shop scheduling problems with pliable jobs ⋮ Optimal dynamic assignment of a flexible worker on an open production line with specialists ⋮ Online retailers' promotional pricing, free-shipping threshold, and inventory decisions: a simulation-based analysis

Cites Work

• Unnamed Item
• A comparison of scheduling philosophies for manufacturing cells
• A general framework for comparing operating policies in manufacturing cells
• A Production Line that Balances Itself