Solving an integrated job-shop problem with human resource constraints
From MaRDI portal
Publication:744642
DOI10.1007/s10479-012-1132-3zbMath1296.90046OpenAlexW2068385202MaRDI QIDQ744642
Olivier Guyon, Pierre Lemaire, David Rivreau, Éric Pinson
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1132-3
branch and boundjob-shopcut generationprobingemployee timetabling problemjob-shop with resource availability constraints
Related Items
A hybrid evolutionary algorithm to solve the job shop scheduling problem, Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm, Depth-first heuristic search for the job shop scheduling problem, Optimization of the integrated problem of employee timetabling and job shop scheduling, Logic-Based Benders Decomposition for Large-Scale Optimization, A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals, A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions, A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers, Multi-objective open shop scheduling by considering human error and preventive maintenance, A classification scheme for integrated staff rostering and scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Simultaneous job scheduling and resource allocation on parallel machines
- A hybrid method for the planning and scheduling
- New single machine and job-shop scheduling problems with availability constraints
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
- Cut generation for an integrated employee timetabling and production scheduling problem
- New trends in machine scheduling
- Partitioning procedures for solving mixed-variables programming problems
- The one-machine sequencing problem
- Machine scheduling with availability constraints
- Adjustment of heads and tails for the job-shop problem
- Logic-based Benders decomposition
- Staff scheduling and rostering: a review of applications, methods and models.
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Optimal parallel machines scheduling with availability constraints
- Scheduling with limited machine availability
- Parallel machine scheduling with machine availability and eligibility constraints
- Machine scheduling with an availability constraint
- Planning and Scheduling by Logic-Based Benders Decomposition
- An Algorithm for Solving the Job-Shop Problem
- Flow Shop Scheduling with Resource Flexibility
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
