[ WINTER 2015]
| 1. | Entropy as a measure of operational flexibility.  | 02.04 |
Doh, Hyoung Ho - Ph.D
| 1. | GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. | 01.13 |
Irene Huang - M.S
| 1. | Scheduling a hybrid assembly-differentiation flow shop to minimize total flow time | 01.21 |
Kim, Hyung Won - Ph.D
| 1. | Evolutionary sequence planning for selective disassembly in de-manufacturing. | 01.13 |
Kim, Jong Min - M.S
| 1. | Two-stage flow-shop scheduling problem with non-identical second stage assembly machines. | 01.21 |
Shin, Jeong Hoon - Ph.D
| 1. | Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine. | 01.26 |
| 2. | Two Single Machine Sequencing Problems Involving Controllable Job Processing Times. | 02.12 |
| 3. | Single-machine sequencing with controllable processing times. | 02.24 |
Yu, Jae Min - Ph.D
| 1. | Tardiness minimization on parallel machines. | 01.23 |
[ SUMMER 2015]
| 1. | An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs. | 06.30 |
Jang, Kyung Cheol - M.S
| 1. | Cooperative capacity planning and resource allocation by mutual Outsourcing using ant algorithm in a decentralized supply chain. | 07.24 |
| 2. | A closed-loop logistics model for remanufacturing. | 08.04 |
Joo, Ga Hyeon - M.S
| 1. | Heterogeneous fixed fleet vehicle routing considering carbon emission. | 08.26 |
Shin, Jeong Hoon - Ph.D
| 1. | Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness. | 07.16 |
| 2. | Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis. | 08.04 |
| 3. | Single machine scheduling with discretely controllable processing times. | 08.18 |
Zhou YIdong - M.S
| 1. | A branch-and-bound algorithm for solving a twomachine flow shop problem with deteriorating jobs. | 7.02 |
| 2. | A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. | 7.23 |
| 3. | An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. | 8.13 |
| 4. | An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan. | 8.25 |