Maximization problems in single machine scheduling

DOI10.1023/B:ANOR.0000030679.25466.02MaRDI QIDQ596446zbMATH OpenOpenAlexFDO

Authors Mohamed Ali Aloulou, Marie-Claude Portmann, M. 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

schedulingprecedence constraintsrelease timesmaximization problemsemi-active schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A branch and bound algorithm to minimize total weighted tardiness on a single processor
• Single machine total tardiness maximization problems: complexity and algorithms
• Algorithms for some maximization scheduling problems on a single machine
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

Cited in

(17)

• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
• 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
• Single machine total tardiness maximization problems: complexity and algorithms
• Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
• Single-machine scheduling with supporting tasks
• Two scheduling problems of minimizing the maximum weighted completion time
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
• A generic approach to proving NP-hardness of partition type problems
• Algorithms for some maximization scheduling problems on a single machine
• Analysis of a linearization heuristic for single-machine scheduling to maximize profit
• Mirror scheduling problems with early work and late work criteria
• Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints
• Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
• scientific article; zbMATH DE number 5007490 (Why is no real title available?)
• Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596446)