A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation

To evaluate the accuracy of the proposed model, we explore several scenarios with different values of various network parameters, such as the IEEE 802.11 standard, the mean

For each instance, we give the best found lower (LB1) and upper (UB1) bounds, the total number of branch and bound nodes (#nodes), the total CPU time in seconds (CPU), the initial

This paper introduces a new algorithm to deal with the packing problem on cellular automata of di- mension 2 in linear time complexity; which means O(n) for an input square picture

As said in the introduction of their paper, [24, Algorithm 1] is “a suitable adapta- tion of the half-gcd algorithm”: a call to their algorithm uses polynomial multiplication

In [14], a Genetic Algorithm (GA) was proposed to solve the multi-purpose machine (MPM) scheduling problem with fixed non-crossable unavailable periods in a job shop environment

(Dhouib et al., 2012.) studied the permutation flowshop scheduling problem with sequence dependent setup times and time lags constraints of successive operations

Wang and Cheng [45] studied the two-machine flow shop scheduling problem where setup times could be anticipated, an unavailability period is considered only one of the machines and

disjunctive precedence (being able to be realized by the same resource). We cannot obtain an infeasible solution since we respect the precedence and disjunctive constraints. - In