Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

Autor
Pereira, J.
Tipus d'activitat
Article en revista
Revista
Computers & operations research
Data de publicació
2016-02-01
Volum
66
Pàgina inicial
141
Pàgina final
152
DOI
https://doi.org/10.1016/j.cor.2015.08.010 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0305054815002075 Obrir en finestra nova
Resum
Single machine scheduling is a classical optimization problem that depicts multiple real life systems in which a single resource (the machine) represents the whole system or the bottleneck operation of the system. In this paper we consider the problem under a weighted completion time performance metric in which the processing time of the tasks to perform (the jobs) are uncertain, but can only take values from closed intervals. The objective is then to find a solution that minimizes the maximum a...
Paraules clau
2-APPROXIMATION, Branch-and-bound, CONSTRAINTS, CRITERION, EARLINESS, MAKESPAN, OPTIMIZATION PROBLEMS, PROGRAMMING APPROACH, Robust optimization, SEQUENCING PROBLEMS, Scheduling, Single machine, TOTAL FLOW TIME, UNCERTAINTY, Uncertainty

Participants

  • Pereira Gude, Jordi  (autor)