This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...

We study flowshop scheduling problems with respect to slack due window assignments, which are operations in jobs assigned an individual window. We combine learning effect and controllable processing times, the has a two-machine no-wait setup. The goal is determine job sequence, based on common flow allowance, size, resource allocation. provide bicriteria analysis fo...

Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. Two last cases can lead to blocking situations. In flowshop scheduling literature, many studies and research were realized about classical flowshop problem and also about some problems with only one blocking situation. This paper deals with makespan minimization in flowshop schedulin...

In the field of scheduling, the flowshop problems have been thoroughly studied over the last six decades. In this paper we propose a concise overview of flowshop scheduling techniques evolved during this period. We surveyed the exact, heuristics and metaheuristics methods for solving various flowshop scheduling problems. As a result various optimization techniques, solution procedures are avail...

Minimizing the total completion time (TCT) is essential in numerous manufacturing settings. Since such a problem considered NP-hard, it not likely that an optimal solution exists. Accordingly, many papers scheduling literature look for dominance relation as to minimizing TCT. Furthermore, due wide range of unpredictability settings, consider settings with uncertain and bounded setup times. None...

This paper addresses the multistage hybrid flow shop (HFS) scheduling problems. The HFS is the special case of flowshop problem. Multiple parallel machines are considered in each stage in the HFS. The HFS scheduling problem is known to be strongly NPhard. Hence, many researchers proposed metaheuristic algorithms for solving the HFS scheduling problems. This paper develops a bat algorithm (BA) t...