Scheduling Jobs on Several Machines Using Network Flow Approaches

  1. Alcaide López de Pablo, David 1
  2. González-Martín, Carlos 1
  3. Sedeño-Noda, Antonio 1
  1. 1 Universidad de La Laguna
    info
    Universidad de La Laguna

    San Cristobal de La Laguna, España

    ROR https://ror.org/01r9z8p25

    Geographic location of the organization Universidad de La Laguna
Proceedings:
Eighth International Workshop on Project Management and Scheduling (PMS’2002) Universidad de Valencia, Valencia, Spain, April 3–5, 2002
  1. Vicente Valls Verdejo (ed. lit.)
  2. Francisco Ballestín González (ed. lit.)
  3. M. Pilar Lino Sorlí (ed. lit.)
  4. M. Ángeles Pérez Alarcó (ed. lit.)
  5. M. Sacramento Quintanilla Alfaro (ed. lit.)

Publisher: European Union of Operational Research Societies (EURO) and Universidad de Valencia

ISBN: 84-921190-5-5

Year of publication: 2002

Pages: 23-25

Type: Conference paper

GOOGLE SCHOLAR

Abstract

An interesting research area is to solve scheduling problems using network flow models and algorithms. Most of the existing papers in this research area deal with scheduling problems with parallel machines (identical and / or uniform machines). This paper considers the specialized case and develops network flow models and algorithms to solve open shop and flow and job shop problems.