A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines |
| |
Authors: | Eduardo Conde |
| |
Affiliation: | 1. Department of Statistics and Operations Research, Faculty of Mathematics, University of Seville, Campus Reina Mercedes, 41011, Sevilla, Spain
|
| |
Abstract: | The paper proposes a Mixed Integer Programming (MIP) formulation of the scheduling problem with total flow criterion on a set of parallel unrelated machines under an uncertainty context about the processing times. To model the problem we assume that lower and upper bounds are known for each processing time. In this context we consider an optimal minmax regret schedule as a suitable approximation to the optimal schedule under an arbitrary choice of the possible processing times. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|