@article{kang_albey_uzsoy_2018, title={Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior}, volume={100}, ISSN={["1873-765X"]}, url={https://doi.org/10.1016/j.cor.2018.07.019}, DOI={10.1016/j.cor.2018.07.019}, abstractNote={We present heuristics for solving a difficult nonlinear integer programming (NIP) model arising from a multi-item single machine dynamic lot-sizing problem. The heuristic obtains a local optimum for the continuous relaxation of the NIP model and rounds the resulting fractional solution to a feasible integer solution by solving a series of shortest path problems. We also implement two benchmarks: a version of the well-known Feasibility Pump heuristic and the Surrogate Method developed for stochastic discrete optimization problems. Computational experiments reveal that our shortest path based rounding procedure finds better production plans than the previously developed myopic heuristic and the benchmarks.}, journal={COMPUTERS & OPERATIONS RESEARCH}, author={Kang, Yongha and Albey, Erinc and Uzsoy, Reha}, year={2018}, month={Dec}, pages={54–65} }
 @article{kang_kim_shin_2010, title={A dispatching algorithm for parallel machines with rework processes}, volume={61}, ISSN={["1476-9360"]}, DOI={10.1057/jors.2008.148}, abstractNote={This paper presents a parallel machine scheduling problem with rework probabilities, due-dates and sequence-dependent setup times. It is assumed that rework probability for each job on a machine can be given through historical data acquisition. Since the problem is NP-hard in the strong sense, a heuristic algorithm is presented, which finds good solutions. The dispatching algorithm named MRPD (minimum rework probability with due-dates) is proposed in this paper focusing on the rework processes. The performance of MRPD is measured by the six diagnostic indicators: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of reworks and the number of tardy jobs. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems.}, number={1}, journal={JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY}, author={Kang, Y. H. and Kim, S. S. and Shin, H. J.}, year={2010}, month={Jan}, pages={144–155} }
 @article{shin_kang_2010, title={A rework-based dispatching algorithm for module process in TFT-LCD manufacture}, volume={48}, ISSN={["1366-588X"]}, DOI={10.1080/00207540802471264}, abstractNote={This paper presents development of a scheduling methodology for module processing in thin film transistor liquid crystal display (TFT-LCD) manufacturing. The problem is a parallel machine scheduling problem with rework probabilities, sequence-dependent setup times and due dates. It is assumed that rework probability for each job on a machine can be given through historical data acquisition. The dispatching algorithm named GRPD (greedy rework probability with due-dates) is proposed in this paper focusing on the rework processes. The performance of GRPD is measured by the six diagnostic indicators. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems.}, number={3}, journal={INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, author={Shin, Hyun Joon and Kang, Yong Ha}, year={2010}, pages={915–931} }
 @article{kang_shin_2010, title={An adaptive scheduling algorithm for a parallel machine problem with rework processes}, volume={48}, ISSN={["1366-588X"]}, DOI={10.1080/00207540802484903}, abstractNote={The development of a scheduling methodology for a parallel machine problem with rework processes is presented in this paper. The problem is to make a schedule for parallel machines with rework probabilities, due-dates, and sequence dependent setup times. Two heuristics are developed based on a dispatching algorithm and problem-space-based search method. In order to evaluate the efficacy of the proposed algorithms, six performance indicators are considered: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of tardy jobs, and the number of reworks. This paper shows how these algorithms can adaptively capture the characteristics of manufacturing facilities for enhancing the performance under changing production environments. Extensive experimental results show that the proposed algorithms give very efficient performance in terms of computational time and each objective value.}, number={1}, journal={INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, author={Kang, Yong Ha and Shin, Hyun Joon}, year={2010}, pages={95–115} }