Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A Branch and Bound Algorithm to Minimize the Total Family Tardiness for Job Shop Scheduling with Job Families
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Yu, Jae Min | - |
| dc.contributor.author | Lee, Dong Ho | - |
| dc.date.accessioned | 2024-12-20T06:30:02Z | - |
| dc.date.available | 2024-12-20T06:30:02Z | - |
| dc.date.issued | 2013-06 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/202872 | - |
| dc.format.extent | 4 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | The Korean Society of Precision Engineering | - |
| dc.title | A Branch and Bound Algorithm to Minimize the Total Family Tardiness for Job Shop Scheduling with Job Families | - |
| dc.type | Article | - |
| dc.publisher.location | 대한민국 | - |
| dc.identifier.bibliographicCitation | Proceedings of the International Symposium on Green Manufacturing and Applications, v.2013, pp 1 - 4 | - |
| dc.citation.title | Proceedings of the International Symposium on Green Manufacturing and Applications | - |
| dc.citation.volume | 2013 | - |
| dc.citation.startPage | 1 | - |
| dc.citation.endPage | 4 | - |
| dc.type.docType | Proceeding | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | foreign | - |
| dc.identifier.url | http://2013.isgma.org/ | - |
- Files in This Item
- Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Lee, Dong Ho
- COLLEGE OF ENGINEERING (DEPARTMENT OF INDUSTRIAL ENGINEERING)