Flowshop scheduling of deteriorating jobs on dominating machines

C. T. Ng; J. B. Wang; T. C.E. Cheng; S. S. Lam

doi:10.1016/j.cie.2011.04.020

Flowshop scheduling of deteriorating jobs on dominating machines

C. T. Ng, J. B. Wang, T. C.E. Cheng, S. S. Lam

Management and Strategy

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

18 Citations (Scopus)

Abstract

In this paper we consider the general, no-wait and no-idle permutation flowshop scheduling problem with deteriorating jobs, i.e.; jobs whose processing times are increasing functions of their starting times. We assume a linear deterioration function with identical increasing rates for all the jobs and there are some dominating relationships between the machines. We show that the problems to minimize the makespan and the total completion time remain polynomially solvable when deterioration is considered, although these problems are more complicated than their classical counterparts without deterioration.

Original language	English
Pages (from-to)	647-654
Number of pages	8
Journal	Computers and Industrial Engineering
Volume	61
Issue number	3
DOIs	https://doi.org/10.1016/j.cie.2011.04.020
Publication status	Published - Oct 2011

Keywords

Deteriorating jobs
Dominating machines
Flowshop
No-idle
No-wait
Scheduling

Access to Document

10.1016/j.cie.2011.04.020

Cite this

@article{05157da79538476f90b440a17ab21ac3,

title = "Flowshop scheduling of deteriorating jobs on dominating machines",

abstract = "In this paper we consider the general, no-wait and no-idle permutation flowshop scheduling problem with deteriorating jobs, i.e.; jobs whose processing times are increasing functions of their starting times. We assume a linear deterioration function with identical increasing rates for all the jobs and there are some dominating relationships between the machines. We show that the problems to minimize the makespan and the total completion time remain polynomially solvable when deterioration is considered, although these problems are more complicated than their classical counterparts without deterioration.",

keywords = "Deteriorating jobs, Dominating machines, Flowshop, No-idle, No-wait, Scheduling",

author = "Ng, {C. T.} and Wang, {J. B.} and Cheng, {T. C.E.} and Lam, {S. S.}",

note = "Funding Information: We are grateful to an anonymous referee for his/her helpful comments on earlier versions of our paper. This research was supported in part by The Hong Kong Polytechnic University under Grant No. J-BB7J . Wang was also partially supported by the National Natural Science Foundation of China under Grant No. 11001181 .",

year = "2011",

month = oct,

doi = "10.1016/j.cie.2011.04.020",

language = "English",

volume = "61",

pages = "647--654",

number = "3",

}

TY - JOUR

T1 - Flowshop scheduling of deteriorating jobs on dominating machines

AU - Ng, C. T.

AU - Wang, J. B.

AU - Cheng, T. C.E.

AU - Lam, S. S.

N1 - Funding Information: We are grateful to an anonymous referee for his/her helpful comments on earlier versions of our paper. This research was supported in part by The Hong Kong Polytechnic University under Grant No. J-BB7J . Wang was also partially supported by the National Natural Science Foundation of China under Grant No. 11001181 .

PY - 2011/10

Y1 - 2011/10

N2 - In this paper we consider the general, no-wait and no-idle permutation flowshop scheduling problem with deteriorating jobs, i.e.; jobs whose processing times are increasing functions of their starting times. We assume a linear deterioration function with identical increasing rates for all the jobs and there are some dominating relationships between the machines. We show that the problems to minimize the makespan and the total completion time remain polynomially solvable when deterioration is considered, although these problems are more complicated than their classical counterparts without deterioration.

AB - In this paper we consider the general, no-wait and no-idle permutation flowshop scheduling problem with deteriorating jobs, i.e.; jobs whose processing times are increasing functions of their starting times. We assume a linear deterioration function with identical increasing rates for all the jobs and there are some dominating relationships between the machines. We show that the problems to minimize the makespan and the total completion time remain polynomially solvable when deterioration is considered, although these problems are more complicated than their classical counterparts without deterioration.

KW - Deteriorating jobs

KW - Dominating machines

KW - Flowshop

KW - No-idle

KW - No-wait

KW - Scheduling

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

U2 - 10.1016/j.cie.2011.04.020

DO - 10.1016/j.cie.2011.04.020

M3 - Article

AN - SCOPUS:80053204848

SN - 0360-8352

VL - 61

SP - 647

EP - 654

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

IS - 3

ER -

Flowshop scheduling of deteriorating jobs on dominating machines

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this