The single-machine total tardiness scheduling problem: review and extensions
type: Item
instance of: scholarly article
title: The single-machine total tardiness scheduling problem: review and extensions
zbMATH Open document ID: 1175.90174
published in: European Journal of Operational Research
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 5634731
zbMATH Keywords: scheduling
author: C. Koulamas
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.04.007
OpenAlex ID: W2157671570
cites work: A survey of algorithms for the single machine total weighted tardiness scheduling problem
cites work: A note on the equivalence of two heuristics to minimize total tardiness
cites work: Q4885615
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: A simulated annealing approach for the one-machine mean tardiness scheduling problem
cites work: Q4735025
cites work: On decomposition of the total tardiness problem
cites work: Single machine scheduling to minimize total weighted tardiness
cites work: A hybrid algorithm for the single-machine total tardiness problem
cites work: Q3993992
cites work: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
cites work: A new decomposition approach for the single machine total tardiness scheduling problem
cites work: Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: A greedy heuristic for the mean tardiness sequencing problem
cites work: A special case of the single-machine total tardiness problem is NP-hard
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
cites work: New Precedence Theorems for One-Machine Weighted Tardiness
cites work: The Total Tardiness Problem: Review and Extensions
cites work: A faster fully polynomial approximation scheme for the single-machine total tardiness problem
cites work: Single machine scheduling with release times, deadlines and tardiness objectives
cites work: Improving the complexities of approximation algorithms for optimization problems
cites work: Q4124332
cites work: A fully polynomial approximation scheme for the total tardiness problem
cites work: Solution of the NP-hard total tardiness minimization problem in scheduling theory
cites work: Q4055377
cites work: Scheduling with deadlines and loss functions
cites work: Insights into two solution procedures for the single machine tardiness problem
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: A heuristic for the single machine tardiness problem
cites work: A decomposition algorithm for the single machine total tardiness problem
cites work: Single machine scheduling with assignable due dates
cites work: Evaluation of leading heuristics for the single machine tardiness problem
cites work: Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem
cites work: A neural network model for scheduling problems
cites work: Two due date assignment problems in scheduling a single machine
cites work: Decomposition in single-machine scheduling
cites work: Some remarks on the decomposition properties of the single machine total tardiness problem
cites work: Decomposition of the single machine total tardiness problem
cites work: Solution of the single machine total tardiness problem
cites work: Algorithmic paradoxes of the single-machine total tardiness problem
cites work: Finding the Pareto-optima for the total and maximum tardiness single machine problem
cites work: New insights on the single machine total tardiness problem
cites work: On the single machine total tardiness problem
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: Augmentations of consistent partial orders for the one-machine total tardiness problem
cites work: Q4884350
DOI: 10.1016/J.EJOR.2009.04.007
description: scientific article; zbMATH DE number 5634731