Browse "IE-Journal Papers(저널논문)" by Subject makespan
Showing results 1 to 6 of 6
| A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints Joo, Byung Jun; Kim, Yeong-Dae, JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.60, pp.572 - 582, 2009-04 |
| An optimal solution algorithm for a batch-processing machine scheduling problem with a product-mix ratio constraint Joo, BJ; Kim, Yeong-Dae, INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, v.14, pp.198 - 202, 2007-06 |
| Makespan Analysis of Lot Switching Period in Cluster Tools Lee, Jun-Ho; Kim, Hyunjung, IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, v.29, no.2, pp.127 - 136, 2016-05 |
| Mimixizing Makespan on a Single Burn-In Oven with Job Families and Dynamic Job Arrivals Allowed Sung, Chang Sup, COMPUTERS & OPERATIONS RESEARCH, v.29, no.8, pp.995 - 1007, 2002-07 |
| Minimizing Makespan on a Single Burn-in Oven in Semiconductor Manufacturing Sung, Chang Sup, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.120, no.3, pp.559 - 574, 2000-02 |
| Optimal Scheduling of Transient Cycles for Single-Armed Cluster Tools With Parallel Chambers Kim, Dae-Kyu; Lee, Tae-Eog; Kim, Hyunjung, IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, v.13, no.2, pp.1165 - 1175, 2016-04 |
Discover
Open Access
- 55 OA Article