We are interested in this paper in solving a multiobjective hybrid flowshop scheduling problem (HFS). The problem has different parameters and constraints such as release dates, due dates and sequence dependent setup times. Two different objectives should be optimized at once: the makespan and the total tardiness to be minimized. To solve the problem, we have developed two versions of a new dec...

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

Abstract This paper addresses a multi-objective energy-efficient scheduling problem of the distributed permutation flowshop with sequence-dependent setup time and no-wait constraints (EEDNWFSP), which have important practical applications. Two objectives minimization both makespan total energy consumption (TEC) are considered simultaneously. To address this problem, new mixed-integer linear pro...

We consider a real-life problem of scheduling clients orders in the production of concrete blocks in a factory of building industry. This problem can be modelled as a hybrid ̄ow shop scheduling problem with mixed no-wait/no-store constraints and mixed bottleneck/non-bottleneck machines. The objective function is to minimize maximum completion time. To solve the problem, we propose an approximat...

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