Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion

DOI10.1007/978-3-319-28697-6_39zbMath1342.90063OpenAlexW2476859626MaRDI QIDQ2806942

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

zbMATH Keywords

single machine schedulingmin-max criterion

Mathematics Subject Classification ID

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

Related Items (2)

A state-of-the-art survey on multi-scenario scheduling ⋮ Parameterized multi-scenario single-machine scheduling problems

Cites Work

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

This page was built for publication: Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion