Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
From MaRDI portal
Publication:2890466
DOI10.1287/ijoc.1040.0069zbMath1239.90046OpenAlexW2157530413MaRDI QIDQ2890466
Pasquale Avella, Maurizio Boccia, Bernardo D'auria
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c59d47d23cdfdff4a05310240cf4f59945be733b
Related Items
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times ⋮ Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ A Lagrangian heuristic for satellite range scheduling with resource constraints ⋮ On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
