Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan

This study addresses a single machine scheduling problem with periodic maintenance, where the machine is assumed to be stopped periodically for maintenance for a constant time w during the scheduling period. Meanwhile, the maintenance period [ u, v] is assumed to have been previously arranged and th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 190; H. 1; S. 90 - 102
1. Verfasser: Chen, Jen-Shiang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.10.2008
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:European Journal of Operational Research
Schlagworte:
Applied sciences
Availability constraints
Exact sciences and technology
Heuristic
Integer programming
Inventory control, production control. Distribution
Job shops
Maintenance
Mathematical programming
Operational research and scientific management
Operational research. Management science
Production scheduling
Repair & maintenance
Scheduling
Scheduling, sequencing
Single machine
Studies
Integer programming
Scheduling
Maintenance
Availability constraints
Single machine
Heuristic
Availability
Task scheduling
Mixed integer programming
Makespan
Modeling
Workload
Mixed model
Heuristic method
Time constant
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This study addresses a single machine scheduling problem with periodic maintenance, where the machine is assumed to be stopped periodically for maintenance for a constant time w during the scheduling period. Meanwhile, the maintenance period [ u, v] is assumed to have been previously arranged and the time w is assumed not to exceed the available maintenance period [ u, v] (i.e. w ⩽ v − u). The time u( v) is the earliest (latest) time at which the machine starts (stops) its maintenance. The objective is to minimize the makespan. Two mixed binary integer programming (BIP) models are provided for deriving the optimal solution. Additionally, an efficient heuristic is proposed for finding the near-optimal solution for large-sized problems. Finally, computational results are provided to demonstrate the efficiency of the models and the effectiveness of the heuristics. The mixed BIP model can optimally solve up to 100-job instances, while the average percentage error of the heuristic is below 1%.
AbstractList This study addresses a single machine scheduling problem with periodic maintenance, where the machine is assumed to be stopped periodically for maintenance for a constant time w during the scheduling period. Meanwhile, the maintenance period [u, v] is assumed to have been previously arranged and the time w is assumed not to exceed the available maintenance period [u, v] (i.e. w ≤ v-u). The time u(v) is the earliest (latest) time at which the machine starts (stops) its maintenance. The objective is to minimize the makespan. Two mixed binary integer programming (BIP) models are provided for deriving the optimal solution. Additionally, an efficient heuristic is proposed for finding the near-optimal solution for large-sized problems. Finally, computational results are provided to demonstrate the efficiency of the models and the effectiveness of the heuristics. The mixed BIP model can optimally solve up to 100-job instances, while the average percentage error of the heuristic is below 1%. [PUBLICATION ABSTRACT]
This study addresses a single machine scheduling problem with periodic maintenance, where the machine is assumed to be stopped periodically for maintenance for a constant time w during the scheduling period. Meanwhile, the maintenance period [ u, v] is assumed to have been previously arranged and the time w is assumed not to exceed the available maintenance period [ u, v] (i.e. w ⩽ v − u). The time u( v) is the earliest (latest) time at which the machine starts (stops) its maintenance. The objective is to minimize the makespan. Two mixed binary integer programming (BIP) models are provided for deriving the optimal solution. Additionally, an efficient heuristic is proposed for finding the near-optimal solution for large-sized problems. Finally, computational results are provided to demonstrate the efficiency of the models and the effectiveness of the heuristics. The mixed BIP model can optimally solve up to 100-job instances, while the average percentage error of the heuristic is below 1%.
This study addresses a single machine scheduling problem with periodic maintenance, where the machine is assumed to be stopped periodically for maintenance for a constant time w during the scheduling period. Meanwhile, the maintenance period [u, v] is assumed to have been previously arranged and the time w is assumed not to exceed the available maintenance period [u, v] (i.e. w [less-than-or-equals, slant] v - u). The time u(v) is the earliest (latest) time at which the machine starts (stops) its maintenance. The objective is to minimize the makespan. Two mixed binary integer programming (BIP) models are provided for deriving the optimal solution. Additionally, an efficient heuristic is proposed for finding the near-optimal solution for large-sized problems. Finally, computational results are provided to demonstrate the efficiency of the models and the effectiveness of the heuristics. The mixed BIP model can optimally solve up to 100-job instances, while the average percentage error of the heuristic is below 1%.
Author Chen, Jen-Shiang
Author_xml – sequence: 1
  givenname: Jen-Shiang
  surname: Chen
  fullname: Chen, Jen-Shiang
  email: jschen@cc.feu.edu.tw, jschenc@ms25.hinet.net
  organization: Department of Management Information System, Far East University, 49 Junghua Road, Shinshr Shiang, Tainan 744, Taiwan, ROC
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20256782$$DView record in Pascal Francis
http://econpapers.repec.org/article/eeeejores/v_3a190_3ay_3a2008_3ai_3a1_3ap_3a90-102.htm$$DView record in RePEc
BookMark eNp9UcuO1DAQtNAiMbvwA5wsJI4JfkzsROKCViwPrcQBOFuO02EcEjvYnhHL19NhFg4c1lK7pXZVtVV1SS5CDEDIc85qzrh6NdUwxVQLxnTNVM1E94jseKtFpVrFLsiOSa0rIbh-Qi5znhhjvOHNjsyf3QGG4-zDNxpHirIJ8nGx_Qx0in2mNgx0nOGn3yaL9aFAsMEBta74ky8eMo2BWppR4g_EHXwAWiJdfPCL_7XNvkNebXhKHo92zvDsvl-Rrzdvv1y_r24_vftw_ea2cnvdlmpgbT8o13HeaNGDFLpTauy0ZVZbxx10UgnXdso2FjotnWQcLHApLRcCenlFXpx11xR_HCEXM8VjCrjSCLbne8lli6CPZ1CCFZxZk19sujOAB62EbE4G9TqG9x0WWtti89sQa8XCN86EOZQFxV7eb7TZ2XlMaJHP_0QFE43SrUBce8a5FHNOMBrniy0-hpKsn1HPbHmayWyfMFuehimDeSJV_Ef9q_4g6fWZBGj3yUMy2XnA-AafwBUzRP8Q_TdEbLxB
CODEN EJORDT
CitedBy_id crossref_primary_10_1080_01605682_2024_2337703
crossref_primary_10_1080_00207543_2010_492405
crossref_primary_10_1007_s12204_015_1690_z
crossref_primary_10_1049_iet_cim_2020_0014
crossref_primary_10_1007_s00170_014_6429_8
crossref_primary_10_1016_j_susoc_2021_08_003
crossref_primary_10_1142_S0129054125460025
crossref_primary_10_1016_j_cor_2019_03_001
crossref_primary_10_1007_s40092_019_0314_x
crossref_primary_10_1109_ACCESS_2019_2898905
crossref_primary_10_1016_j_ejor_2017_10_020
crossref_primary_10_4028_www_scientific_net_AMR_690_693_3007
crossref_primary_10_1016_j_ejor_2024_06_030
crossref_primary_10_1016_j_ejor_2014_09_043
crossref_primary_10_1016_j_ejor_2018_05_050
crossref_primary_10_1007_s10951_011_0261_x
crossref_primary_10_1016_j_ejor_2015_10_038
crossref_primary_10_1108_JQME_12_2020_0122
crossref_primary_10_1016_j_aei_2021_101339
crossref_primary_10_1016_j_apm_2013_03_001
crossref_primary_10_1016_j_engappai_2021_104359
crossref_primary_10_1016_j_knosys_2017_12_021
crossref_primary_10_3390_a16040207
crossref_primary_10_1007_s10951_012_0280_2
crossref_primary_10_1016_j_eswa_2021_115693
crossref_primary_10_1016_j_ejor_2008_07_021
crossref_primary_10_1016_j_ejor_2014_08_004
crossref_primary_10_1080_00207543_2021_2002968
crossref_primary_10_1016_j_swevo_2018_02_010
crossref_primary_10_1016_j_ejor_2014_07_044
crossref_primary_10_1080_00207543_2012_676683
crossref_primary_10_1007_s00170_011_3249_y
crossref_primary_10_1007_s43069_021_00098_5
crossref_primary_10_1155_2020_8548463
crossref_primary_10_1007_s12351_015_0179_8
crossref_primary_10_1016_j_cor_2010_09_003
crossref_primary_10_1007_s10951_025_00846_z
crossref_primary_10_1016_j_apm_2009_04_014
crossref_primary_10_1016_j_asoc_2014_06_020
crossref_primary_10_1016_j_cie_2022_108135
crossref_primary_10_1007_s10479_017_2594_0
crossref_primary_10_1016_j_cie_2017_10_004
crossref_primary_10_1016_j_ejor_2018_04_019
crossref_primary_10_1016_j_disopt_2020_100609
crossref_primary_10_1007_s13369_017_2763_0
crossref_primary_10_1080_03155986_2016_1166795
crossref_primary_10_1016_j_cor_2022_105823
crossref_primary_10_1080_00207543_2013_825380
crossref_primary_10_3390_machines10030210
crossref_primary_10_1109_ACCESS_2019_2937812
crossref_primary_10_1016_j_engappai_2024_108572
crossref_primary_10_1016_j_apm_2010_11_017
crossref_primary_10_1016_j_cor_2011_11_002
crossref_primary_10_1016_j_cor_2014_02_006
crossref_primary_10_1080_00207543_2013_849825
crossref_primary_10_1080_17509653_2011_10671175
crossref_primary_10_1007_s10951_011_0248_7
crossref_primary_10_1016_j_amc_2009_11_040
crossref_primary_10_1016_j_cor_2016_11_008
crossref_primary_10_1109_TR_2023_3295478
crossref_primary_10_1016_j_cie_2023_109610
crossref_primary_10_1007_s10951_015_0433_1
crossref_primary_10_1016_j_eswa_2024_125722
crossref_primary_10_1109_ACCESS_2021_3118986
crossref_primary_10_1016_j_cie_2018_06_017
crossref_primary_10_3390_technologies12040045
crossref_primary_10_1080_0951192X_2014_1003413
crossref_primary_10_1080_09537287_2012_665094
crossref_primary_10_1016_j_camwa_2008_11_008
crossref_primary_10_1016_j_cie_2016_03_024
crossref_primary_10_1007_s10951_019_00622_w
crossref_primary_10_1016_j_asoc_2017_04_060
crossref_primary_10_1080_00207543_2015_1108535
crossref_primary_10_1016_j_eswa_2022_116897
crossref_primary_10_1080_00207543_2012_714002
crossref_primary_10_1080_00207543_2020_1866783
crossref_primary_10_1016_j_camwa_2010_12_028
crossref_primary_10_1007_s10951_016_0502_0
crossref_primary_10_1016_j_cie_2010_05_016
crossref_primary_10_1016_j_compchemeng_2012_06_028
crossref_primary_10_1016_j_cor_2016_01_021
crossref_primary_10_1007_s10951_013_0350_0
Cites_doi 10.1007/BF01178778
10.1016/S0377-2217(99)00066-1
10.1007/BF00121681
10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
10.1057/palgrave.jors.2600791
10.1016/S0377-2217(98)00367-1
10.1007/s002360050143
10.1016/S0305-0548(02)00074-6
10.1080/10170660209509183
ContentType Journal Article
Copyright 2007
2008 INIST-CNRS
Copyright Elsevier Sequoia S.A. Oct 1, 2008
Copyright_xml – notice: 2007
– notice: 2008 INIST-CNRS
– notice: Copyright Elsevier Sequoia S.A. Oct 1, 2008
DBID AAYXX
CITATION
IQODW
DKI
X2L
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ejor.2007.06.029
DatabaseName CrossRef
Pascal-Francis
RePEc IDEAS
RePEc
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering 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
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
Applied Sciences
EISSN 1872-6860
EndPage 102
ExternalDocumentID 1458613531
eeeejores_v_3a190_3ay_3a2008_3ai_3a1_3ap_3a90_102_htm
20256782
10_1016_j_ejor_2007_06_029
S0377221707005644
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1OL
1RT
1~.
1~5
29G
4.4
41~
457
4G.
5GY
5VS
6OB
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACIWK
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADIYS
ADJOM
ADMUD
AEBSH
AEFWE
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SCC
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADXHL
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
02
08R
0R
1
41
6XO
8P
AAPBV
ABFLS
ADALY
DKI
G-
HZ
IPNFZ
K
M
MS
PQEST
STF
X
X2L
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c478t-d08bd6c911572be327966f97a0a7ac1ce9362c896a5ae973c301eae133a122eb3
ISICitedReferencesCount 103
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000255820700007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0377-2217
IngestDate Sun Nov 30 05:08:41 EST 2025
Wed Aug 18 03:50:56 EDT 2021
Mon Jul 21 09:13:46 EDT 2025
Tue Nov 18 22:12:17 EST 2025
Sat Nov 29 01:40:53 EST 2025
Fri Feb 23 02:27:51 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Integer programming
Scheduling
Maintenance
Availability constraints
Single machine
Heuristic
Availability
Task scheduling
Mixed integer programming
Makespan
Modeling
Workload
Mixed model
Heuristic method
Time constant
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c478t-d08bd6c911572be327966f97a0a7ac1ce9362c896a5ae973c301eae133a122eb3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 204143138
PQPubID 45678
PageCount 13
ParticipantIDs proquest_journals_204143138
repec_primary_eeeejores_v_3a190_3ay_3a2008_3ai_3a1_3ap_3a90_102_htm
pascalfrancis_primary_20256782
crossref_citationtrail_10_1016_j_ejor_2007_06_029
crossref_primary_10_1016_j_ejor_2007_06_029
elsevier_sciencedirect_doi_10_1016_j_ejor_2007_06_029
PublicationCentury 2000
PublicationDate 2008-10-01
PublicationDateYYYYMMDD 2008-10-01
PublicationDate_xml – month: 10
  year: 2008
  text: 2008-10-01
  day: 01
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationSeriesTitle European Journal of Operational Research
PublicationTitle European journal of operational research
PublicationYear 2008
Publisher Elsevier B.V
Elsevier
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier
– name: Elsevier Sequoia S.A
References Yang, Hung, Hsu, Chern (bib11) 2002; 19
Lee (bib2) 1996; 9
Lee, Leon (bib3) 2001; 128
Pinedo (bib6) 2002
Graves, Lee (bib1) 1999; 46
Lee, Liman (bib4) 1992; 29
Rinnooy Kan (bib8) 1976
Schmidt (bib10) 2000; 121
Liao, Chen (bib5) 2003; 30
Sanlaville, Schmidt (bib9) 1998; 35
Qi, Chen, Tu (bib7) 1999; 50
Sanlaville (10.1016/j.ejor.2007.06.029_bib9) 1998; 35
Pinedo (10.1016/j.ejor.2007.06.029_bib6) 2002
Yang (10.1016/j.ejor.2007.06.029_bib11) 2002; 19
Lee (10.1016/j.ejor.2007.06.029_bib4) 1992; 29
Liao (10.1016/j.ejor.2007.06.029_bib5) 2003; 30
Lee (10.1016/j.ejor.2007.06.029_bib3) 2001; 128
Schmidt (10.1016/j.ejor.2007.06.029_bib10) 2000; 121
Lee (10.1016/j.ejor.2007.06.029_bib2) 1996; 9
Qi (10.1016/j.ejor.2007.06.029_bib7) 1999; 50
Graves (10.1016/j.ejor.2007.06.029_bib1) 1999; 46
Rinnooy Kan (10.1016/j.ejor.2007.06.029_bib8) 1976
References_xml – volume: 35
  start-page: 795
  year: 1998
  end-page: 811
  ident: bib9
  article-title: Machine scheduling with availability constraints
  publication-title: Acta Informatica
– volume: 30
  start-page: 1335
  year: 2003
  end-page: 1347
  ident: bib5
  article-title: Single-machine scheduling with periodic maintenance and nonresumable jobs
  publication-title: Computers & Operations Research
– volume: 46
  start-page: 845
  year: 1999
  end-page: 863
  ident: bib1
  article-title: Scheduling maintenance and semiresumable jobs on a single machine
  publication-title: Naval Research Logistics
– volume: 128
  start-page: 119
  year: 2001
  end-page: 128
  ident: bib3
  article-title: Machine scheduling with a rate-modifying activity
  publication-title: European Journal of Operational Research
– year: 1976
  ident: bib8
  publication-title: Machine Scheduling Problems: Classification, Complexity and Computations
– volume: 50
  start-page: 1071
  year: 1999
  end-page: 1078
  ident: bib7
  article-title: Scheduling the maintenance on a single machine
  publication-title: Journal of the Operational Research Society
– volume: 121
  start-page: 1
  year: 2000
  end-page: 15
  ident: bib10
  article-title: Scheduling with limited machine availability
  publication-title: European Journal of Operational Research
– volume: 9
  start-page: 395
  year: 1996
  end-page: 416
  ident: bib2
  article-title: Machine scheduling with an availability constraint
  publication-title: Journal of Global Optimization
– volume: 19
  start-page: 63
  year: 2002
  end-page: 66
  ident: bib11
  article-title: Minimizing the makespan in a single machine scheduling problem with a flexible maintenance
  publication-title: Journal of the Chinese Institute of Industrial Engineers
– year: 2002
  ident: bib6
  publication-title: Scheduling: Theory, Algorithms, and Systems
– volume: 29
  start-page: 375
  year: 1992
  end-page: 382
  ident: bib4
  article-title: Single machine flow-time scheduling with scheduled maintenance
  publication-title: Acta Informatica
– volume: 29
  start-page: 375
  year: 1992
  ident: 10.1016/j.ejor.2007.06.029_bib4
  article-title: Single machine flow-time scheduling with scheduled maintenance
  publication-title: Acta Informatica
  doi: 10.1007/BF01178778
– volume: 128
  start-page: 119
  year: 2001
  ident: 10.1016/j.ejor.2007.06.029_bib3
  article-title: Machine scheduling with a rate-modifying activity
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(99)00066-1
– year: 2002
  ident: 10.1016/j.ejor.2007.06.029_bib6
– year: 1976
  ident: 10.1016/j.ejor.2007.06.029_bib8
– volume: 9
  start-page: 395
  year: 1996
  ident: 10.1016/j.ejor.2007.06.029_bib2
  article-title: Machine scheduling with an availability constraint
  publication-title: Journal of Global Optimization
  doi: 10.1007/BF00121681
– volume: 46
  start-page: 845
  year: 1999
  ident: 10.1016/j.ejor.2007.06.029_bib1
  article-title: Scheduling maintenance and semiresumable jobs on a single machine
  publication-title: Naval Research Logistics
  doi: 10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
– volume: 50
  start-page: 1071
  year: 1999
  ident: 10.1016/j.ejor.2007.06.029_bib7
  article-title: Scheduling the maintenance on a single machine
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/palgrave.jors.2600791
– volume: 121
  start-page: 1
  year: 2000
  ident: 10.1016/j.ejor.2007.06.029_bib10
  article-title: Scheduling with limited machine availability
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(98)00367-1
– volume: 35
  start-page: 795
  year: 1998
  ident: 10.1016/j.ejor.2007.06.029_bib9
  article-title: Machine scheduling with availability constraints
  publication-title: Acta Informatica
  doi: 10.1007/s002360050143
– volume: 30
  start-page: 1335
  year: 2003
  ident: 10.1016/j.ejor.2007.06.029_bib5
  article-title: Single-machine scheduling with periodic maintenance and nonresumable jobs
  publication-title: Computers & Operations Research
  doi: 10.1016/S0305-0548(02)00074-6
– volume: 19
  start-page: 63
  year: 2002
  ident: 10.1016/j.ejor.2007.06.029_bib11
  article-title: Minimizing the makespan in a single machine scheduling problem with a flexible maintenance
  publication-title: Journal of the Chinese Institute of Industrial Engineers
  doi: 10.1080/10170660209509183
SSID ssj0001515
Score 2.2752957
Snippet This study addresses a single machine scheduling problem with periodic maintenance, where the machine is assumed to be stopped periodically for maintenance for...
SourceID proquest
repec
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 90
SubjectTerms Applied sciences
Availability constraints
Exact sciences and technology
Heuristic
Integer programming
Inventory control, production control. Distribution
Job shops
Maintenance
Mathematical programming
Operational research and scientific management
Operational research. Management science
Production scheduling
Repair & maintenance
Scheduling
Scheduling, sequencing
Single machine
Studies
Title Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
URI https://dx.doi.org/10.1016/j.ejor.2007.06.029
http://econpapers.repec.org/article/eeeejores/v_3a190_3ay_3a2008_3ai_3a1_3ap_3a90-102.htm
https://www.proquest.com/docview/204143138
Volume 190
WOSCitedRecordID wos000255820700007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6860
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001515
  issn: 0377-2217
  databaseCode: AIEXJ
  dateStart: 19950105
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZgRQiEuBQQZTD5gbcpU2Mnsf04VUPAw4S0IfUtchyHtWuTqpdp26_n-Ja2Q53YA5UcpU6c2_lsn3N8Lgh9kWY1jOsMhBxRRolKaSRlmkW0JIryNCloXNpkE-z0lA-H4qc3K1rYdAKsrvn1tZj9V1JDHRDbuM4-gNztRaEC9oHosAWyw_afCH8GZChXE2_NDNI9CNSrqfWQGjeFC8lcmTCYpmYqTbyI2vkNKJtJYqTtCoI8NFoEe4oxt7QZNkwckuno1tRdahiK6p16fc_jQsU8aBt9WKFW_TwIfiG6js4uAKW_tzQQvLVlaz2vGIsIcT6Y7ajqsoBuwceNkf6Am21j62_990DudArjIz1u5j7QZHbU98qRrajZd2az1sYwmK-Nc3MNk26T5caGj4jHqENYKmAY7xx_Pxn-aGduw9zZVSf_Pt7JytkD3n2SXYzMi5lcQPeqXF6ULcGlM9czrTb4l_PX6KUXPPCxA8wb9EjXXfQ0-D100auQ3wP74b6Lnm8Eq3yLJmtg4abCm8DCBlgYgIUDsPAGsPAaWLipscQOWNgDCy8bHICFA7DeoV9fT84H3yKfqyNSCePLqOzzosyUMLGbSKEpYSBHV4LJvmRSxUoL4JQUF5lMpRaMKphYtNQxpTImRBf0PdqDB9cfEOZKFJSJlGmRJIWo4B_hXNFUVf2MJ7qH4vDhc-UD2Zt8KpN8N8l76LBtM3NhXO49Ow30zD0j6hjMHOB5b7uDLeK3tyJGsgBevIf2Axpy3xkXcDABoSWmvIcGFiBtMw0_uIVe5Fc5fCfRh-0NFJs6lsqRqYQygyLMQ5H8Yjn9-KBX3UfP1l36E9pbzlf6M3qirpajxfzAd5A_xb7ZEg
linkProvider Elsevier
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=Scheduling+of+nonresumable+jobs+and+flexible+maintenance+activities+on+a+single+machine+to+minimize+makespan&rft.jtitle=European+journal+of+operational+research&rft.au=Chen%2C+Jen-Shiang&rft.date=2008-10-01&rft.issn=0377-2217&rft.volume=190&rft.issue=1&rft.spage=90&rft.epage=102&rft_id=info:doi/10.1016%2Fj.ejor.2007.06.029&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2007_06_029
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon