Scheduling over scenarios on two machines

We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scenario is a subset of jobs that must be executed in that scenario and all scenarios are given explicitly. The two objective...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Feuerstein, E., Marchetti-Spaccamela, A., Schalekamp, F., Sitters, R., Van Der Ster, S., Stougie, L., Van Zuylen, A.
Formato: SER
Materias:
approximation
job scheduling
makespan minimization
scenarios
Approximation algorithms
Combinatorial mathematics
Optimization
Scheduling algorithms
Scheduling
Approximability
Job scheduling
Makespan minimization
Optimization problems
Scheduling problem
Two machines
Approximation
Lower bounds
Scenarios
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v8591LNCS_n_p559_Feuerstein
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares