Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity

DOI10.1016/J.COR.2012.05.013MaRDI QIDQ339549zbMATH OpenOpenAlexFDO

Authors C. Birkemeier, John J. Kanet

Publication date 11 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2012.05.013

zbMATH Keywords

schedulingweighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• New Precedence Theorems for One-Machine Weighted Tardiness
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
• One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
• Improved heuristics for the n-job single-machine weighted tardiness problem
• Algorithms for a class of single-machine weighted tardiness and earliness problems

Cites work

• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
• scientific article; zbMATH DE number 1703885 (Why is no real title available?)
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
• Minimizing Total Costs in One-Machine Scheduling
• Minimizing total tardiness on a single machine with controllable processing times
• New Precedence Theorems for One-Machine Weighted Tardiness
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Principles of Sequencing and Scheduling
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• Time-indexed formulations and the total weighted tardiness problem

Cited in

(6)

• The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
• An examination of job interchange relationships and induction-based proofs in single machine scheduling
• One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
• Weighted Tardiness Single Machine Scheduling with Proportional Weights
• New Precedence Theorems for One-Machine Weighted Tardiness

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity

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