Robust single machine scheduling problem with weighted number of late jobs criterion

DOI10.1007/978-3-319-28697-6_39zbMATH Open1342.90063OpenAlexW2476859626MaRDI QIDQ2806942FDOQ2806942

Authors: Adam Kasperski, Paweł Zieliński 

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_39

Recommendations

• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Minimizing the number of late jobs on a single machine under due date uncertainty
• Single machine scheduling problems with uncertain parameters and the OWA criterion
• Single machine scheduling with scenarios

zbMATH Keywords

single machine schedulingmin-max criterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Minimax problems in mathematical programming (90C47)

Cites Work

• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• Approximating the min-max (regret) selecting items problem
• Minimizing the number of late jobs on a single machine under due date uncertainty
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Combinatorial optimization problems with uncertain costs and the OWA criterion
• Improved approximation algorithms for the Min-Max selecting items problem

Cited In (7)

• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
• Minimizing the number of late jobs on a single machine under due date uncertainty
• Risk-averse single machine scheduling: complexity and approximation
• A state-of-the-art survey on multi-scenario scheduling
• A robust approach for the single machine scheduling problem
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
• Parameterized multi-scenario single-machine scheduling problems

This page was built for publication: Robust single machine scheduling problem with weighted number of late jobs criterion

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