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

DOI10.1007/S10951-010-0183-ZzbMATH Open1229.90053OpenAlexW1994217000MaRDI QIDQ657256FDOQ657256

Mohamed Ali Aloulou, M. 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

Recommendations

• Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
• Robust single machine scheduling problem with weighted number of late jobs criterion
• Single machine scheduling to minimize the number of late jobs under uncertainty.
• Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates

zbMATH Keywords

uncertaintyrobustnessscenariosschedulingsingle machineassignmentmin-max approach

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (19)

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

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

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