Single machine total tardiness maximization problems: complexity and algorithms
DOI10.1007/S10479-012-1288-XzbMATH Open1273.90079OpenAlexW2157859449WikidataQ57633823 ScholiaQ57633823MaRDI QIDQ367638FDOQ367638
Authors: Evgeny R. Gafarov, Frank Werner, Alexander A. Lazarev 
Publication date: 16 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1288-x
Recommendations
- Algorithms for some maximization scheduling problems on a single machine
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- Maximization problems in single machine scheduling
- On the single machine total tardiness problem
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Maximization problems in single machine scheduling
- Title not available (Why is that?)
- Algorithms for some maximization scheduling problems on a single machine
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
Cited In (19)
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization
- A note on reverse scheduling with maximum lateness objective
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Maximization problems in single machine scheduling
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- The single-machine absolute-deviation early-tardy problem with random completion times
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- Two scheduling problems of minimizing the maximum weighted completion time
- New insights on the single machine total tardiness problem
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- On the single machine total tardiness problem
- Insights into two solution procedures for the single machine tardiness problem
- Decomposition of the single machine total tardiness problem
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
- Algorithms for some maximization scheduling problems on a single machine
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
This page was built for publication: Single machine total tardiness maximization problems: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367638)
