A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
From MaRDI portal
Publication:2029954
DOI10.1016/j.ejor.2020.09.037zbMath1487.90291OpenAlexW3090474969MaRDI QIDQ2029954
Lin Chen, Feng Chu, Kan Fang, Shijin Wang, Michael L. Pinedo
Publication date: 4 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.037
schedulingparallel machinecombinatorial Benders decompositionmaximum consecutive working-timeminimum break time
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Workforce planning incorporating skills: state of the art
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
- A combinatorial Benders' decomposition for the lock scheduling problem
- Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods
- Personnel scheduling: models and complexity
- Solving an integrated job-shop problem with human resource constraints
- Machine scheduling with resource dependent processing times
- Skilled workforce scheduling in service centres
- 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
- Scheduling incompatible tasks on two machines
- Partitioning procedures for solving mixed-variables programming problems
- List scheduling algorithms to minimize the makespan on identical parallel machines
- Staff scheduling and rostering: a review of applications, methods and models.
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm
- Optimal workforce assignment to operations of a paced assembly line
- A survey of scheduling problems with no-wait in process
- Combinatorial Benders cuts for assembly line balancing problems with setups
- The Benders decomposition algorithm: a literature review
- Scheduling parallel dedicated machines under a single non-shared resource
- Personnel scheduling: a literature review
- Flow shop scheduling with heterogeneous workers
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Application of Benders' decomposition to power plant preventive maintenance scheduling
- Vehicle and crew scheduling for urban bus lines
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- The Fixed Job Schedule Problem with Working-Time Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling parallel dedicated machines with the speeding‐up resource
- Scheduling
