Mathematical modelling and a meta-heuristic for flexible job shop scheduling

Solving the flexible job-shop just-in-time scheduling problem with quadratic earliness and tardiness costs

“…Mixed-integer linear programming models are confined to small-and medium-size instances (i.e., eight jobs and seven machines), and mainly for regular criteria such as makespan minimization [20]. To overcome this deficiency and to obtain solutions for real industrial problems, heuristic, meta-heuristic, and artificial intelligence techniques are more suitable for solving the FJSSP [15].…”

Flexible job-shop scheduling problem with resource recovery constraints

“…Mixed integer linear programming models for the FJSP have been proposed by Roshanaei et al [152], Demir and İşleyen [55], Yulianty and Ma'ruf [194], and Shen and Yao [163]. Although, due to the complexity of the problem, mainly metaheuristics have been investigated.…”

Multi-Objective for a Partial Flexible Open Shop Scheduling Problem Using a Priority-Based Evolutionary Algorithm

“…[6] 2002 FOSP SA + PDR Schrich et al [71] 2004 FOSP TS + PDR Ho et al [37] 2007 FOSP EA + PDR Liouane et al [52] 2007 FOSP TS + AC Fattahi et al [24] 2007 FOSP TS + SA Pezzella et al [66] 2008 FOSP EA + AL + PDR Moradi et al [57] 2010 FOSP EA + PDR Bozejko et al [10] 2010 FOSP TS + IA Xing et al [80] 2011 FOSP EA + AC Al-Hinai and ElMekkawy [2] 2011 FOSP EA + LS Karimi et al [44] 2012 FOSP VNS Roshanaei et al [70] 2013 FOSP AIS + SA Yuan and Xu [82] 2013 FOSP DEA + LS Wang et al [78] 2013 FOSP EA Farughi et al [23] 2013 FOSP EA + CPM Yuan and Xu [83] 2013 FOSP HSA + LNS Yuan et al [85] 2013 FOSP HSA + LS Mousakhani [60] 2013 FOSP ILS Ziaee [88] 2014 FOSP Meta-Heuristic Driss et al [20] 2015 FOSP EA Within a searching process in random, Moradi et al [57] used a learnable EA to prove FOSP with preventive maintenance activities and the composite dispatching rule to produce population. Tay and Ho [75] used a composite dispatching rule generated for Evolution programming.…”

“…The proposed model already has better results in terms of both size and computational complexities than to the model from the literature. Roshanaei et al [70] developed the two MIP models for PFOSP to reduce the total make span. To solve the large size instances, meta-heuristic hybridizing artificial immune and simulated annealing algorithms are developed.…”