Near-optimal solutions of large-scale single-machine scheduling problems

DOI10.1287/IJOC.1040.0069MaRDI QIDQ2890466zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Lagrangean heuristicsingle-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Computation of approximate -points for large scale single machine scheduling problem
• Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
• A time indexed formulation of non-preemptive single machine scheduling problems
• Single machine scheduling with release dates
• scientific article; zbMATH DE number 49601

Cited in

(23)

• Dual decomposition of a single-machine scheduling problem
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
• On the exact solution of a large class of parallel machine scheduling problems
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• Computation of approximate -points for large scale single machine scheduling problem
• Two very large-scale neighborhoods for single machine scheduling
• 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
• A bucket indexed formulation for nonpreemptive single machine scheduling problems
• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
• A hybrid heuristic approach for single machine scheduling with release times
• Minimizing L _max for large-scale, job-shop scheduling problems
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
• An efficient ILP formulation for the single machine scheduling problem
• A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
• Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• A Lagrangian heuristic for satellite range scheduling with resource constraints
• Valid inequalities for the time-indexed non-preemptive single machine scheduling problem
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

This page was built for publication: Near-optimal solutions of large-scale single-machine scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890466)