Producción CyT

EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization - THE DOMINANCE FLOW SHOP SCHEDULING PROBLEM

Congreso

Autoría:

Daniel A. Rossit ; Óscar C. Vásquez ; Fernando Tohmé ; FRUTOS, MARIANO

Fecha:

2018

Editorial y Lugar de Edición:

University of Bologna

Resumen *

We introduce a new line of analysis of Flow Shop scheduling problems, for the case of two jobs and assuming that processing times are unknown. The goal is to determine the domination relations between permutation and non-permutation schedules. We analyze the structural and dominance properties that ensue in this setting, based on the critical paths of schedules. Información suministrada por el agente en SIGEVA

Palabras Clave

NON-PERMUTATION FLOW-SHOPSCHEDULINGCRITICAL PATHMAKESPAN