The problem of m-machine permutation flowshop scheduling is considered in this paper. The objective is to minimize the makespan. The flowshop scheduling problem is a typical combinatorial optimization problem and has been proved to be strongly NP-hard. Hence, several heuristics and meta-heuristics were addressed by the researchers. In this paper, a discrete African wild dog algorithm is applied...

In this paper, we address a two-stage hybrid flowshop scheduling problem with identical parallel machines in each stage. The assumes that the queue (Q)-time for job, which represents waiting time to be processed current stage, must limited predetermined threshold due quality concerns final product. This is motivated by one occurs real field, especially diffusion workstation of semiconductor fab...

This paper deals with the non-permutation flowshop problem which means that the job sequences are allowed to be different on machines. The objective function is minimizing the total tardiness. Firstly, three mixed-integer linear programming (MILP) models for non-permutation flowshop problems are described, and then are analyzed and assessed their relative effectiveness. Secondly, two Tabu searc...

The issue of sequencing and scheduling has received considerable critical attention in many fields since the early 1950s. In this research, we studied an important production scheduling system, which generally called flexible (or hybrid) flowshop scheduling problem (FFSP or HFSP). We studied this production system with an important restriction called the no-wait. The objective was to optimize t...

This paper addresses the Permutation Flowshop Problem with minimization of makespan, which is denoted by F |prmu|Cmax . In the permutational scenario, the sequence of jobs has to remain the same in all machines. The Flowshop Problem (FSP) is known to be NP-hard when more than three machines are considered. Thus, for medium and large scale instances, highquality heuristics are needed to find goo...