Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
From MaRDI portal
Publication:6106764
DOI10.1016/j.ejor.2022.08.049WikidataQ114184229 ScholiaQ114184229MaRDI QIDQ6106764
Raha Akhavan-Tabatabaei, Verena Schmid, Luis Mauricio Annear
Publication date: 3 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system
- A single machine scheduling problem to minimize total early work
- Personnel scheduling: models and complexity
- Resource allocation in congested queueing systems with time-varying demand: an application to airport operations
- Efficient priority rules for the stochastic resource-constrained project scheduling problem
- Approximate dynamic programming for link scheduling in wireless mesh networks
- Staff scheduling and rostering: a review of applications, methods and models.
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Scheduling on parallel processors with varying processing times
- Multi-period technician scheduling with experience-based service times and stochastic customers
- On the NP-hardness of scheduling with time restrictions
- A constraint generation approach for two-machine shop problems with jobs selection
- Branch-and-price approaches for the multiperiod technician routing and scheduling problem
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- NP-hardness of shop-scheduling problems with three jobs
- Personnel scheduling: a literature review
- A survey of dynamic scheduling in manufacturing systems
- The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard
- Flexible flow shop with dedicated buffers
- New approaches to nurse rostering benchmark instances
- A review of TSP based approaches for flowshop scheduling
- Approximate Dynamic Programming
This page was built for publication: Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach