Dynamic task assignment for throughput maximization with worksharing
From MaRDI portal
Recommendations
- Design and operation of dynamic assembly lines using work-sharing
- Bi-directional work sharing in assembly lines with strict and flexible assembly sequences
- Optimal dynamic assignment of a flexible worker on an open production line with specialists
- A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis
- Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
Cites work
Cited in
(15)- Embedding optimization with deterministic discrete event simulation for assignment of cross-trained operators: an assembly line case study
- Shop scheduling problems with pliable jobs
- Online retailers' promotional pricing, free-shipping threshold, and inventory decisions: a simulation-based analysis
- Optimal dynamic assignment of a flexible worker on an open production line with specialists
- A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs
- 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
- Prioritized customer order scheduling to maximize throughput
- Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment
- Dynamic control of a closed two-stage queueing network for outfitting process in shipbuilding
- Work-competitive scheduling for cooperative computing with dynamic groups
- Design and operation of dynamic assembly lines using work-sharing
- Dynamic load balancing with flexible workers
- Performance of serial assembly line designs under unequal operator speeds and learning
- Throughput optimization in two-machine flowshops with flexible operations
This page was built for publication: Dynamic task assignment for throughput maximization with worksharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569071)