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

The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...

The paper describes an algorithm for solving the scheduling problem of a hybrid flowshop (flowshop with multiple processors, FSMP). The algorithm is a combination of genetic algorithm and tabu search, and the batch processes it is applied on are modeled by a model of time requirements. The paper describes the algorithm and compares its performance with other optimization techniques.

A hybrid Taguchi-based genetic algorithm (HTGA) is developed for solving multi-objective flowshop scheduling problems (FSPs). Search performance is improved by using Taguchi-based crossover to avoid scheduling conflicts, and dynamic weights are randomly selected by a fuzzy inference system. The conventional approach to selecting dynamic weights randomly ignores small value for the objective whe...

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

In bakery production, to perform a processing task there might be multiple alternative machines that have the same functionalities. Finding an efficient production schedule is challenging due significant nondeterministic polynomial time (NP)-hardness of problem when number products, tasks, and are higher. addition, many tasks performed manually as small medium-size bakeries not fully automated....