Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
Authors:
- Alessandro DruettoADAlessandro Druetto
- Andrea GrossoAGAndrea Grosso
- Jully JeunetJJJully Jeunet
- Fabio SalassaFSFabio Salassa
- 17 November 2024
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 174
Abstract
No abstract availableKeywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Preemptive parallel‐machine scheduling with a common server to minimize makespanNaval Research Logistics (NRL), 2017
- Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup timesComputers & Industrial Engineering, 2017
- Bin packing and related problems: General arc-flow formulation with graph compressionComputers & Operations Research, 2016
- Analysing differences between algorithm configurations through ablationJournal of Heuristics, 2015
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single serverComputers & Operations Research, 2012
- Parallel dedicated machine scheduling problem with sequence-dependent setups and a single serverComputers & Industrial Engineering, 2010
- The feasibility pumpMathematical Programming, 2005
- Exploring relaxation induced neighborhoods to improve MIP solutionsMathematical Programming, 2004
- Scheduling for parallel dedicated machines with a single serverNaval Research Logistics (NRL), 2000
- Scheduling two parallel semiautomatic machines to minimize machine interferenceComputers & Operations Research, 1996