A new heuristic for the n-job, M-machine flow-shop problem

Review on Job-Shop and Flow-Shop Scheduling Using

“…Many algorithms in the literature have been proposed that do not explicitly consider many objectives as in previous sections. For example, Ho and Chang 65 propose a heuristic that is specifically devised for minimizing machine idle time in a m machine flow-shop. Although the heuristic does not allow for setting weights or threshold values and does not work with the Pareto approach either, the authors test it against a number of objectives.…”

“…Along with the SA method, two heuristics are also studied. Rajendran 67 proposes a heuristic for the same problem dealt with in Ho and Chang 65 . After a comprehensive numerical experimentation, the new proposed heuristic is shown to be superior to that of Ho and Chang's.…”

Simulated Annealing as an Intensification Component in Hybrid Population-based Metaheuristics

“…This problem is NP-hard in the strong sense (Garey et al, 1976) for m≥3 and only instances of limited size can be solved by exact solution methods in an acceptable computation time. Therefore numerous heuristics approaches have been proposed in the literature, among which constructive heuristics (e.g., (Palmer, 1965), (Campbell et al, 1970), (Taillard, 1990)) improvement heuristics (e.g, (Ho & Chang, 1991), (Woo & Yim, 1998), (Suliman, 2000)) and metaheuristics as SA ( (Osman & Potts, 1989), (Ishibuchi et al, 1995)), TS ( (Nowicki & Smutnicki, 1996), (Grabowski and Wodecki, 2004)), GA ( (Reeves, 1995), (Ruiz et al, 2006)), ACO ( (Rajendran & Ziegler, 2004)) and PSO algorithms ( , (Lian et al, 2006a), (Tasgetiren et al, 2007), (Jarboui et al, 2007)), some of which are taken as reference for the performance evaluation of the PSO-SA proposed in the following.…”

Scheduling flexible flow lines with sequence-dependent setup times

“…Partial sequences are created by choosing to place the job under consideration in the position relative to the current sequence (before or after each job) that minimizes the makespan thus far. Ho and Chang (1991) also used an algebraic approach based on the observation that the makespan is increased by gaps between processing of jobs on consecutive machines. They use a measure of this gap to select jobs to be exchanged in the schedule and keep the exchange if the makespan is reduced.…”