Open Access System for Information Sharing

Login Library

 

Article
Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorJiang, X.-
dc.contributor.authorLee, K.-
dc.contributor.authorPinedo, M.L.-
dc.date.available2021-01-19T00:50:03Z-
dc.date.available2021-01-19T00:50:08Z-
dc.date.created2020-10-21-
dc.date.issued2021-04-16-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://oasis.postech.ac.kr/handle/2014.oak/104866-
dc.description.abstractAn ideal schedule is a schedule that simultaneously minimizes the two most popular scheduling objectives, namely the makespan and the total completion time. If a scheduling problem always has an ideal schedule, then the problem is called an ideal problem. We summarize ideal problem results of various scheduling problems in different machine environments and with job characteristics that include precedence constraints, release dates, processing times, eligibility constraints and preemptions. We present a comprehensive overview of ideal schedules including our new findings. (C) 2020 Elsevier B.V. All rights reserved.-
dc.languageEnglish-
dc.publisherELSEVIER-
dc.subjectMEAN FLOW TIME-
dc.subjectARBITRARY RELEASE TIMES-
dc.subjectEQUAL LENGTH JOBS-
dc.subjectPRECEDENCE CONSTRAINTS-
dc.subjectTASKS-
dc.subjectCOMPLEXITY-
dc.subjectALGORITHM-
dc.titleIdeal schedules in parallel machine settings-
dc.typeArticle-
dc.type.rimsART-
dc.identifier.bibliographicCitationEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.290, no.2, pp.422 - 434-
dc.identifier.wosid000602863200002-
dc.citation.endPage434-
dc.citation.number2-
dc.citation.startPage422-
dc.citation.titleEUROPEAN JOURNAL OF OPERATIONAL RESEARCH-
dc.citation.volume290-
dc.contributor.affiliatedAuthorJiang, X.-
dc.contributor.affiliatedAuthorLee, K.-
dc.identifier.scopusid2-s2.0-85090479079-
dc.description.journalClass1-
dc.description.isOpenAccessN-
dc.type.docTypeArticle-
dc.subject.keywordPlusMEAN FLOW TIME-
dc.subject.keywordPlusARBITRARY RELEASE TIMES-
dc.subject.keywordPlusEQUAL LENGTH JOBS-
dc.subject.keywordPlusPRECEDENCE CONSTRAINTS-
dc.subject.keywordPlusTASKS-
dc.subject.keywordPlusCOMPLEXITY-
dc.subject.keywordPlusALGORITHM-
dc.subject.keywordAuthorScheduling-
dc.subject.keywordAuthorMakespan-
dc.subject.keywordAuthorTotal completion time-
dc.subject.keywordAuthorPrecedence-
dc.subject.keywordAuthorEligibility-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

이강복LEE, KANGBOK
Dept of Industrial & Management Enginrg
Read more

Views & Downloads

Browse