Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated

S. I. Brown, R. G. McGarvey, J. A. Ventura

Research output: Contribution to journalArticle

29 Scopus citations

Abstract

This paper addresses the m-machine no-wait flowshop problem where the set-up time of a job is separated from its processing time. The performance measures considered are the total flowtime and makespan. The scheduling problem for makespan reduces to the travelling salesman problem (TSP), and the scheduling problem for total flowtime reduces to the time-dependent travelling salesman problem (TDTSP). Non-polynomial time solution methods are presented, along with a polynomial heuristic.

Original languageEnglish (US)
Pages (from-to)614-621
Number of pages8
JournalJournal of the Operational Research Society
Volume55
Issue number6
DOIs
StatePublished - Jun 2004

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Fingerprint Dive into the research topics of 'Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated'. Together they form a unique fingerprint.

  • Cite this