Propose a Polynomial Time Algorithm for Total Completion Time Objective

In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has more than one motivation. First, jobs are assigned to machines in an automated production line. Later, to schedule the maintenance activiti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of mathematical, engineering and management sciences Ročník 6; číslo 3; s. 932 - 943
Hlavní autoři: Ozturkoglu, Yucel, Ozturkoglu, Omer
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dehradun International Journal of Mathematical, Engineering and Management Sciences 01.06.2021
Ram Arti Publishers
Témata:
Algorithms
deteriorated job
Job shops
rate-modifying-activity
Repair & maintenance
Scheduling
total completion time
ISSN:2455-7749, 2455-7749
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has more than one motivation. First, jobs are assigned to machines in an automated production line. Later, to schedule the maintenance activities, if needed, to prevent machinery from breaking down later. There are some important mathematical models to solve this combination. However, due to the complexity of the problem which is Np-hard, a polynomial algorithm should be needed for solving large problems. Therefore, this article introduces several polnomial algorithms to determine the order of things best. With using these algorithms, it will be possible to determine where to assign to the schedule, taking into account the number of maintenance activities required and their optimum total completion time.
AbstractList In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has more than one motivation. First, jobs are assigned to machines in an automated production line. Later, to schedule the maintenance activities, if needed, to prevent machinery from breaking down later. There are some important mathematical models to solve this combination. However, due to the complexity of the problem which is Np-hard, a polynomial algorithm should be needed for solving large problems. Therefore, this article introduces several polnomial algorithms to determine the order of things best. With using these algorithms, it will be possible to determine where to assign to the schedule, taking into account the number of maintenance activities required and their optimum total completion time.
Author Ozturkoglu, Yucel
Ozturkoglu, Omer
Author_xml – sequence: 1
  givenname: Yucel
  surname: Ozturkoglu
  fullname: Ozturkoglu, Yucel
– sequence: 2
  givenname: Omer
  surname: Ozturkoglu
  fullname: Ozturkoglu, Omer
BookMark eNpNkVFLwzAUhYNMcM79Ax8KPq8muUnTPo4x52RjA-dzSNNktrRNTTth_95uFfHpHu49nHvgu0ej2tUGoUeCQ4A4Tp7Xb9vl9j2kmJIwCiHEnN-gMWWcz4RgyeifvkPTti0wxlQkwAkdo9Xeu8a1JlDB3pXn2lW5KoNDXplgXh6dz7vPKrDOBwfX9YeFq5rSdLmrB88uLYzu8m_zgG6tKlsz_Z0T9PGyPCxeZ5vdar2Yb2YaGO5mlrNUJSZhWpPMYsppTDOmWBxrq6BXkGIwmoPgMRAWpYYqGxlLBTCSMQsTtB5yM6cK2fi8Uv4sncrldeH8USrf5bo0MtIptaANEJ2ylEFKEitAMxH3FaiifdbTkNV493UybScLd_J1X1_SCCgXTPCLiw0u7V3bemP_vhIsrwTkQEBeCMhIguwJwA9r8Xrs
Cites_doi 10.1287/opre.38.3.495
10.1016/0360-8352(95)00006-m
10.1016/j.cie.2020.106329
10.1007/s00170-012-4139-7
10.1016/0360-8352(88)90041-1
10.1007/s00170-012-4553-x
10.1016/s0377-2217(00)00322-2
10.1016/j.ejor.2009.03.027
10.11121/ijocta.01.2017.00328
10.1016/0377-2217(90)90089-t
10.1109/cec.2016.7744157
10.11121/ijocta.01.2015.00260
10.1016/s0167-5060(08)70356-x
10.1007/s00170-011-3303-9
10.1080/00207543.2016.1208852
ContentType Journal Article
Copyright 2021. This work is published under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2021. This work is published under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
3V.
7WY
7WZ
7XB
87Z
8FK
8FL
ABUWG
AFKRA
AZQEC
BENPR
BEZIV
CCPQU
DWQXO
FRNLG
F~G
K60
K6~
L.-
M0C
PHGZM
PHGZT
PIMPY
PKEHL
PQBIZ
PQBZA
PQEST
PQQKQ
PQUKI
PRINS
Q9U
DOA
DOI 10.33889/IJMEMS.2021.6.3.055
DatabaseName CrossRef
ProQuest Central (Corporate)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Global (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest One Community College
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
ABI/INFORM Professional Advanced
ABI/INFORM Global
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central China
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Central Korea
ProQuest Central (New)
ABI/INFORM Complete (Alumni Edition)
Business Premium Collection
ABI/INFORM Global
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest One Academic Eastern Edition
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList CrossRef

Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
EISSN 2455-7749
EndPage 943
ExternalDocumentID oai_doaj_org_article_6cb2f3ce31cb4b43b19f73c478ba92a2
10_33889_IJMEMS_2021_6_3_055
GroupedDBID 7WY
8FL
AAYXX
ABUWG
AFFHD
AFKRA
ALMA_UNASSIGNED_HOLDINGS
BENPR
BEZIV
CCPQU
CITATION
DWQXO
FRNLG
GROUPED_DOAJ
M0C
M~E
OK1
PHGZM
PHGZT
PIMPY
PQBIZ
PQBZA
3V.
7XB
8FK
AZQEC
K60
K6~
L.-
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c340t-f54ba9e94cc1df025282d4a488cfa3d4a3b03ec537583146be2af6ef27341d4f3
IEDL.DBID BENPR
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000654044900013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2455-7749
IngestDate Tue Nov 25 02:48:36 EST 2025
Sun Nov 30 04:04:11 EST 2025
Sat Nov 29 05:40:54 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c340t-f54ba9e94cc1df025282d4a488cfa3d4a3b03ec537583146be2af6ef27341d4f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/2632574752?pq-origsite=%requestingapplication%
PQID 2632574752
PQPubID 5363605
PageCount 12
ParticipantIDs doaj_primary_oai_doaj_org_article_6cb2f3ce31cb4b43b19f73c478ba92a2
proquest_journals_2632574752
crossref_primary_10_33889_IJMEMS_2021_6_3_055
PublicationCentury 2000
PublicationDate 2021-06-01
PublicationDateYYYYMMDD 2021-06-01
PublicationDate_xml – month: 06
  year: 2021
  text: 2021-06-01
  day: 01
PublicationDecade 2020
PublicationPlace Dehradun
PublicationPlace_xml – name: Dehradun
PublicationTitle International journal of mathematical, engineering and management sciences
PublicationYear 2021
Publisher International Journal of Mathematical, Engineering and Management Sciences
Ram Arti Publishers
Publisher_xml – name: International Journal of Mathematical, Engineering and Management Sciences
– name: Ram Arti Publishers
References ref13
ref12
ref15
ref14
ref11
ref10
ref0
ref2
ref1
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref0
  doi: 10.1287/opre.38.3.495
– ident: ref8
  doi: 10.1016/0360-8352(95)00006-m
– ident: ref1
  doi: 10.1016/j.cie.2020.106329
– ident: ref14
  doi: 10.1007/s00170-012-4139-7
– ident: ref3
  doi: 10.1016/0360-8352(88)90041-1
– ident: ref4
  doi: 10.1007/s00170-012-4553-x
– ident: ref6
  doi: 10.1016/s0377-2217(00)00322-2
– ident: ref7
  doi: 10.1016/j.ejor.2009.03.027
– ident: ref9
  doi: 10.11121/ijocta.01.2017.00328
– ident: ref5
  doi: 10.1016/0377-2217(90)90089-t
– ident: ref13
  doi: 10.1109/cec.2016.7744157
– ident: ref11
  doi: 10.11121/ijocta.01.2015.00260
– ident: ref10
– ident: ref2
  doi: 10.1016/s0167-5060(08)70356-x
– ident: ref12
  doi: 10.1007/s00170-011-3303-9
– ident: ref15
  doi: 10.1080/00207543.2016.1208852
SSID ssj0002793512
Score 2.1452754
Snippet In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has...
SourceID doaj
proquest
crossref
SourceType Open Website
Aggregation Database
Index Database
StartPage 932
SubjectTerms Algorithms
deteriorated job
Job shops
rate-modifying-activity
Repair & maintenance
Scheduling
total completion time
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4iHryIouJ0Sg9es7V96Y8cp2z-wM2BU3YLSZqoY7ayTcH_3pdmk4EHL97aktD0e83L-0je9wg5j7XNw1gWNDNQUGa5pgqUpLnMtUIWZLO6dMLTXTYY5OMxH66V-nJnwrw8sAeunWIXC9pApBVTDFTEbQaaZbmSPJa198WoZ41MTertNA64lPlcOWRhOW_f3Pa7_QdkhHHUSlvQCl1239paVEv2__LI9TLT2yU7y_gw6Phx7ZENU-6Tq6GrZTA3gQyG1fTLZRJjG5e9EXSmzxXy-5e3AKPPYFRhLB24Oe40tavSt7lXE-_WDshjrzu6vKbLCghUAwsX1CYMv9JwpnVUWAxPkCAVTOKk01YCXoEKwegEMOoH9HnKxNKmxjrNmqhgFg7JZlmV5ogEUGRohJRhz4hFxiguC8kzw8Mcb9KkQegKC_HuhS4EEoQaO-GxEw47kQoQiF2DXDjAfto6mer6ARpPLI0n_jJegzRXcIvl3JkLpyCfIMtJ4uP_eMcJ2Xbj9se7mmRzMfswp2RLfy5e57Oz-rf5Bistx90
  priority: 102
  providerName: Directory of Open Access Journals
Title Propose a Polynomial Time Algorithm for Total Completion Time Objective
URI https://www.proquest.com/docview/2632574752
https://doaj.org/article/6cb2f3ce31cb4b43b19f73c478ba92a2
Volume 6
WOSCitedRecordID wos000654044900013&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: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2455-7749
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002793512
  issn: 2455-7749
  databaseCode: DOA
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2455-7749
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002793512
  issn: 2455-7749
  databaseCode: M~E
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 2455-7749
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002793512
  issn: 2455-7749
  databaseCode: 7WY
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global (OCUL)
  customDbUrl:
  eissn: 2455-7749
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002793512
  issn: 2455-7749
  databaseCode: M0C
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2455-7749
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002793512
  issn: 2455-7749
  databaseCode: BENPR
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2455-7749
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002793512
  issn: 2455-7749
  databaseCode: PIMPY
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwEB1B4cCFRYAoS5UDV5ckdhafEKCyiZaInZNlOzaLoIG2IPH3jJMUkJC4cIkSx4mc8Xg8z_G8AdgMtU39UOYkMTQnzHJNFFWSpDLVClGQTcrUCVcnSa-X3tzwrF5wG9bbKsc2sTTUeaHdGvmW4xWP0PeNwu2XV-KyRrm_q3UKjUmYckxlrAFTu51edva1yhKi-uGUVsXMIRpL-dbRcbfTPUdkGAbtuE3bvovy-zEnldT9vyxzOd3sz_23ofMwWzua3k6lGQswYfqLcJC5pAhD40kvK54-XEgy1nFhIN7O0x2-ZXT_7KEb610U6JR7zlg4cu6iX9U5VY-VfVyCy_3Oxd4hqVMpEE2ZPyI2Ykpyw5nWQW7Rz0GklTOJo1dbSfGMKp8aHVGEDxSNpzKhtLGxjvwmyJmly9DoF32zAh7NE-zNmOGTAQuMUVzmkieG-ylexFETyFiY4qVizBCINErhi0r4wglfxIIKFH4Tdp3Ev-o6vuuyoBjciXr4iBgVx1JtaKAVU4yqgNuEapak-FmhDJuwPu4MUQ_CofjuidW_b6_BjGtRtQNsHRqjwZvZgGn9PnoYDlowmVzftmrNapWgHY9dfw_LsqNudvsJ6V_bFg
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQXHiqIhQI-lKO3ie08fEColJZuu7usxIJ6M7ZjF1DZlN0F1D_Fb2Qm2bRISNx64JaHEzn5xt_M2J4ZgC3hY5kIW_EiyIqrqD130lle2tI79IJi0ZRO-DAsxuPy-FhP1uBXFwtD2yo7TmyIuqo9zZFvU17xDG3fTLw8-8apahStrnYlNFqxOArnP9FlW7wYvEZ8nwuxvzfdPeCrqgLcS5UsecyUszpo5X1aRVT56HRUyqIg-2glHkmXyOAziZa0RB5xQdiYh0h5YNJKRYnvvQbXlcLhQFsFk92LOR2Bwo4KtI3QQ9-v1NuDw9He6B36oSLt533ZTyim8A8N2BQK-EsPNMpt_87_9lvuwu2VGc12Wrm_B2thtgFvJlTyYRGYZZP69JwCrrENBbmwndMT7PXy01eGRjqb1uhyMKJCSj1ez9o2b92Xlv3vw_sr6fsDWJ_Vs_AQmKwKlNVc4ZOpSkNw2lZWF0EnJZ7kWQ94B545a_OBGPSjGrBNC7YhsE1upEGwe_CKEL5oS9m8mwv1_MSsyMHkOCyi9EGm3imnpEt1LKRXRYmfJazowWYHvllRzMJcIv_o37efwc2D6WhohoPx0WO4Rb1r97ptwvpy_j08gRv-x_LzYv60kWYGH69aTn4Dsgwysw
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=Propose+a+Polynomial+Time+Algorithm+for+Total+Completion+Time+Objective&rft.jtitle=International+journal+of+mathematical%2C+engineering+and+management+sciences&rft.au=Yucel+Ozturkoglu&rft.au=Ozturkoglu%2C+Omer&rft.date=2021-06-01&rft.pub=International+Journal+of+Mathematical%2C+Engineering+and+Management+Sciences&rft.eissn=2455-7749&rft.volume=6&rft.issue=3&rft.spage=932&rft_id=info:doi/10.33889%2FIJMEMS.2021.6.3.055
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2455-7749&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2455-7749&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2455-7749&client=summon