Discrete Fruit Fly Algorithm for Multi-Objective No-Wait Flow Shop Scheduling Problem
Abstract
No abstract recorded for this item.
Similar items
Genetic Algorithm with Selective Local Search for Multi-objective Permutation Flow Shop Scheduling Problem
In this paper the flow shop scheduling problem with minimizing two criteria simultaneously is consider. Selected criteria are: makespan and the sum of tardiness of jobs. For each separate criteria the problem is strongly NP-hard, which makes it NP-hard as well. There is a number
Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates
We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problem
Fuzzy Multi-objective Permutation Flow Shop Scheduling Problem with Fuzzy Processing Times under Learning and Aging Effects
In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it i
Multi-Objective Memetic Search Algorithm for Multi-Objective Permutation Flow Shop Scheduling Problem
An energy-efficient multi-objective permutation flow shop scheduling problem using an improved hybrid cuckoo search algorithm
An Improved Genetic Algorithms for Multi-objective Hybrid Flow-shop Scheduling Problem