Solving an integrated job-shop problem with human resource constraints

DOI10.1007/S10479-012-1132-3zbMATH Open1296.90046OpenAlexW2068385202MaRDI QIDQ744642FDOQ744642

Authors: 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

Recommendations

• 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
• Cut generation for an employee timetabling problem
• Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm
• Optimization of the integrated problem of employee timetabling and job shop scheduling

zbMATH Keywords

branch and boundcut generationjob-shopprobingemployee timetabling problemjob-shop with resource availability constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Partitioning procedures for solving mixed-variables programming problems
• Logic-based Benders decomposition
• Planning and Scheduling by Logic-Based Benders Decomposition
• Title not available (Why is that?)
• A hybrid method for the planning and scheduling
• Machine scheduling with availability constraints
• Staff scheduling and rostering: a review of applications, methods and models.
• Preemptive scheduling with availability constraints to minimize total weighted completion times
• Scheduling with limited machine availability
• The one-machine sequencing problem
• An Algorithm for Solving the Job-Shop Problem
• New single machine and job-shop scheduling problems with availability constraints
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Machine scheduling with an availability constraint
• Minimizing the makespan for the flow shop scheduling problem with availability constraints.
• Parallel machine scheduling with machine availability and eligibility constraints
• 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
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Simultaneous job scheduling and resource allocation on parallel machines
• Adjustment of heads and tails for the job-shop problem
• Optimal parallel machines scheduling with availability constraints
• New trends in machine scheduling
• Flow Shop Scheduling with Resource Flexibility

Cited In (14)

• Logic-Based Benders Decomposition for Large-Scale Optimization
• Multi-objective open shop scheduling by considering human error and preventive maintenance
• A classification scheme for integrated staff rostering and scheduling problems
• 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
• Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm
• A hybrid evolutionary algorithm to solve the job shop scheduling problem
• Cut generation for an employee timetabling problem
• Optimization of the integrated problem of employee timetabling and job shop scheduling
• Depth-first heuristic search for the job shop scheduling 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
• A job-shop problem with one additional resource type
• A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers

This page was built for publication: Solving an integrated job-shop problem with human resource constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744642)