DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2013-02-25T23:29:15Z | - |
dc.date.available | 2013-02-25T23:29:15Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1987-12 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.25, no.12, pp.1751 - 1759 | - |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.uri | http://hdl.handle.net/10203/66011 | - |
dc.language | English | - |
dc.publisher | Taylor & Francis | - |
dc.title | ON THE SUPERIORITY OF A BACKWARD APPROACH IN LIST SCHEDULING ALGORITHMS FOR MULTI-MACHINE MAKESPAN PROBLEMS. | - |
dc.type | Article | - |
dc.identifier.wosid | A1987L625700005 | - |
dc.identifier.scopusid | 2-s2.0-0023595882 | - |
dc.type.rims | ART | - |
dc.citation.volume | 25 | - |
dc.citation.issue | 12 | - |
dc.citation.beginningpage | 1751 | - |
dc.citation.endingpage | 1759 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.