๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimizing Regret: The General Case

โœ Scribed by Aldo Rustichini

Book ID
115611139
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
133 KB
Volume
29
Category
Article
ISSN
0899-8256

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing worst-case regret of makespan
Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times
โœ Lu, Chung-Cheng; Lin, Shih-Wei; Ying, Kuo-Ching ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 686 KB

This research addresses a single machine scheduling problem with uncertain processing times and sequence-dependent setup times represented by intervals. Our objective is to obtain a robust schedule with the minimum absolute deviation from the optimal makespan in the worst-case scenario. The problem

Minimizing maximal regret in the single
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
โœ Adam Kasperski ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 170 KB

In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied proble