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

Adam Kasperski and Paweł Zieliński ()
Additional contact information
Paweł Zieliński: Wrocław University of Technology

A chapter in Operations Research Proceedings 2014, 2016, pp 279-284 from Springer

Abstract: Abstract This paper deals with a single machine scheduling problem with the weighted number of late jobs criterion, where some job parameters, such as: processing times, due dates, and weights, may be uncertain. This uncertainty is modeled by specifying a scenario set containing all vectors of the job parameters, called scenarios, which may occur. The min-max criterion is adopted to compute a solution under uncertainty. In this paper some of the recent negative complexity and approximability results for the problem are extended and strengthened. Moreover, some positive approximation results for the problem in which the maximum criterion is replaced with the OWA operator are presented.

Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-28697-6_39

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_39

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().