A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
Authors:
- Kan FangKFKan Fang
- Shijin WangSWShijin Wang
- Michael L. PinedoMPMichael L. Pinedo
- Lin ChenLCLin Chen
- Feng ChuFCFeng Chu
- 1 May 2021
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 291 (1) , 128-146
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
This publication has 40 references indexed in Scilit:
- Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoodsEuropean Journal of Operational Research, 2011
- Scheduling incompatible tasks on two machinesEuropean Journal of Operational Research, 2010
- Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-boundComputers & Operations Research, 2009
- Scheduling parallel dedicated machines with the speeding‐up resourceNaval Research Logistics (NRL), 2008
- Application of Benders’ decomposition to power plant preventive maintenance schedulingEuropean Journal of Operational Research, 2008
- Machine scheduling with resource dependent processing timesMathematical Programming, 2006
- Employee scheduling and makespan minimization in a flow shop with multi-processor work stations: a case studyOmega, 2004
- Staff scheduling and rostering: A review of applications, methods and modelsEuropean Journal of Operational Research, 2004
- Working hours as a risk factor in the development of musculoskeletal complaintsErgonomics, 1991
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962