While searching for suboptimal solutions for large-scale problems, it is critical to force search algorithms on promising regions. This paper presents genetic algorithms with search space reductions (RGAs) and their application to solving large-scale permutation flowshop problems. The reduced search spaces are defined by adding precedence constraints generated by heuristic rules. To balance bet...

This paper proposes an iterated greedy algorithm for solving the blocking flowshop scheduling problem for makespan minimization. Moreover, it presents an improved NEH-based heuristic, which is used as the initial solution procedure for the iterated greedy algorithm. The effectiveness of both procedures was tested on some of Taillard’s benchmark instances that are considered to be blocking flows...

The flexible flowshop problem is a well known and common challenge. Extended with unrelated parallel machines and especially with the dynamic aspect of distributed release times, the problem gets very ‘close to reality’. Triggered by the growing complexity of logistic systems, the paradigm of central planning is being shifted to decentralised control. As part of this, an autonomous control conc...

This paper proposes a heuristic algorithm, called list-based squeezing branch and bound algorithm, for solving a machine-fixed, machining-assembly flowshop scheduling problem to minimize makespan. The machine-fixed, machining-assembly flowshop consists of some parallel two-machine flow lines at a machining stage and one robot at an assembly stage. Since an optimal schedule for this problem is n...

This paper contains a complete and updated review of the literature for multiobjective flowshop problems which are among the most studied environments in the scheduling research area. No previous comprehensive reviews exist in the literature. Papers about lexicographical, goal programming, objective weighting and Pareto approaches have been reviewed. Exact, heuristic and metaheuristic methods h...

There are two main approaches, conservative and optimistic, for maintaining consistency in distributed network games. Under the conservative approach, players may experience network latency, depending on packet transfer delay caused by the send-and-wait and acknowledging processes. Under the optimistic approach, the processes do not wait for other players’ packets and advance to their own frame...