A new formulation and solution of the flowshop scheduling problem with no in-process waiting

W. J. Selen, D. D. Hott

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

To date, all models reported in the literature relating to the flowshop sequencing problem with no in-process waiting, have been based on single objective optimization. This paper presents a mixed integer goal programming model of the generalized N job, M machine standard flowshop problem with no in-process waiting, i.e. no intermediate queues. Instead of optimization being based on a single objective, the most satisfactory sequence is derived subject to user specified selection of the pre-emptive goals: makespan, flowtime, and machine idle time. Computational results of sample problems illustrating the advantage of a multiple criteria selection method are shown.

Original languageEnglish
Pages (from-to)246-248
Number of pages3
JournalApplied Mathematical Modelling
Volume10
Issue number4
DOIs
Publication statusPublished - Aug 1986
Externally publishedYes

Keywords

  • flowshop scheduling
  • goal programming
  • multiple criteria
  • no in-process waiting
  • no intermediate queues

ASJC Scopus subject areas

  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A new formulation and solution of the flowshop scheduling problem with no in-process waiting'. Together they form a unique fingerprint.

Cite this