The Robust Flow Shop

Hamilton Emmons () and George Vairaktarakis ()
Additional contact information
Hamilton Emmons: Case Western Reserve University
George Vairaktarakis: Case Western Reserve University

Chapter Chapter 10 in Flow Shop Scheduling, 2013, pp 291-301 from Springer

Abstract: Abstract In this chapter, job processing requirements are considered to be uncertain. They are no longer assumed to be deterministically known. One modeling approach would be to consider processing time probability distributions, and indeed this is done in a later chapter. Here, we provide a standard minimax regret approach, which however has been exploited very little in the context of scheduling. The limited research that has been conducted on this topic demonstrates that the minimax regret approach is particularly useful in scheduling problems because the corresponding solutions are quite robust on processing time variations. On a negative note, the available research indicates that this technique is at least a level of magnitude harder to deal with than its deterministic counterpart.

Date: 2013
References: Add references at CitEc
Citations:

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:isochp:978-1-4614-5152-5_10

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

DOI: 10.1007/978-1-4614-5152-5_10

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().