Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
From MaRDI portal
Publication:339549
DOI10.1016/J.COR.2012.05.013zbMATH Open1349.90361OpenAlexW2471320733MaRDI QIDQ339549FDOQ339549
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Principles of Sequencing and Scheduling
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- A survey of algorithms 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
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Title not available (Why is that?)
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Minimizing total tardiness on a single machine with controllable processing times
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- Time-indexed formulations and the total weighted tardiness problem
- Minimizing Total Costs in One-Machine Scheduling
- 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
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
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
- New Precedence Theorems for One-Machine Weighted Tardiness
- Weighted Tardiness Single Machine Scheduling with Proportional Weights
- 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
Uses Software
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)
