This paper addresses a hybrid flow shop scheduling problem with real-world constraints, and proposes a novel algorithm for its solution. We first discuss the distinguishing characteristics of nighttime and simultaneous work in the transformer manufacturing process. To solve the problem within a reasonable time, we propose a hybrid genetic algorithm. This algorithm combines the Nawaz–Enscore–Ham...

This paper studies the generalized normal distribution algorithm (GNDO) performance for tackling permutation flow shop scheduling problem (PFSSP). Because PFSSP is a discrete and GNDO generates continuous values, largest ranked value rule used to convert those values into ones make applicable solving this problem. Additionally, effectively integrated with local search strategy improve quality o...

Permutation flow-shop scheduling is the strategy that ensures processing of jobs on each subsequent machine in exact same order while optimizing an objective, which generally minimization makespan. Because its NP-Complete nature, a substantial portion literature has mainly focused computational efficiency and development different AI-based hybrid techniques. Particle Swarm Optimization (PSO) al...

in this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. single supplier via a flexible flow line production system (ffl) produces several items and delivers them directly to an assembly facility. based on basic period (bp) strategy, a new mixed zero-one nonlinear programming model has been develope...

scheduling of production in flexible manufacturing systems (fmss) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. the generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. genetic algorithms are used in this paper to obtain an initial...

In this work, multicriteria decision making objective for flow shop scheduling with sequence dependent set up time and due dates have been developed. Multicriteria decision making objective includes total tardiness, total earliness and makespan simultaneously which is very effective decision making for scheduling jobs in modern manufacturing environment. As problem of flow shop scheduling is NP...

The distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint must be considered. To the best of our knowledge, this variant of the distributed permutation flow shop scheduling problem has not been studied. In this working paper, we sh...

The family scheduling problems involve multiple job types where jobs are classified into specific families by their similarity characteristics. Within this class of problems, the single machine family scheduling problem to minimize total tardiness is at least binary NP-Hard. In this paper, we consider the case where jobs in the same family need not be processed together and develop a hybrid gen...