![The minmax regret permutation flow-shop problem with two jobs [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0RR/bigB000RR653M.jpg)
The minmax regret permutation flow-shop problem with two jobs [An article from: European Journal of Operational Research]
Book Details
Author(s)I. Averbakh
PublisherElsevier
ISBN / ASINB000RR653M
ISBN-13978B000RR6530
AvailabilityAvailable for download now
Sales Rank99,999,999
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
We consider the makespan-minimizing permutation flow-shop problem with 2 jobs and m machines and uncertain processing times of operations. For each operation, an uncertainty interval is given, and it is assumed that the processing time of each operation can take on any value from the corresponding uncertainty interval, regardless of the values taken by processing times of other operations. For the problem of finding a minmax regret solution, we present an O(m) algorithm.
Description:
We consider the makespan-minimizing permutation flow-shop problem with 2 jobs and m machines and uncertain processing times of operations. For each operation, an uncertainty interval is given, and it is assumed that the processing time of each operation can take on any value from the corresponding uncertainty interval, regardless of the values taken by processing times of other operations. For the problem of finding a minmax regret solution, we present an O(m) algorithm.
