Article
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Jiang, X. | - |
| dc.contributor.author | Lee, K. | - |
| dc.contributor.author | Pinedo, M.L. | - |
| dc.date.available | 2021-01-19T00:50:03Z | - |
| dc.date.available | 2021-01-19T00:50:08Z | - |
| dc.date.created | 2020-10-21 | - |
| dc.date.issued | 2021-04-16 | - |
| dc.identifier.issn | 0377-2217 | - |
| dc.identifier.uri | http://oasis.postech.ac.kr/handle/2014.oak/104866 | - |
| dc.description.abstract | An 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.language | English | - |
| dc.publisher | ELSEVIER | - |
| dc.subject | MEAN FLOW TIME | - |
| dc.subject | ARBITRARY RELEASE TIMES | - |
| dc.subject | EQUAL LENGTH JOBS | - |
| dc.subject | PRECEDENCE CONSTRAINTS | - |
| dc.subject | TASKS | - |
| dc.subject | COMPLEXITY | - |
| dc.subject | ALGORITHM | - |
| dc.title | Ideal schedules in parallel machine settings | - |
| dc.type | Article | - |
| dc.type.rims | ART | - |
| dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.290, no.2, pp.422 - 434 | - |
| dc.identifier.wosid | 000602863200002 | - |
| dc.citation.endPage | 434 | - |
| dc.citation.number | 2 | - |
| dc.citation.startPage | 422 | - |
| dc.citation.title | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
| dc.citation.volume | 290 | - |
| dc.contributor.affiliatedAuthor | Jiang, X. | - |
| dc.contributor.affiliatedAuthor | Lee, K. | - |
| dc.identifier.scopusid | 2-s2.0-85090479079 | - |
| dc.description.journalClass | 1 | - |
| dc.description.isOpenAccess | N | - |
| dc.type.docType | Article | - |
| dc.subject.keywordPlus | MEAN FLOW TIME | - |
| dc.subject.keywordPlus | ARBITRARY RELEASE TIMES | - |
| dc.subject.keywordPlus | EQUAL LENGTH JOBS | - |
| dc.subject.keywordPlus | PRECEDENCE CONSTRAINTS | - |
| dc.subject.keywordPlus | TASKS | - |
| dc.subject.keywordPlus | COMPLEXITY | - |
| dc.subject.keywordPlus | ALGORITHM | - |
| dc.subject.keywordAuthor | Scheduling | - |
| dc.subject.keywordAuthor | Makespan | - |
| dc.subject.keywordAuthor | Total completion time | - |
| dc.subject.keywordAuthor | Precedence | - |
| dc.subject.keywordAuthor | Eligibility | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- 이강복LEE, KANGBOK
- Dept of Industrial & Management Enginrg