Solvable cases of permutation flowshop scheduling with dominating machines

S. Xiang; G. Tang; Edwin Tai Chiu Cheng

doi:10.1016/S0925-5273(99)00106-1

Solvable cases of permutation flowshop scheduling with dominating machines

S. Xiang, G. Tang, Edwin Tai Chiu Cheng

Research output: Journal article publication › Journal article › Academic research › peer-review

30 Citations (Scopus)

Abstract

In this paper we study the permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polymonial-time solution algorithm for each case.

Original language	English
Pages (from-to)	53-57
Number of pages	5
Journal	International Journal of Production Economics
Volume	66
Issue number	1
DOIs	https://doi.org/10.1016/S0925-5273(99)00106-1
Publication status	Published - 5 Jun 2000

Keywords

Dominating machines
Permutation flowshop
Scheduling

ASJC Scopus subject areas

General Business,Management and Accounting
Economics and Econometrics
Management Science and Operations Research
Industrial and Manufacturing Engineering

More information

10.1016/S0925-5273(99)00106-1

Cite this

@article{c4ce8a4aca2c4e0384cc4168d29b46f8,

title = "Solvable cases of permutation flowshop scheduling with dominating machines",

abstract = "In this paper we study the permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polymonial-time solution algorithm for each case.",

keywords = "Dominating machines, Permutation flowshop, Scheduling",

author = "S. Xiang and G. Tang and Cheng, {Edwin Tai Chiu}",

year = "2000",

month = jun,

day = "5",

doi = "10.1016/S0925-5273(99)00106-1",

language = "English",

volume = "66",

pages = "53--57",

journal = "International Journal of Production Economics",

issn = "0925-5273",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Solvable cases of permutation flowshop scheduling with dominating machines

AU - Xiang, S.

AU - Tang, G.

AU - Cheng, Edwin Tai Chiu

PY - 2000/6/5

Y1 - 2000/6/5

N2 - In this paper we study the permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polymonial-time solution algorithm for each case.

AB - In this paper we study the permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polymonial-time solution algorithm for each case.

KW - Dominating machines

KW - Permutation flowshop

KW - Scheduling

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

U2 - 10.1016/S0925-5273(99)00106-1

DO - 10.1016/S0925-5273(99)00106-1

M3 - Journal article

SN - 0925-5273

VL - 66

SP - 53

EP - 57

JO - International Journal of Production Economics

JF - International Journal of Production Economics

IS - 1

ER -

Solvable cases of permutation flowshop scheduling with dominating machines

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this