Optimal versus heuristic scheduling of surface mount technology lines

The hybrid flow shop scheduling problem

“…A simplistic GA approach was proposed in [219] for an HFS with machine eligibility constraints and makespan criterion. The same SMT circuit board flexible flow line studied in [148,149] has been studied more recently in [91], where a mathematical programming based solution approach, dispatching rules and a TS algorithm are proposed. Very recently, a memetic algorithm (GA with embedded local search) was proposed for a similar problem [191].…”

“…F Hm, ((P M (k) ) m k=1 ))|avail|several simulation, heuristics, SA [16] F H3, ((P M (k) ) 3 k=1 ))||Cmax agent-based approach [20] F Hm, ((P M (k) ) m k=1 ))|recrc|Ū w MPF, GA, lower bounds,checks processing [47] F Hm, ((P M (k) ) m k=1 ))||Cmax Artificial Immune Systems [91] F Hm, ((P M (k) ) m k=1 ))|blocking, skip|Cmax flow lines, MPF, TS, huristics F H2, ((1 (1) , P 2 (2) ))||Cmax B&B, GA, heuristics [41] F Hm, ((P M (k) ) m k=1 ))|recrc|T w dispatching rules, heuristics [61] F H2, ((1 (1) , P 2 (2) ))|no − wait, (p j = 1) 1 |Cmax exact method [96] F Hm, ((P M (k) ) m k=1 ))||{Cmax,C} review on exact solution methods [121] F H2, ((1 (1) , P M (2) ))|avail|Cmax B&B, heuristics, complexity [38] F H3, ((RM (k) ) 3 k=1 ))|prec, block, S nsd |Cmax MPR-TS [70] F H2, ((P M (k) ) 2 k=1 )||Cmax B&B [88] F Hm, ((P M (k) ) m k=1 ))||Cmax MPR-SA, lower bounds [107] F H2, ((P 2 (1) , 1 (2) ))|batch|Cmax TSP-based heuristics [37] F H3, ((RM (k) ) 3 k=1 ))|S sd , block, prec|Cmax MPF, lower bounds, TS [50] F Hm, ((P M (k) ) m k=1 ))|assign|ĒT TS, special problem [83] F Hm, ((P M (k) ) m k=1 ))|r j |Cost TS, SA, heuristics [85] F Hm, ((RM (k) ) m k=1 ))|lot, skip|Cost GA, SA, flow lines [100] F H3, ((P M (k) ) 3 k=1 ))||Cmax heuristics [151] (1) , P 2 (2) ))|assembly (2) |F heuristics [195] F Hm, ((P M (k) ) m k=1 ))|size jk |Cmax Particle Swarm Optimization [196] F H2, ((1 (1) , P 2 (2) ))|skip (1) |Cmax heuristics 2009 [90] F Hm, ((RM (k) ) m k=1 ))|S sd , r j |αCmax + (1 − α)Ū MPF, heuristics, dispatching rules, GA [95] F H2, ((P M (1) , 1 (2) ))||Cmax heuristics, product-mix [191] F Hm, ((P M (k) ) m k=1 ))|skip, block, reentry|Cmax GA mixed with LS [229] F Hm, ((P M (k) ) m k=1 ))|size jk |Cmax Iterated Greedy (IG) [19] F H2, ((P M (1) , P M (2) ))|batch (2) |Cmax heuris...…”

A New Mathematical Model for Flexible Flow Lines with Blocking Processor and Sequence-Dependent Setup Time

“…He tested the model for small-sized problems (e.g., five stages and ten jobs). Kaczmarczyk et al, (2004) proposed a new mixed integer programming formulation for general or batch scheduling in SMT lines with continuous or limited machine availability. Their formulation is an improved version of the model presented by Sawik (2001), incorporating new cutting constraints on decision variables.…”

A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing

“…However, recent advances in integer programming have resulted in commercial software that can handle large mixed integer programs and find a proven optimal solution within a reasonable computation time, in particular if a strong formulation is applied, e.g., Kaczmarczyk et al (2004) and Sawik (2005).…”