A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
type: Item
instance of: scholarly article
title: A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
zbMATH Open document ID: 1487.90291
author: Kan Fang
author: Shijin Wang
author: Lin Chen
author: Feng Chu
author: Michael L. Pinedo
published in: European Journal of Operational Research
publication date: 2021-06-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7355333
zbMATH Keywords: scheduling
zbMATH Keywords: parallel machine
zbMATH Keywords: maximum consecutive working-time
zbMATH Keywords: minimum break time
zbMATH Keywords: combinatorial Benders decomposition
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.09.037
OpenAlex ID: W3090474969
cites work: Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm
cites work: Combinatorial Benders cuts for assembly line balancing problems with setups
cites work: A survey of scheduling problems with no-wait in process
cites work: Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
cites work: Flow shop scheduling with heterogeneous workers
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Personnel scheduling: a literature review
cites work: A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
cites work: Personnel scheduling: models and complexity
cites work: Application of Benders' decomposition to power plant preventive maintenance scheduling
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: Workforce planning incorporating skills: state of the art
cites work: Optimal workforce assignment to operations of a paced assembly line
cites work: Parallel machine scheduling with additional resources: notation, classification, models and solution methods
cites work: Staff scheduling and rostering: a review of applications, methods and models.
cites work: The Fixed Job Schedule Problem with Working-Time Constraints
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Machine scheduling with resource dependent processing times
cites work: Cut generation for an integrated employee timetabling and production scheduling problem
cites work: Solving an integrated job-shop problem with human resource constraints
cites work: Q4523706
cites work: Planning and Scheduling by Logic-Based Benders Decomposition
cites work: Scheduling parallel dedicated machines under a single non-shared resource
cites work: Scheduling problems for parallel dedicated machines under multiple resource constraints.
cites work: Scheduling parallel dedicated machines with the speeding‐up resource
cites work: Scheduling incompatible tasks on two machines
cites work: List scheduling algorithms to minimize the makespan on identical parallel machines
cites work: Scheduling
cites work: The Benders decomposition algorithm: a literature review
cites work: Vehicle and crew scheduling for urban bus lines
cites work: Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods
cites work: Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
cites work: Skilled workforce scheduling in service centres
cites work: A combinatorial Benders' decomposition for the lock scheduling problem
DOI: 10.1016/J.EJOR.2020.09.037
description: scientific article; zbMATH DE number 7355333