Dominance and Decomposition Heuristics for Single Machine Scheduling

DOI10.1287/OPRE.39.4.639MaRDI QIDQ3980517zbMATH OpenOpenAlexFDO

Authors Robert J. Chambers, Robert L. Carraway, Timothy J. Lowe, Thomas Morin

Publication date 26 June 1992

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.39.4.639

zbMATH Keywords

flexible decomposition heuristicheuristic dominance rulessingle processorweighted tardiness

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Algorithms for a class of single-machine weighted tardiness and earliness problems
• A new decomposition approach for the single machine total tardiness scheduling problem
• Weighted Tardiness Single Machine Scheduling with Proportional Weights
• Improved heuristics for the n-job single-machine weighted tardiness problem
• Dominance-based heuristics for one-machine total cost scheduling problems

Cited in

(18)

• An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances
• Decomposition in single-machine scheduling
• Improved heuristics for the n-job single-machine weighted tardiness problem
• Analysis of the temporal decomposition procedure for scheduling with release and due dates
• A new lower bounding scheme for the total weighted tardiness problem.
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families
• The CLWS heuristic for single machine scheduling problem
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Dominance-based heuristics for one-machine total cost scheduling problems
• New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
• scientific article; zbMATH DE number 4057270 (Why is no real title available?)
• A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling
• Dominance rules for single machine schedule with sequence dependent setup and due date
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• Decomposition heuristics for the hybrid flexible flowshop with transportation times
• Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
• A decomposition scheme for single stage scheduling problems

This page was built for publication: Dominance and Decomposition Heuristics for Single Machine Scheduling

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