Ir al contenido

Documat

Heuristics for fow shop rescheduling with mixed blocking constraints

  • Ayoub Tighazoui [1] ; Christophe Sauvey [2] ; Nathalie Sauer [2]
    1. [1] University of Strasbourg

      University of Strasbourg

      Arrondissement de Strasbourg-Ville, Francia

    2. [2] University of Lorraine

      University of Lorraine

      Arrondissement de Nancy, Francia

  • Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 32, Nº. 2, 2024, págs. 169-201
  • Idioma: inglés
  • DOI: 10.1007/s11750-023-00662-8
  • Enlaces
  • Resumen

    • In the fow shop rescheduling literature, many papers consider unlimited bufer capacities between successive machines. In real fact, these capacities may be limited, or no store may exist. Thus, a blocking situation is inducted. Diverse types of blocking constraints are studied in the fow shop scheduling problems. However, in dynamic environments, only few papers deal with these kinds of constraints. The aim of this paper is to investigate a problem of rescheduling the jobs in a fowshop environment and mixed blocking as a constraint, considering simultaneously schedule efciency and stability as a performance measure, and job arrival as a disruption. An iterative methodology based on the predictive–reactive strategy is implemented for dealing with this rescheduling problem. The problem has frst been modeled as a Mixed Integer Linear Programing (MILP) model. Experimental results show that the MILP resolution is only possible for small-sized instances. Hence, inspired by NEH algorithm, we proposed four heuristics for solving large-sized instances of this problem. Eventually, we discussed the performance of the proposed heuristics for diferent blocking situations, both in terms of solution efciency and resolution time.

  • Referencias bibliográficas
Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno