Considerations of single-machine scheduling with deteriorating jobs

This paper considers some scheduling problems with deteriorating jobs. The objectives are to minimize the makespan, the total completion time, the total absolute deviation of completion time, the earliness, tardiness, and due date penalty, the sum of earliness penalties subject to no tardy jobs, res...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematical modelling Vol. 35; no. 10; pp. 5134 - 5142
Main Authors Zhao, Chuan-Li, Hsu, Chou-Jung, Yang, Dar-Li
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Inc 01.10.2011
Elsevier
Subjects
Applied sciences
Completion time
Deteriorating jobs
Deterioration
Deviation
Exact sciences and technology
Inventory control, production control. Distribution
Mathematical analysis
Mathematical models
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization
Resource allocation
Scheduling
Scheduling, sequencing
Single-machine
Single-machine
Scheduling
Deteriorating jobs
Resource allocation
Task scheduling
Makespan
Polynomial method
Due date
Workload
Polynomial time
Deterioration
Resource constraint
Earliness
Objective function
Resource management
Single machine
Completion time
Online AccessGet full text
ISSN0307-904X
DOI10.1016/j.apm.2011.04.018

Cover

Abstract This paper considers some scheduling problems with deteriorating jobs. The objectives are to minimize the makespan, the total completion time, the total absolute deviation of completion time, the earliness, tardiness, and due date penalty, the sum of earliness penalties subject to no tardy jobs, respectively. We also explore two resource constrained scheduling problems: how to minimize the resource consumption with makespan constraints and how to minimize the makespan with the total resource consumption constraints. Several polynomial time algorithms are proposed to optimally solve the problems with the above objective functions.
AbstractList This paper considers some scheduling problems with deteriorating jobs. The objectives are to minimize the makespan, the total completion time, the total absolute deviation of completion time, the earliness, tardiness, and due date penalty, the sum of earliness penalties subject to no tardy jobs, respectively. We also explore two resource constrained scheduling problems: how to minimize the resource consumption with makespan constraints and how to minimize the makespan with the total resource consumption constraints. Several polynomial time algorithms are proposed to optimally solve the problems with the above objective functions.
Author Zhao, Chuan-Li
Hsu, Chou-Jung
Yang, Dar-Li
Author_xml – sequence: 1
  givenname: Chuan-Li
  surname: Zhao
  fullname: Zhao, Chuan-Li
  organization: College of Mathematics and Systems Sciences, Shenyang Normal University, Shenyang, Liaoning 110034, People’s Republic of China
– sequence: 2
  givenname: Chou-Jung
  surname: Hsu
  fullname: Hsu, Chou-Jung
  organization: Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan
– sequence: 3
  givenname: Dar-Li
  surname: Yang
  fullname: Yang, Dar-Li
  email: dlyang@nfu.edu.tw
  organization: Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24250148$$DView record in Pascal Francis
BookMark eNp9kLtOwzAUQD0UibbwAWxZEFPCdWznISZU8ZIqsYDEZrnONXWUxsVOQfw9Dq0YGDrZvjrHujozMuldj4RcUMgo0OK6zdR2k-VAaQY8A1pNyBQYlGkN_O2UzEJoAUDE15QsFq4PtkGvBhtviTNJsP17h-lG6bXtMQl6jc2ui8Pkyw7rpMEBvXWjEEetW4UzcmJUF_D8cM7J6_3dy-IxXT4_PC1ul6lmoh5SgwIbrY0WwjTAtUBOBTW8LFiBAEzkpTY1Y7xA0ZQVLRRHKGscFzWiWrE5udr_u_XuY4dhkBsbNHad6tHtgqzqImeM5nUkLw-kClp1xqte2yC33m6U_5Y5zwVQXkWO7jntXQgezR9CQY4tZStjSzm2lMBlbBmd8p-j7fBbb_DKdkfNm72JMdKnRS-DtthrbKxHPcjG2SP2D1wDkpU
CODEN AMMODL
CitedBy_id crossref_primary_10_1007_s11590_012_0539_8
crossref_primary_10_1016_j_apm_2013_10_022
crossref_primary_10_4028_www_scientific_net_AMR_645_290
crossref_primary_10_1080_00207543_2019_1685707
crossref_primary_10_1080_00207543_2017_1321804
crossref_primary_10_1080_0951192X_2014_928747
crossref_primary_10_4028_www_scientific_net_AMM_481_207
Cites_doi 10.1016/0360-8352(88)90041-1
10.1016/j.camwa.2007.12.006
10.51400/2709-6998.2141
10.1016/S0377-2217(02)00909-8
10.1016/j.amc.2003.12.073
10.3724/SP.J.1004.2009.01290
10.1016/j.cie.2009.08.006
10.1016/j.cor.2006.12.026
10.1111/j.1475-3995.2005.501_1.x
10.1016/S0167-5060(08)70356-X
10.1016/j.dam.2007.02.003
10.2307/1427168
10.1287/opre.39.6.979
10.1016/j.ijpe.2008.11.011
10.1016/j.ijpe.2009.11.001
10.1016/j.apm.2009.04.018
10.1057/palgrave.jors.2600740
10.1109/9.293187
10.1016/0377-2217(88)90356-6
10.1016/j.ijpe.2008.05.004
10.1287/opre.30.2.391
10.1016/j.cor.2009.03.019
10.1016/j.apm.2010.10.015
10.1287/mnsc.27.12.1453
10.1287/opre.38.3.495
10.1016/j.omega.2004.10.006
10.1007/s00170-007-1255-x
10.1142/S021759590700122X
10.1016/j.ijpe.2010.02.009
10.1016/S0377-2217(98)00246-X
10.1016/0005-1098(86)90014-2
10.1016/j.ejor.2006.04.021
10.1016/j.cie.2010.12.017
10.1016/0377-2217(90)90089-T
10.1016/j.ipl.2004.12.018
10.1016/j.apm.2010.04.014
10.1016/j.ejor.2008.12.029
ContentType Journal Article
Copyright 2011 Elsevier Inc.
2015 INIST-CNRS
Copyright_xml – notice: 2011 Elsevier Inc.
– notice: 2015 INIST-CNRS
DBID 6I.
AAFTH
AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.apm.2011.04.018
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Applied Sciences
EndPage 5142
ExternalDocumentID 24250148
10_1016_j_apm_2011_04_018
S0307904X11002459
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
23M
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
ABAOU
ABEFU
ABFNM
ABMAC
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ADBBV
ADEZE
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AEXQZ
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HZ~
IHE
IXB
J1W
JJJVA
KOM
LG9
LY7
M26
M41
MHUIS
MO0
MVM
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SES
SEW
SPC
SPCBC
SST
SSW
SSZ
T5K
TN5
WH7
WUQ
XJT
XPP
ZMT
~02
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c359t-fe5edccfc55fd04c5e4151f47636e003527cf93346e5d7816a4e079e5904f58b3
IEDL.DBID IXB
ISSN 0307-904X
IngestDate Sun Sep 28 09:13:08 EDT 2025
Mon Jul 21 09:14:51 EDT 2025
Thu Apr 24 22:58:21 EDT 2025
Wed Oct 01 02:44:31 EDT 2025
Fri Feb 23 02:30:29 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 10
Keywords Single-machine
Scheduling
Deteriorating jobs
Resource allocation
Task scheduling
Makespan
Polynomial method
Due date
Workload
Polynomial time
Deterioration
Resource constraint
Earliness
Objective function
Resource management
Single machine
Completion time
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c359t-fe5edccfc55fd04c5e4151f47636e003527cf93346e5d7816a4e079e5904f58b3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0307904X11002459
PQID 896233129
PQPubID 23500
PageCount 9
ParticipantIDs proquest_miscellaneous_896233129
pascalfrancis_primary_24250148
crossref_primary_10_1016_j_apm_2011_04_018
crossref_citationtrail_10_1016_j_apm_2011_04_018
elsevier_sciencedirect_doi_10_1016_j_apm_2011_04_018
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2011-10-01
PublicationDateYYYYMMDD 2011-10-01
PublicationDate_xml – month: 10
  year: 2011
  text: 2011-10-01
  day: 01
PublicationDecade 2010
PublicationPlace Kidlington
PublicationPlace_xml – name: Kidlington
PublicationTitle Applied mathematical modelling
PublicationYear 2011
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
References Cheng, Hsu, Yang (b0120) 2011; 60
Wang, Ng, Cheng (b0075) 2008; 35
Kunnathur, Gupta (b0020) 1990; 47
Cheng, Kang, Ng (b0160) 2005; 12
Li, Li, Sun, Xu (b0085) 2009; 118
Hsu, Yang, Yang (b0130) 2011; 19
Wu, Lee (b0080) 2008; 115
Yang, Wang, Wang, Ip, Wang (b0145) 2009; 35
Cheng, Janiak (b0200) 1994; 39
Wang, Xia (b0055) 2006; 34
Ng, Wang, Cheng, Liu (b0100) 2010; 37
Gawiejnowicz (b0045) 2008
Wang, Cheng (b0065) 2007; 24
Gupta, Gupta (b0010) 1988; 14
Cheng, Lee, Wu (b0125) 2011; 35
Mosheiov (b0025) 1991; 39
Cheng, Lee, Wu (b0090) 2010; 34
Graham, Lawler, Lenstra, Rinnooy Kan (b0170) 1979; 5
Sun, Sun, Cui, Wang (b0105) 2010; 200
Zhao, Tang (b0140) 2005; 161
Zhao, Tang (b0115) 2010; 125
Valerie C.Y. Zhu, L.Y. Sun, L.H. Sun, X.H. Li, Single-machine scheduling time-dependent jobs with resource-dependent ready times, Computers and Industrial Engineering
Lee, Shiau, Chen, Wu (b0095) 2010; 124
Wang (b0150) 2010; 34
Cheng, Ding, Lin (b0040) 2004; 152
.
Panwalkar, Smith, Seidmann (b0185) 1982; 30
Low, Hsu, Su (b0030) 2008; 56
Hardy, Littlewood, Polya (b0175) 1967
Janiak (b0195) 1986; 22
Wang, Lin, Shan (b0070) 2008; 39
Yang, Yang (b0110) 2010; 48
Biskup (b0165) 1999; 115
Shabtay, Steiner (b0135) 2007; 155
Chang, Schneeberger (b0190) 1988; 34
Alidaee, Womer (b0035) 1999; 50
Kanet (b0180) 1981; 27
Browne, Yechiali (b0015) 1989; 10
Browne, Yechiali (b0005) 1990; 38
Wang, Xia (b0050) 2005; 94
Gawiejnowicz (b0060) 2007; 180
Janiak (10.1016/j.apm.2011.04.018_b0195) 1986; 22
Kanet (10.1016/j.apm.2011.04.018_b0180) 1981; 27
Cheng (10.1016/j.apm.2011.04.018_b0160) 2005; 12
Gawiejnowicz (10.1016/j.apm.2011.04.018_b0060) 2007; 180
Cheng (10.1016/j.apm.2011.04.018_b0090) 2010; 34
Zhao (10.1016/j.apm.2011.04.018_b0140) 2005; 161
Browne (10.1016/j.apm.2011.04.018_b0005) 1990; 38
Gawiejnowicz (10.1016/j.apm.2011.04.018_b0045) 2008
Wang (10.1016/j.apm.2011.04.018_b0065) 2007; 24
Wang (10.1016/j.apm.2011.04.018_b0055) 2006; 34
Wang (10.1016/j.apm.2011.04.018_b0075) 2008; 35
Kunnathur (10.1016/j.apm.2011.04.018_b0020) 1990; 47
Li (10.1016/j.apm.2011.04.018_b0085) 2009; 118
10.1016/j.apm.2011.04.018_b0155
Zhao (10.1016/j.apm.2011.04.018_b0115) 2010; 125
Graham (10.1016/j.apm.2011.04.018_b0170) 1979; 5
Cheng (10.1016/j.apm.2011.04.018_b0040) 2004; 152
Cheng (10.1016/j.apm.2011.04.018_b0125) 2011; 35
Wang (10.1016/j.apm.2011.04.018_b0150) 2010; 34
Chang (10.1016/j.apm.2011.04.018_b0190) 1988; 34
Wang (10.1016/j.apm.2011.04.018_b0070) 2008; 39
Panwalkar (10.1016/j.apm.2011.04.018_b0185) 1982; 30
Wu (10.1016/j.apm.2011.04.018_b0080) 2008; 115
Yang (10.1016/j.apm.2011.04.018_b0145) 2009; 35
Wang (10.1016/j.apm.2011.04.018_b0050) 2005; 94
Gupta (10.1016/j.apm.2011.04.018_b0010) 1988; 14
Browne (10.1016/j.apm.2011.04.018_b0015) 1989; 10
Ng (10.1016/j.apm.2011.04.018_b0100) 2010; 37
Alidaee (10.1016/j.apm.2011.04.018_b0035) 1999; 50
Hsu (10.1016/j.apm.2011.04.018_b0130) 2011; 19
Cheng (10.1016/j.apm.2011.04.018_b0200) 1994; 39
Yang (10.1016/j.apm.2011.04.018_b0110) 2010; 48
Shabtay (10.1016/j.apm.2011.04.018_b0135) 2007; 155
Lee (10.1016/j.apm.2011.04.018_b0095) 2010; 124
Mosheiov (10.1016/j.apm.2011.04.018_b0025) 1991; 39
Low (10.1016/j.apm.2011.04.018_b0030) 2008; 56
Sun (10.1016/j.apm.2011.04.018_b0105) 2010; 200
Cheng (10.1016/j.apm.2011.04.018_b0120) 2011; 60
Biskup (10.1016/j.apm.2011.04.018_b0165) 1999; 115
Hardy (10.1016/j.apm.2011.04.018_b0175) 1967
References_xml – volume: 35
  start-page: 2684
  year: 2008
  end-page: 2693
  ident: b0075
  article-title: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
  publication-title: Comput. Oper. Res.
– volume: 10
  start-page: 432
  year: 1989
  end-page: 450
  ident: b0015
  article-title: Dynamic priority rules for cyclic type queues
  publication-title: Adv. Appl. Probab.
– volume: 34
  start-page: 221
  year: 1988
  end-page: 230
  ident: b0190
  article-title: Single machine scheduling to minimize weighted earliness subject to no tardy jobs
  publication-title: Eur. J. Oper. Res.
– volume: 125
  start-page: 294
  year: 2010
  end-page: 299
  ident: b0115
  article-title: Scheduling deteriorating jobs under disruption
  publication-title: Int. J. Prod. Econ.
– volume: 34
  start-page: 4171
  year: 2010
  end-page: 4178
  ident: b0090
  article-title: Single-machine scheduling with deteriorating functions for job processing times
  publication-title: Appl. Math. Model.
– volume: 30
  start-page: 391
  year: 1982
  end-page: 399
  ident: b0185
  article-title: Common due date assignment to minimize total penalty for the one machine scheduling problem
  publication-title: Oper. Res.
– volume: 48
  start-page: 171
  year: 2010
  end-page: 179
  ident: b0110
  article-title: Single-machine scheduling problems with aging effect under an optional maintenance activity consideration
  publication-title: INFOR
– volume: 180
  start-page: 472
  year: 2007
  end-page: 478
  ident: b0060
  article-title: Scheduling deteriorating jobs subject to job or machine availability constraints
  publication-title: Eur. J. Oper. Res.
– volume: 22
  start-page: 745
  year: 1986
  end-page: 747
  ident: b0195
  article-title: Time-optimal control in a single machine problems with resource constraints
  publication-title: Automatica
– reference: Valerie C.Y. Zhu, L.Y. Sun, L.H. Sun, X.H. Li, Single-machine scheduling time-dependent jobs with resource-dependent ready times, Computers and Industrial Engineering,
– volume: 38
  start-page: 495
  year: 1990
  end-page: 498
  ident: b0005
  article-title: Scheduling deteriorating jobs on a single process
  publication-title: Oper. Res.
– volume: 47
  start-page: 56
  year: 1990
  end-page: 62
  ident: b0020
  article-title: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
  publication-title: Eur. J. Oper. Res.
– volume: 124
  start-page: 188
  year: 2010
  end-page: 197
  ident: b0095
  article-title: A two-machine flowshop scheduling problem with deteriorating jobs and blocking
  publication-title: Int. J. Prod. Econ.
– volume: 39
  start-page: 979
  year: 1991
  end-page: 991
  ident: b0025
  article-title: V-shaped policies for scheduling deteriorating jobs
  publication-title: Oper. Res.
– volume: 37
  start-page: 83
  year: 2010
  end-page: 90
  ident: b0100
  article-title: Two-machine flow shop scheduling with deteriorating jobs to minimize total completion time
  publication-title: Comput. Oper. Res.
– volume: 60
  start-page: 602
  year: 2011
  end-page: 605
  ident: b0120
  article-title: Unrelated parallel-machine scheduling with deteriorating maintenance activities
  publication-title: Comput. Ind. Eng.
– volume: 27
  start-page: 1453
  year: 1981
  end-page: 1459
  ident: b0180
  article-title: Minimizing variation of flow time in single machine systems
  publication-title: Manage. Sci.
– volume: 118
  start-page: 424
  year: 2009
  end-page: 429
  ident: b0085
  article-title: Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times
  publication-title: Int. J. Prod. Econ.
– volume: 34
  start-page: 327
  year: 2006
  end-page: 336
  ident: b0055
  article-title: Flow shop scheduling with deteriorating jobs under ominating machines
  publication-title: Omega
– volume: 24
  start-page: 245
  year: 2007
  end-page: 261
  ident: b0065
  article-title: Scheduling problems with the effects of deterioration and learning
  publication-title: Asia-Pac. J. Oper. Res.
– volume: 56
  start-page: 257
  year: 2008
  end-page: 265
  ident: b0030
  article-title: Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
  publication-title: Comput. Math. Appl.
– volume: 50
  start-page: 711
  year: 1999
  end-page: 720
  ident: b0035
  article-title: Scheduling with time dependent processing times: review and extensions
  publication-title: J. Oper. Res. Soc.
– volume: 200
  start-page: 309
  year: 2010
  end-page: 311
  ident: b0105
  article-title: A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
  publication-title: Eur. J. Oper. Res.
– volume: 155
  start-page: 1643
  year: 2007
  end-page: 1666
  ident: b0135
  article-title: A survey of scheduling with controllable processing times
  publication-title: Discrete Appl. Math.
– year: 2008
  ident: b0045
  article-title: Time-Dependent Scheduling
– year: 1967
  ident: b0175
  article-title: Inequalities
– volume: 19
  start-page: 97
  year: 2011
  end-page: 100
  ident: b0130
  article-title: Due-date assignment and optional maintenance activity scheduling problem with linear deteriorating jobs
  publication-title: J. Marine Sci. Technol.
– volume: 5
  start-page: 287
  year: 1979
  end-page: 326
  ident: b0170
  article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey
  publication-title: Ann. Discrete Math.
– volume: 34
  start-page: 294
  year: 2010
  end-page: 300
  ident: b0150
  article-title: A note on single-machine scheduling with decreasing time-dependent job processing times
  publication-title: Appl. Math. Model.
– volume: 152
  start-page: 1
  year: 2004
  end-page: 13
  ident: b0040
  article-title: A concise survey of scheduling with time-dependent processing times
  publication-title: Eur. J. Oper. Res.
– volume: 12
  start-page: 355
  year: 2005
  end-page: 366
  ident: b0160
  article-title: Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
  publication-title: Int. Trans. Oper. Res.
– volume: 14
  start-page: 387
  year: 1988
  end-page: 393
  ident: b0010
  article-title: Single facility scheduling with nonlinear processing times
  publication-title: Comput. Ind. Eng.
– volume: 94
  start-page: 63
  year: 2005
  end-page: 69
  ident: b0050
  article-title: Scheduling jobs under decreasing linear deterioration
  publication-title: Inform. Process. Lett.
– volume: 39
  start-page: 808
  year: 2008
  end-page: 812
  ident: b0070
  article-title: Single machine group scheduling problems with deteriorating jobs
  publication-title: Int. J. Adv. Manuf. Technol.
– volume: 161
  start-page: 865
  year: 2005
  end-page: 874
  ident: b0140
  article-title: Single machine scheduling problems with deteriorating jobs
  publication-title: Appl. Math. Comput.
– volume: 115
  start-page: 173
  year: 1999
  end-page: 178
  ident: b0165
  article-title: Single-machine scheduling with learning considerations
  publication-title: Eur. J. Oper. Res.
– volume: 115
  start-page: 128
  year: 2008
  end-page: 133
  ident: b0080
  article-title: Single-machine group scheduling problems with deteriorating setup times and job processing times
  publication-title: Int. J. Prod. Econ.
– volume: 35
  start-page: 1861
  year: 2011
  end-page: 1867
  ident: b0125
  article-title: Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
  publication-title: Appl. Math. Model.
– reference: .
– volume: 35
  start-page: 1290
  year: 2009
  end-page: 1295
  ident: b0145
  article-title: Single machine group scheduling problems with the effects of deterioration and learning
  publication-title: Acta Autom. Sin.
– volume: 39
  start-page: 1243
  year: 1994
  end-page: 1246
  ident: b0200
  article-title: Resource optimal control in some single-machine scheduling problems
  publication-title: IEEE Trans. Autom. Control
– volume: 14
  start-page: 387
  year: 1988
  ident: 10.1016/j.apm.2011.04.018_b0010
  article-title: Single facility scheduling with nonlinear processing times
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/0360-8352(88)90041-1
– volume: 56
  start-page: 257
  year: 2008
  ident: 10.1016/j.apm.2011.04.018_b0030
  article-title: Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
  publication-title: Comput. Math. Appl.
  doi: 10.1016/j.camwa.2007.12.006
– volume: 19
  start-page: 97
  year: 2011
  ident: 10.1016/j.apm.2011.04.018_b0130
  article-title: Due-date assignment and optional maintenance activity scheduling problem with linear deteriorating jobs
  publication-title: J. Marine Sci. Technol.
  doi: 10.51400/2709-6998.2141
– volume: 152
  start-page: 1
  year: 2004
  ident: 10.1016/j.apm.2011.04.018_b0040
  article-title: A concise survey of scheduling with time-dependent processing times
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(02)00909-8
– volume: 161
  start-page: 865
  year: 2005
  ident: 10.1016/j.apm.2011.04.018_b0140
  article-title: Single machine scheduling problems with deteriorating jobs
  publication-title: Appl. Math. Comput.
  doi: 10.1016/j.amc.2003.12.073
– volume: 35
  start-page: 1290
  year: 2009
  ident: 10.1016/j.apm.2011.04.018_b0145
  article-title: Single machine group scheduling problems with the effects of deterioration and learning
  publication-title: Acta Autom. Sin.
  doi: 10.3724/SP.J.1004.2009.01290
– ident: 10.1016/j.apm.2011.04.018_b0155
  doi: 10.1016/j.cie.2009.08.006
– volume: 35
  start-page: 2684
  year: 2008
  ident: 10.1016/j.apm.2011.04.018_b0075
  article-title: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2006.12.026
– volume: 12
  start-page: 355
  year: 2005
  ident: 10.1016/j.apm.2011.04.018_b0160
  article-title: Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
  publication-title: Int. Trans. Oper. Res.
  doi: 10.1111/j.1475-3995.2005.501_1.x
– volume: 5
  start-page: 287
  year: 1979
  ident: 10.1016/j.apm.2011.04.018_b0170
  article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey
  publication-title: Ann. Discrete Math.
  doi: 10.1016/S0167-5060(08)70356-X
– volume: 155
  start-page: 1643
  year: 2007
  ident: 10.1016/j.apm.2011.04.018_b0135
  article-title: A survey of scheduling with controllable processing times
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2007.02.003
– volume: 10
  start-page: 432
  year: 1989
  ident: 10.1016/j.apm.2011.04.018_b0015
  article-title: Dynamic priority rules for cyclic type queues
  publication-title: Adv. Appl. Probab.
  doi: 10.2307/1427168
– volume: 39
  start-page: 979
  year: 1991
  ident: 10.1016/j.apm.2011.04.018_b0025
  article-title: V-shaped policies for scheduling deteriorating jobs
  publication-title: Oper. Res.
  doi: 10.1287/opre.39.6.979
– volume: 118
  start-page: 424
  year: 2009
  ident: 10.1016/j.apm.2011.04.018_b0085
  article-title: Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2008.11.011
– volume: 124
  start-page: 188
  year: 2010
  ident: 10.1016/j.apm.2011.04.018_b0095
  article-title: A two-machine flowshop scheduling problem with deteriorating jobs and blocking
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2009.11.001
– volume: 34
  start-page: 294
  year: 2010
  ident: 10.1016/j.apm.2011.04.018_b0150
  article-title: A note on single-machine scheduling with decreasing time-dependent job processing times
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2009.04.018
– volume: 50
  start-page: 711
  year: 1999
  ident: 10.1016/j.apm.2011.04.018_b0035
  article-title: Scheduling with time dependent processing times: review and extensions
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/palgrave.jors.2600740
– volume: 39
  start-page: 1243
  year: 1994
  ident: 10.1016/j.apm.2011.04.018_b0200
  article-title: Resource optimal control in some single-machine scheduling problems
  publication-title: IEEE Trans. Autom. Control
  doi: 10.1109/9.293187
– volume: 34
  start-page: 221
  year: 1988
  ident: 10.1016/j.apm.2011.04.018_b0190
  article-title: Single machine scheduling to minimize weighted earliness subject to no tardy jobs
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(88)90356-6
– year: 2008
  ident: 10.1016/j.apm.2011.04.018_b0045
– volume: 115
  start-page: 128
  year: 2008
  ident: 10.1016/j.apm.2011.04.018_b0080
  article-title: Single-machine group scheduling problems with deteriorating setup times and job processing times
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2008.05.004
– volume: 30
  start-page: 391
  year: 1982
  ident: 10.1016/j.apm.2011.04.018_b0185
  article-title: Common due date assignment to minimize total penalty for the one machine scheduling problem
  publication-title: Oper. Res.
  doi: 10.1287/opre.30.2.391
– volume: 37
  start-page: 83
  year: 2010
  ident: 10.1016/j.apm.2011.04.018_b0100
  article-title: Two-machine flow shop scheduling with deteriorating jobs to minimize total completion time
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2009.03.019
– volume: 35
  start-page: 1861
  year: 2011
  ident: 10.1016/j.apm.2011.04.018_b0125
  article-title: Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2010.10.015
– volume: 27
  start-page: 1453
  year: 1981
  ident: 10.1016/j.apm.2011.04.018_b0180
  article-title: Minimizing variation of flow time in single machine systems
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.27.12.1453
– volume: 38
  start-page: 495
  year: 1990
  ident: 10.1016/j.apm.2011.04.018_b0005
  article-title: Scheduling deteriorating jobs on a single process
  publication-title: Oper. Res.
  doi: 10.1287/opre.38.3.495
– volume: 34
  start-page: 327
  year: 2006
  ident: 10.1016/j.apm.2011.04.018_b0055
  article-title: Flow shop scheduling with deteriorating jobs under ominating machines
  publication-title: Omega
  doi: 10.1016/j.omega.2004.10.006
– volume: 39
  start-page: 808
  year: 2008
  ident: 10.1016/j.apm.2011.04.018_b0070
  article-title: Single machine group scheduling problems with deteriorating jobs
  publication-title: Int. J. Adv. Manuf. Technol.
  doi: 10.1007/s00170-007-1255-x
– volume: 24
  start-page: 245
  year: 2007
  ident: 10.1016/j.apm.2011.04.018_b0065
  article-title: Scheduling problems with the effects of deterioration and learning
  publication-title: Asia-Pac. J. Oper. Res.
  doi: 10.1142/S021759590700122X
– volume: 125
  start-page: 294
  year: 2010
  ident: 10.1016/j.apm.2011.04.018_b0115
  article-title: Scheduling deteriorating jobs under disruption
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2010.02.009
– volume: 115
  start-page: 173
  year: 1999
  ident: 10.1016/j.apm.2011.04.018_b0165
  article-title: Single-machine scheduling with learning considerations
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(98)00246-X
– volume: 48
  start-page: 171
  year: 2010
  ident: 10.1016/j.apm.2011.04.018_b0110
  article-title: Single-machine scheduling problems with aging effect under an optional maintenance activity consideration
  publication-title: INFOR
– volume: 22
  start-page: 745
  year: 1986
  ident: 10.1016/j.apm.2011.04.018_b0195
  article-title: Time-optimal control in a single machine problems with resource constraints
  publication-title: Automatica
  doi: 10.1016/0005-1098(86)90014-2
– volume: 180
  start-page: 472
  year: 2007
  ident: 10.1016/j.apm.2011.04.018_b0060
  article-title: Scheduling deteriorating jobs subject to job or machine availability constraints
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2006.04.021
– volume: 60
  start-page: 602
  year: 2011
  ident: 10.1016/j.apm.2011.04.018_b0120
  article-title: Unrelated parallel-machine scheduling with deteriorating maintenance activities
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2010.12.017
– volume: 47
  start-page: 56
  year: 1990
  ident: 10.1016/j.apm.2011.04.018_b0020
  article-title: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(90)90089-T
– year: 1967
  ident: 10.1016/j.apm.2011.04.018_b0175
– volume: 94
  start-page: 63
  year: 2005
  ident: 10.1016/j.apm.2011.04.018_b0050
  article-title: Scheduling jobs under decreasing linear deterioration
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2004.12.018
– volume: 34
  start-page: 4171
  year: 2010
  ident: 10.1016/j.apm.2011.04.018_b0090
  article-title: Single-machine scheduling with deteriorating functions for job processing times
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2010.04.014
– volume: 200
  start-page: 309
  year: 2010
  ident: 10.1016/j.apm.2011.04.018_b0105
  article-title: A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2008.12.029
SSID ssj0005904
Score 1.9948888
Snippet This paper considers some scheduling problems with deteriorating jobs. The objectives are to minimize the makespan, the total completion time, the total...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 5134
SubjectTerms Applied sciences
Completion time
Deteriorating jobs
Deterioration
Deviation
Exact sciences and technology
Inventory control, production control. Distribution
Mathematical analysis
Mathematical models
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization
Resource allocation
Scheduling
Scheduling, sequencing
Single-machine
Title Considerations of single-machine scheduling with deteriorating jobs
URI https://dx.doi.org/10.1016/j.apm.2011.04.018
https://www.proquest.com/docview/896233129
Volume 35
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  issn: 0307-904X
  databaseCode: GBLVA
  dateStart: 20110101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0005904
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier ScienceDirect Open Access Journals
  issn: 0307-904X
  databaseCode: IXB
  dateStart: 19760601
  customDbUrl:
  isFulltext: true
  dateEnd: 20211003
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0005904
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection
  issn: 0307-904X
  databaseCode: .~1
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0005904
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] - NZ
  issn: 0307-904X
  databaseCode: AIKHN
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 20211003
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0005904
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Freedom Collection Journals
  issn: 0307-904X
  databaseCode: ACRLP
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 20210930
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: true
  ssIdentifier: ssj0005904
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  issn: 0307-904X
  databaseCode: AKRWK
  dateStart: 19760601
  customDbUrl:
  isFulltext: true
  mediaType: online
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0005904
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLbGuIAQ4inGY-qBE1JZH04fR5iYBggugNRb1KaJtIl1Ex1XfjtO2gwhEAeuUaJUX1zbcT7bAOclOaEkJ8KNRBq7iDrQFGDpyrgIpEoKgeakHx6j8QveZSzrwNDmwmhaZav7G51utHU7MmjRHCwmk8GTFs_Uw0wXPQtoE9LDIcYmiS-7_qJ5pB7aYoh6tn3ZNByvfDFrq3jipaf7fvxum7YWeU2IqabVxQ-tbUzRaAe2Wx_SuWo-cxc6stqDzYdVAdZ6H4a2EWcTkHPmytFBgVfpzgx7Ujp0qyUro5PRHR2LdUrNi5kYgaCh6byoD-BldPM8HLttvwRXhCxdukoyWQqhBGOq9FAwSdbZV0gqJJKm8GksVBqGGElWxokf5SgJQqkhUiwpwkPoVvNKHoETlGWCBJJEcg-Zn-ciT8MoD5ElZFWLpAeeRYqLtpi47mnxyi1rbMoJXK7B5R5yArcHF6sli6aSxl-T0cLPv4kDJ03_17L-t6NabaQvVjp22gPHnh2n_0g_juSVnL_XPEnJEQzJ-zn-39YnsBFYeqB_Ct3l27s8I39lWfRh7fLD78P61e39-LFvxPMTbI_qfg
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1La8JAEB6sHtpSSp_UPmwOPRVSYzIbk6NIRevjUgVvS7LZBcUXVf9_Z5OsRVo89Lpk2fDt5JvZybczAC8JBaFkJ8L2RVi3EXWiycXElvXYlSqIBaY73R_47RF-jNm4AE1zF0bLKnPuzzg9Zet8pJqjWV1NJtVPbZ6hg2Nd9MylRY6ghIw4uQilRqfbHvwoPUIHTT1EPcH83ExlXtFqnhfyxDdHt_742z2draI1gaaybhe_iDv1Rq0LOM_DSKuRveklFOTiCk77uxqs62toml6cWU7OWipL5wVm0p6nAkpp0cGWHI2-j27pdKyVaGnMJLUJGpou4_UNjFrvw2bbzlsm2MJj4cZWkslECCUYU4mDgkly0DWFxCK-TGuf1oUKPQ99yZJ6UPMjlISi1BApFsTeLRQXy4W8A8tNkgAJJIkUIbJaFIko9PzIQxaQY42DMjgGKS7yeuK6rcWMG-HYlBO4XIPLHeQEbhled1NWWTGNQw-jgZ_vWQQnsj80rbK3VbuF9NlKp0_LYJm94_Qp6f8j0UIut2sehBQLehQA3f9v6Wc4bg_7Pd7rDLoPcOIatWDtEYqbr618ovBlE1dy8_wG3R3sIQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Considerations+of+single-machine+scheduling+with+deteriorating+jobs&rft.jtitle=Applied+mathematical+modelling&rft.au=Zhao%2C+Chuan-Li&rft.au=Hsu%2C+Chou-Jung&rft.au=Yang%2C+Dar-Li&rft.date=2011-10-01&rft.issn=0307-904X&rft.volume=35&rft.issue=10&rft.spage=5134&rft.epage=5142&rft_id=info:doi/10.1016%2Fj.apm.2011.04.018&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0307-904X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0307-904X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0307-904X&client=summon