1. CONICET
  2. S&T Productions
Science and Technology Production

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

Congress

Authorship:

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

Date:

2018

Publishing House and Editing Place:

University of Bologna

Summary *

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. Information provided by the agent in SIGEVA

Key Words

NON-PERMUTATION FLOW-SHOPSCHEDULINGCRITICAL PATHMAKESPAN