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

doi:10.1057/palgrave.jors.2601695

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

Marcus Department of Industrial and Manufacturing Engineering

Research output: Contribution to journal › Article › peer-review

30 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 language	English (US)
Pages (from-to)	614-621
Number of pages	8
Journal	Journal of the Operational Research Society
Volume	55
Issue number	6
DOIs	https://doi.org/10.1057/palgrave.jors.2601695
State	Published - Jun 2004

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Strategy and Management
Statistics, Probability and Uncertainty
Management Science and Operations Research

Access to Document

10.1057/palgrave.jors.2601695

Cite this

@article{4992367910f341ce939ef031155bf0da,

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

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.",

author = "Brown, {S. I.} and McGarvey, {R. G.} and Ventura, {J. A.}",

year = "2004",

month = jun,

doi = "10.1057/palgrave.jors.2601695",

language = "English (US)",

volume = "55",

pages = "614--621",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "6",

}

TY - JOUR

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

AU - Brown, S. I.

AU - McGarvey, R. G.

AU - Ventura, J. A.

PY - 2004/6

Y1 - 2004/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=3042642143&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042642143&partnerID=8YFLogxK

U2 - 10.1057/palgrave.jors.2601695

DO - 10.1057/palgrave.jors.2601695

M3 - Article

AN - SCOPUS:3042642143

SN - 0160-5682

VL - 55

SP - 614

EP - 621

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 6

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this