A loading and dispatching problem in a random flexible manufacturing system (Q3688080)

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 3912081
Language Label Description Also known as
default for all languages
No label defined
    English
    A loading and dispatching problem in a random flexible manufacturing system
    scientific article; zbMATH DE number 3912081

      Statements

      A loading and dispatching problem in a random flexible manufacturing system (English)
      0 references
      0 references
      0 references
      1985
      0 references
      flexible manufacturing system
      0 references
      loading
      0 references
      sequencing
      0 references
      heuristic methods
      0 references
      A scheduling problem in a flexible manufacturing system (FMS) is considered to be a composite of two interdependent tasks: loading and sequencing. Formulations are presented for the loading problem with two objectives: (i) minimization of the system workload unbalance, and (ii) minimization of system unbalance and the number of late jobs; including constraints such as the number of tools slots with duplications, unique job routing, nonsplitting of jobs and machine capacity. For both the objectives, heuristic methods are developed and performance is compared with the exact mixed integer programming solutions. A simulation model is developed for investigating the system performance for the problem of minimizing the system unbalance using heuristic and sequential loading methods in conjunction with four - FIFO, SPT, LPT and MOPR - dispatching rules.
      0 references

      Identifiers