Rasaratnam Logendran

TL;DR: A classification scheme that categorizes the literature on APP since early 1950 is presented, summarizing the various existing techniques into a framework depending upon their ability to either produce an exact optimal or near-optimal solution.

TL;DR: A methodology for minimizing the weighted tardiness of jobs in unrelated parallel machining scheduling with sequence-dependent setups is presented and the use of a specific search algorithm led to identifying solutions of better quality or that required lower computation time, but not both.

TL;DR: Group scheduling within the context of sequence dependent setup times in flexible flow shops is considered, and the search algorithm that uses short term memory is recommended for problems of all sizes and levels of flexibility.

TL;DR: In this paper, the cell formation problem of determining the assignment of parts and machines to each manufacturing cell can be viewed as being divided into two phases, where the first phase deals with the number of machines of each type and a unique process plan for each part.

TL;DR: The results show that for small and medium size problems whether or not a computationally more demanding algorithm is employed to solve the level 1 or level 2 problem does not have any bearing on the makespan, but the situation changes dramatically when large size problems are attempted, as a single-setup algorithm which combines the use of single- and multiple-pass heuristic for the level 2 and level 1 problems outperforms another single- setup algorithm with the order of use reversed at all levels of flexibility.