A neuro-tabu search heuristic for the flow shop scheduling problem

Fractional Programming

“…In the case of directed planar graphs, H. Stamm [86] presented an O(|V(G)|log |V(G)|)approximation algorithm, whose performance guarantee is bounded by the maximum degree of the graph and an O(|V(G)| 2 ) time approximation algorithm with performance guarantee no more than the number of cyclic faces in the planar embedding of the graph minus 1. M. Cai, X. Deng, and W. Zang [10] obtained a 2.5-approximation algorithm for the minimum feedback vertex set problem on tournaments, improving the previously known algorithm with performance guarantee of 3 by E. Speckenmeyer [85].…”

“…The feedback arc set problem in planar digraphs is reducible to the problem of finding a minimum-weight dijoin in the dual graph, which is solvable in polynomial time [39]. Stamm [86] proposed a simple 2-approximation algorithm for the minimum weight dijoin problem by superposing two arborescences. It is interesting to observe that, when translated to the dual graph, all these problems lead to problems of hitting certain cutsets of the dual graph, problems which can be approximated within a ratio of 2 by the primal-dual method.…”

No-wait flow shop scheduling using fuzzy multi-objective linear programming

“…We refer to this as flow shop environment. Emergence of advanced manufacturing systems such as computer-aided design/computer-aided manufacturing (CAD/CAM), flexible manufacturing system (FMS), and computer-integrated manufacturing (CIM) have increased the importance of flow shop scheduling [1].…”

“…In flow shop scheduling, the processing routes are the same for all the jobs [1]. In the permutation flow shop, passing is not allowed.…”

Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm

“…Grabowski and Wodecki (2004) proposed a tabu search based algorithm for the permutation flow shop problem with makespan criterion. Solimanpur et al (2004) proposed a neural networks-based tabu search method for the flow shop scheduling problem which in the objective is to minimize makespan. Wang et al (in press) dealt with a two machine flow shop scheduling problem with deteriorating jobs which in they minimized total completion time.…”