 |
Park, Jung Hyeon (박중현)
Email:
Research Area:
Occupation: 현대오토에버(Hyundai AutoEver)
2013 M.S. Graduation Thesis:
Scheduling Algorithms for Job Shops with Job Families and Sequence-Dependent Setup Times: Minimizing the Total Family Flow Time
This thesis considers job shop scheduling in which jobs are grouped into job families, but they are processed individually. As an extension of the previous study, we consider sequence-dependent setups, i.e., setup times depend on the type of job just completed and the next job to be processed. This type of job shop scheduling can be found in various manufacturing systems, especially in remanufacturing systems with disassembly, reprocessing and reassembly shops. In other words, the reprocessing shop can be regarded as the job shop with job families since it performs the operations required to bring parts or sub-assemblies disassembled back to like-new conditions before reassembling them. To minimize the deviations of the job completion times within each job family, we consider the objective of minimizing the total family flow time. Here, the family flow time implies the maximum among the completion times of the jobs within a job family. To describe the problem mathematically,
a mixed integer programming model is suggested, and then, due to the complexity of the problem, we suggest two iterated greedy algorithms with different neighborhood generation methods. Computational experiments were done using benchmark instances, and the results are reported.
Lab Seminars:
| 1. |
Job shop scheduling with separable sequence-dependent setups. |
2011.8.3 |
| 2. |
Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times. |
2011.8.23 |
| 3. |
Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times. |
2011.7.12 |
|
