Bounds for parallel machine scheduling with predefined parts of jobs and setup time
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Hyunjung | ko |
| dc.date.accessioned | 2019-09-02T07:20:10Z | - |
| dc.date.available | 2019-09-02T07:20:10Z | - |
| dc.date.created | 2019-09-02 | - |
| dc.date.created | 2019-09-02 | - |
| dc.date.created | 2019-09-02 | - |
| dc.date.issued | 2018-02 | - |
| dc.identifier.citation | ANNALS OF OPERATIONS RESEARCH, v.261, no.1-2, pp.401 - 412 | - |
| dc.identifier.issn | 0254-5330 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/266079 | - |
| dc.description.abstract | We examine a parallel machine scheduling problem with setup time in order to minimize the makespan. Each job consists of predefined parts, and the parts of a job can be processed concurrently in different machines. We first provide worst-case bounds of the Longest Processing Time and list schedules for special cases. We also develop a heuristic algorithm for scheduling parts of jobs with family setup time and propose its worst-case performance ratio. The application is the IoT-based smart factory with 3D printers as processing machines. | - |
| dc.language | English | - |
| dc.publisher | SPRINGER | - |
| dc.title | Bounds for parallel machine scheduling with predefined parts of jobs and setup time | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000422665800018 | - |
| dc.identifier.scopusid | 2-s2.0-85045095436 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 261 | - |
| dc.citation.issue | 1-2 | - |
| dc.citation.beginningpage | 401 | - |
| dc.citation.endingpage | 412 | - |
| dc.citation.publicationname | ANNALS OF OPERATIONS RESEARCH | - |
| dc.identifier.doi | 10.1007/s10479-017-2615-z | - |
| dc.contributor.localauthor | Kim, Hyunjung | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | Parallel machine scheduling | - |
| dc.subject.keywordAuthor | Worst-case bound | - |
| dc.subject.keywordAuthor | List schedules | - |
| dc.subject.keywordAuthor | LPT schedules | - |
| dc.subject.keywordAuthor | Heuristic algorithm | - |
| dc.subject.keywordPlus | UNIFORM PROCESSORS | - |
| dc.subject.keywordPlus | CONSTRAINTS | - |
| dc.subject.keywordPlus | ANOMALIES | - |
| dc.subject.keywordPlus | COSTS | - |
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 23 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.