We study a 2-machine flowshop in which all processing times are independently and identically distributed, with values known to the scheduler. We are able to describe in detail the expected behavior of the flowshop under optimal and under heuristic schedules. Our results suggest that minimizing makespan might be a superfluous objective: Scheduling the jobs randomly requires less information and...

This work presents a development of a capable-to-promise system for companies that operate under the hybrid make-to-order and maketo-stock strategy in a lot-sizing and flowshop environment. Proposed system simultaneously considers planning and scheduling processes in order to achieve the optimality. Optimisation engine is based on an advanced evolutionary algorithm. Information available in ERP...

This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively weighted convex sum of makespan and the number ...

A hybrid algorithm which combines particle swarm optimization (PSO) and iterated local search (ILS) is proposed for solving the hybrid flowshop scheduling (HFS) problem with preventive maintenance (PM) activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancin...

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 ...

Nowadays many industry consider an interval time as a due date instead of precise points in time. In this study, the hybrid flow shop scheduling problem with basic blocking constraint is tackled. Where jobs, if done within window, are deemed on Therefore, criterion to minimize sum weighted earliness and tardiness. This variant flowshop not investigated best our knowledge. we introduced new meta...

Flowshop scheduling deals with processing a set of jobs through a set of machines, where all jobs have to pass among machines in the same order. With the exception of minimizing a makespan on two machines, almost all other flowshop problems in a general setup are known to be computationally intractable. In this paper we study a special case of flowshop defined by additional machine dominance co...