The single-machine total tardiness scheduling problem: review and extensions
From MaRDI portal
Publication:1038369
DOI10.1016/j.ejor.2009.04.007zbMath1175.90174OpenAlexW2157671570MaRDI QIDQ1038369
Publication date: 17 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.04.007
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (24)
On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ A theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times ⋮ An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Single-facility scheduling by logic-based Benders decomposition ⋮ A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects ⋮ Scheduling jobs with normally distributed processing times on parallel machines ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees ⋮ An exact exponential branch-and-merge algorithm for the single machine total tardiness problem ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem ⋮ The single-machine total tardiness problem with unequal release times and a linear deterioration ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty ⋮ Modeling single machine preemptive scheduling problems for computational efficiency ⋮ Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the decomposition properties of the single machine total tardiness problem
- Two due date assignment problems in scheduling a single machine
- A hybrid algorithm for the single-machine total tardiness problem
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A neural network model for scheduling problems
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- Decomposition in single-machine scheduling
- A note on the equivalence of two heuristics to minimize total tardiness
- Evaluation of leading heuristics for the single machine tardiness problem
- A heuristic for the single machine tardiness problem
- A greedy heuristic for the mean tardiness sequencing problem
- Decomposition of the single machine total tardiness problem
- Solution of the single machine total tardiness problem
- Single machine scheduling with assignable due dates
- On the single machine total tardiness problem
- Single machine scheduling to minimize total weighted tardiness
- A decomposition algorithm for the single machine total tardiness problem
- A fully polynomial approximation scheme for the total tardiness problem
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- Improving the complexities of approximation algorithms for optimization problems
- Augmentations of consistent partial orders for the one-machine total tardiness problem
- On decomposition of the total tardiness problem
- A special case of the single-machine total tardiness problem is NP-hard
- Scheduling with Deadlines and Loss Functions
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- A new decomposition approach for the single machine total tardiness scheduling problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- New insights on the single machine total tardiness problem
- Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Insights into two solution procedures for the single machine tardiness problem
- The Total Tardiness Problem: Review and Extensions
- New Precedence Theorems for One-Machine Weighted Tardiness
- Solution of the NP-hard total tardiness minimization problem in scheduling theory
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- Algorithmic paradoxes of the single-machine total tardiness problem
- Single machine scheduling with release times, deadlines and tardiness objectives
This page was built for publication: The single-machine total tardiness scheduling problem: review and extensions
