Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Abstract

This paper deals with a permutation flowshop scheduling problem with blocking constraints. To minimise the makespan, it uses a branch-and-bound algorithm. A new lower bound is developed for the problem based upon the two machine-subproblem relaxation. Computational tests show the superiority of the proposed algorithm.Keywords: scheduling; blocking flowshop; lower bound; makespan.Reference to this paper should be made as follows: Toumi, S., Jarboui, B., Eddaly M. and Rebaï, A. (2017) 'Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion', Int.

Solving Constrained Flow-Shop Scheduling Problem through Multistage Fuzzy Binding Approach with Fuzzy Due Dates

“…Step 7: modify the processing time all in Table 7, except the one in Step 6, for job 2 and job 5, respectively. Q 2 : (30, 30, 30, 30, 30) to (33,34,35,36,37) and P 1 : (17,17,17,17,17) to (30,31,32,33,34); the break down is started in between, and 3 is added to the PCF processing time. e new PQF processing times become Q 2 � (6, 7, 8, 9, 10), 16,17,18,19,20).…”

“…Accordingly, Table 9 changes to Table 10 as follows. Advances in Fuzzy Systems (30,30,30,30,30) to (33,34,35,36,37) P 1 (17,17,17,17,17) to (30,31,32,33,34) P 1 (34,34,34,34,34) to (46, 47, 48, 49, 50) P 2 (37,37,37,37,37) to (44,45,46,47,48) (34,34,34,34,34) to (35,36,37,38,39) - e total PQF elapsed time and the weight flow by the proposed method is less than comparing to the ones obtained by angaraj and Rajendran [38]. All the calculations are entertained by MATLAB 2020a under Windows 10. e CPU frequency of the computer is 2.3 GHz, and the memory size is 8 GB.…”

“…Yang et al [16] studied the FS scheduling of many production lines for precast production. Toumi et al [17] presented the branch-and-bound technique for the solution of blocking FS scheduling problem under the assumption of makespan criterion. Yu et al [18] presented the iterative method for batching and scheduling problem for the minimization of total job tardiness in two-stage hybrid FS.…”

Research on phased scheduling algorithm based on multilevel fuzzy binding

“…Multiobjective FS scheduling of prefabricated assembly lines was studied by Yang et al [13] . A branch-and-delimitation procedure for the solution of hindered FS scheduling problems under the criterion of maximum makespan was proposed by Toumi et al [14] . In order to minimise the total makespan, Yu et al [15] proposed an iterative approach to batch processing and scheduling in a two-stage hybrid FS.…”

“…(0,0,0,0,0) to (13,14,15,16,17) (17,17,17,17,17) to (18,19,20,21,22) (22,22,22,22,22) to (25,26,28,29,30) (30,30,30,30,30) to (33,34,35,36,37) (37,37,37,37,37) to (44,45,46,47,48) (1,2,3,4,5) 5 (17,17,17,17,17) to (30,31,32,33 Therefore, the optimal sequence in the fuzzy environment is…”