Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- 24 October 2010
- journal article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 2 (3-4) , 259-290
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Path-Reduced Costs for Eliminating Arcs in Routing and SchedulingINFORMS Journal on Computing, 2010
- On the choice of explicit stabilizing terms in column generationDiscrete Applied Mathematics, 2009
- Time-Indexed Formulations and the Total Weighted Tardiness ProblemINFORMS Journal on Computing, 2008
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problemsComputers & Operations Research, 2007
- Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulationMathematical Programming, 2006
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing ProblemMathematical Programming, 2005
- Near-Optimal Solutions of Large-Scale Single-Machine Scheduling ProblemsINFORMS Journal on Computing, 2005
- Stabilized column generationDiscrete Mathematics, 1999
- Formulating the single machine sequencing problem with release dates as a mixed integer programDiscrete Applied Mathematics, 1990
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977