Maximization problems in single machine scheduling

DOI10.1023/B:ANOR.0000030679.25466.02zbMath1056.90050OpenAlexW2022839718MaRDI QIDQ596446

Marie-Claude Portmann, Mohamed Ali Aloulou, Mikhail Y. Kovalyov

Publication date: 10 August 2004

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000030679.25466.02

zbMATH Keywords

schedulingrelease timesprecedence constraintsmaximization problemsemi-active schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Single machine total tardiness maximization problems: complexity and algorithms ⋮ A generic approach to proving NP-hardness of partition type problems ⋮ Two-dedicated-machine scheduling problem with precedence relations to minimize makespan ⋮ Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one ⋮ Mirror scheduling problems with early work and late work criteria ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case ⋮ Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization

This page was built for publication: Maximization problems in single machine scheduling