A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times (Q3743087)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3978799
Language Label Description Also known as
default for all languages
No label defined
    English
    A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times
    scientific article; zbMATH DE number 3978799

      Statements

      A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times (English)
      0 references
      0 references
      0 references
      1986
      0 references
      flowshop
      0 references
      sequence dependent set-up times
      0 references
      mixed integer linear program
      0 references
      Computational results
      0 references
      The problem of an n-job, M-stage flowshop with sequence dependent set-up times is discussed. A mixed integer linear program (MILP) is formulated with a considerably reduced number of integer binary variables, than if the same problem were formulated with integer variables defined as \(X_{ij}=1\) if job i is sequenced immediately before job j, and 0 otherwise. The inclusion of set-up times, sequence dependency and M stages makes this formulation different from most other flowshop formulations in the literature, since such problems have not been given due consideration. This paper contributes a unique formulation to handle flowshop problems in the process industry where the set-up times have a definite dependence on the sequence in which jobs are processed. Computational results have been compared for problems up to six jobs and stages where the objective has been to minimize the makespan. The MILP has been solved using te SCICONIC-V/M mixed integer solution package on the Prime-550 minicomputer.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references