Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
From MaRDI portal
Publication:6106764
Recommendations
- Multi-period technician scheduling with experience-based service times and stochastic customers
- Optimal dynamic assignment of a flexible worker on an open production line with specialists
- An improved MIP-based approach for a multi-skill workforce scheduling problem
- A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem
- An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand
Cites work
- A constraint generation approach for two-machine shop problems with jobs selection
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- A review of TSP based approaches for flowshop scheduling
- A single machine scheduling problem to minimize total early work
- A survey of dynamic scheduling in manufacturing systems
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs
- Approximate dynamic programming for link scheduling in wireless mesh networks
- Approximate dynamic programming. Solving the curses of dimensionality
- Branch-and-price approaches for the multiperiod technician routing and scheduling problem
- Efficient priority rules for the stochastic resource-constrained project scheduling problem
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Flexible flow shop with dedicated buffers
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- Multi-period technician scheduling with experience-based service times and stochastic customers
- New approaches to nurse rostering benchmark instances
- New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system
- NP-hardness of shop-scheduling problems with three jobs
- On the NP-hardness of scheduling with time restrictions
- Personnel scheduling: a literature review
- Personnel scheduling: models and complexity
- Resource allocation in congested queueing systems with time-varying demand: an application to airport operations
- Scheduling on parallel processors with varying processing times
- Staff scheduling and rostering: a review of applications, methods and models.
- The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard
Cited in
(6)- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- scientific article; zbMATH DE number 7071583 (Why is no real title available?)
- Multi-attribute utility deep reinforcement learning method for sequential multi-criteria decision problems: application to human resource planning
- Shaping decision models for stochastic dynamic optimization problems via reinforcement learning
- Stable multi-skill workforce assignments
- Assigning cross-trained workers to departments: a two-stage optimization model to maximize utility and skill improvement
This page was built for publication: Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106764)
