DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Ju Yong | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2016-04-15T03:03:43Z | - |
dc.date.available | 2016-04-15T03:03:43Z | - |
dc.date.created | 2014-12-29 | - |
dc.date.created | 2014-12-29 | - |
dc.date.issued | 2015-09 | - |
dc.identifier.citation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.66, no.9, pp.1542 - 1554 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/10203/203933 | - |
dc.description.abstract | This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing total tardiness. After processing a given number of jobs, each machine requires a preventive maintenance task, during which the machine cannot process jobs. We present dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. Performance of the algorithm is evaluated through a series of computational experiments on randomly generated instances and results are reported. | - |
dc.language | English | - |
dc.publisher | PALGRAVE MACMILLAN LTD | - |
dc.subject | TOTAL COMPLETION-TIME | - |
dc.subject | SINGLE-MACHINE | - |
dc.subject | PERIODIC MAINTENANCE | - |
dc.subject | MAKESPAN MINIMIZATION | - |
dc.subject | TOOL CHANGES | - |
dc.subject | TARDY JOBS | - |
dc.subject | FLOW-TIME | - |
dc.subject | PERFORMANCE | - |
dc.subject | HEURISTICS | - |
dc.subject | BREAKDOWN | - |
dc.title | A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint | - |
dc.type | Article | - |
dc.identifier.wosid | 000360776800013 | - |
dc.identifier.scopusid | 2-s2.0-84938629961 | - |
dc.type.rims | ART | - |
dc.citation.volume | 66 | - |
dc.citation.issue | 9 | - |
dc.citation.beginningpage | 1542 | - |
dc.citation.endingpage | 1554 | - |
dc.citation.publicationname | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.identifier.doi | 10.1057/jors.2014.122 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | identical parallel machines | - |
dc.subject.keywordAuthor | availability constraint | - |
dc.subject.keywordAuthor | total tardiness | - |
dc.subject.keywordAuthor | branch and bound | - |
dc.subject.keywordPlus | TOTAL COMPLETION-TIME | - |
dc.subject.keywordPlus | SINGLE-MACHINE | - |
dc.subject.keywordPlus | PERIODIC MAINTENANCE | - |
dc.subject.keywordPlus | MAKESPAN MINIMIZATION | - |
dc.subject.keywordPlus | TOOL CHANGES | - |
dc.subject.keywordPlus | TARDY JOBS | - |
dc.subject.keywordPlus | FLOW-TIME | - |
dc.subject.keywordPlus | PERFORMANCE | - |
dc.subject.keywordPlus | HEURISTICS | - |
dc.subject.keywordPlus | BREAKDOWN | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.