Flow Shop Scheduling Problem (FSSP) has significant application in the industry, and therefore it been extensively addressed literature using different optimization techniques. Current research investigates Permutation (PFSSP) to minimize makespan Hybrid Evolution Strategy (HES SA ). Initially, ...

To effectively solve the permutation flow-shop scheduling problem (PFSP), an adaptive dynamic neighborhood crow search algorithm (AdnCSA) is proposed to minimize makespan. Firstly, a modified heuristic based on nawaz-enscore-ham (NEH) was improve quality and diversity of initial population. Secondly, smallest-position-value (SPV) rule used encode population so that it can handle discrete proble...

Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....

Abstract The distributed manufacturing has become a prevail production mode under the economic globalization. In this article, memetic discrete differential evolution (MDDE) algorithm is proposed to address permutation flow shop scheduling problem (DPFSP) with minimization of makespan. An enhanced NEH (Nawaz–Enscore–Ham) method presented produce potential candidate solutions and Taillard’s acce...

Based on a triple bottom line concept, sustainable development is characterized by the simultaneous pursuit of economic, environmental and social goals. The implementation this concept in production scheduling can result resolution Distributed Permutation Flow Shop Scheduling Problem (DPFSP). present study conceptually shifts an energy-efficient DPFSP to DPFSP, simultaneously contributing impro...

Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...

Despite the large amount of work performed on flow-shop scheduling most of the research has concentrated on the permutation problem in which passing is not allowed. In this work the general flow-shop problem, in which passing is allowed, is dealt with as it is considered to be a better representation of flowshop instances. The evolutionary techniques of scatter search (SS) and its generalised f...