DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Hyun-Jung | ko |
dc.contributor.author | Lee, Jun-Ho | ko |
dc.date.accessioned | 2020-12-18T02:30:07Z | - |
dc.date.available | 2020-12-18T02:30:07Z | - |
dc.date.created | 2020-12-10 | - |
dc.date.issued | 2021-02 | - |
dc.identifier.citation | COMPUTERS & OPERATIONS RESEARCH, v.126 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10203/278672 | - |
dc.description.abstract | We address a uniform parallel machine scheduling problem with machine eligibility, job splitting, sequence-dependent setup times, and limited setup servers, which has been defined from a real applica-tion of piston manufacturing in Korea. The objective is to minimize the makespan. We first propose a mathematical programming model and derive four lower bounds. We then develop an efficient heuristic algorithm that assigns jobs to machines by considering processing times, setup times, and machine eligibility constraints, and then balances machine workloads by splitting jobs. We analyze a worst-case bound of the algorithm and perform extensive experiments with various scenarios. The gap from a lower bound is not significant for practical cases. | - |
dc.language | English | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers | - |
dc.type | Article | - |
dc.identifier.wosid | 000589926400006 | - |
dc.identifier.scopusid | 2-s2.0-85094158191 | - |
dc.type.rims | ART | - |
dc.citation.volume | 126 | - |
dc.citation.publicationname | COMPUTERS & OPERATIONS RESEARCH | - |
dc.identifier.doi | 10.1016/j.cor.2020.105115 | - |
dc.contributor.localauthor | Kim, Hyun-Jung | - |
dc.contributor.nonIdAuthor | Lee, Jun-Ho | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Uniform parallel machines | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Dedicated machines | - |
dc.subject.keywordAuthor | Job splitting | - |
dc.subject.keywordAuthor | Sequence-dependent setup times | - |
dc.subject.keywordAuthor | Multiple servers | - |
dc.subject.keywordAuthor | Heuristic algorithm | - |
dc.subject.keywordPlus | PRECEDENCE CONSTRAINTS | - |
dc.subject.keywordPlus | PROGRAMMING APPROACH | - |
dc.subject.keywordPlus | MINIMIZING MAKESPAN | - |
dc.subject.keywordPlus | IDENTICAL JOBS | - |
dc.subject.keywordPlus | RELEASE TIME | - |
dc.subject.keywordPlus | BOUNDS | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | MODELS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.