Minimum makespan scheduling of Flow Shops with Multiple Processors (FSMPs), also known as the Hybrid Flow Shop (HFS), is classified as NP complete. Thus, the FSMP largely depends on strong heuristics to develop solutions to makespan scheduling instances. An FSMP consists of m stages wherein each stage has one or more processors through which n jobs are scheduled. This paper presents a heuristic...

This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better transmit temporal relationships in the schedule. The approach produced excellent results on standard benchmark job shop scheduling problems. We further tested many models and scales of parallel GAs in the context of job shop...

The distributed assembly scheduling problem with a hybrid-flow shop for fabrication is seldom studied, and some real-life constraints such as factory eligibility are handled. In this study, shop-scheduling (DAHFSP) investigated, which has symmetries on machines. A shuffled frog-leaping algorithm cooperations (CSFLA) applied to minimize makespan. problem-related feature used. Memeplexes evaluate...

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

This paper addresses the application of AI techniques in a practical OR problem , i.e. scheduling. Scheduling is a scientific domain concerning the allocation of tasks to a limited set of resources over time. The goal of scheduling is to maximize (or minimize) different optimization criteria such as the makespan (i.e. the completion time of the last operation in the schedule), the occupation ra...

A constraint programming based branch-and-bound algorithm is embedded into a memetic algorithm to solve multiprocessor task scheduling problem in hybrid flow-shop environments. Both methods are able to solve the problem by themselves but the combination of the two allows to solve larger problem in a shorter amount of time. Computational experiments are conducted on a large set of instances and ...

In this paper, an algorithm based on particle swarm optimization is proposed, for hybrid flow shop scheduling problem, to minimize the makespan. First an effective new approach using two decisions based on parallel priority dispatching rules is applied. Next we develop an hybridizing DPSO, that presents new components to updating velocity and position using genetic operators, with an adaptive n...