Minimizing the number of late jobs on a single machine under due date uncertainty

DOI10.1007/s10951-010-0183-zzbMath1229.90053OpenAlexW1994217000MaRDI QIDQ657256

Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Hassene Aissi

Publication date: 16 January 2012

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-010-0183-z

zbMATH Keywords

uncertaintyrobustnessschedulingsingle machineassignmentscenariosmin-max approach

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (15)

Single machine scheduling problems with uncertain parameters and the OWA criterion ⋮ Lawler's minmax cost algorithm: optimality conditions and uncertainty ⋮ Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty ⋮ Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty ⋮ Lawler's minmax cost problem under uncertainty ⋮ Min-max and min-max (relative) regret approaches to representatives selection problem ⋮ Complexity results for common due date scheduling problems with interval data and minmax regret criterion ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ Scenario based robust line balancing: Computational complexity ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion ⋮ Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration ⋮ JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times

Cites Work

• Unnamed Item
• Complexity of the min-max and min-max regret assignment problems
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Matching is as easy as matrix inversion
• Robust discrete optimization and its applications
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Scheduling Problems with Two Competing Agents
• The complexity of restricted spanning tree problems
• Maximum matching of given weight in complete and complete bipartite graphs
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Minimizing the number of late jobs on a single machine under due date uncertainty