A NEW BRANCH AND BOUND ALGORITHM FOR MINIMIZING MEAN TARDINESS IN 2-MACHINE FLOWSHOPS
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Yeong-Dae | ko |
| dc.date.accessioned | 2008-10-07T01:26:58Z | - |
| dc.date.available | 2008-10-07T01:26:58Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1993-05 | - |
| dc.identifier.citation | COMPUTERS OPERATIONS RESEARCH, v.20, no.4, pp.391 - 401 | - |
| dc.identifier.issn | 0305-0548 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/7490 | - |
| dc.description.abstract | We consider the two-machine flowshop scheduling problem with the objective of minimizing mean tardiness. Presented are several properties that are used to calculate lower bounds on total tardiness of jobs for a given partial sequence and to identify sequences dominated by others. We develop a branch and bound algorithm using these bounds and dominance rule. This algorithm is compared with an existing algorithm on randomly-generated test problems. | - |
| dc.language | English | - |
| dc.language.iso | en_US | en |
| dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
| dc.subject | SCHEDULING PROBLEM | - |
| dc.title | A NEW BRANCH AND BOUND ALGORITHM FOR MINIMIZING MEAN TARDINESS IN 2-MACHINE FLOWSHOPS | - |
| dc.type | Article | - |
| dc.identifier.wosid | A1993KP69500005 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 20 | - |
| dc.citation.issue | 4 | - |
| dc.citation.beginningpage | 391 | - |
| dc.citation.endingpage | 401 | - |
| dc.citation.publicationname | COMPUTERS OPERATIONS RESEARCH | - |
| dc.embargo.liftdate | 9999-12-31 | - |
| dc.embargo.terms | 9999-12-31 | - |
| dc.contributor.localauthor | Kim, Yeong-Dae | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordPlus | SCHEDULING PROBLEM | - |
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 69 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.