The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine

DOI10.1134/S1064230706060098zbMath1263.49044OpenAlexW2129008451MaRDI QIDQ1951910

Alexander A. Lazarev

Publication date: 24 May 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230706060098

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Automated systems (robots, etc.) in control theory (93C85) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan ⋮ Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one ⋮ Scheduling a single machine with primary and secondary objectives

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine