COVERT Based Algorithms for Solving the Generalized Tardiness Flow Shop Problems
Authors
Abstract:
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. The efficiency of the developed algorithms is then tested through extensive computational experiments and the results will be presented.
similar resources
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
full textA Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
full textHybrid metaheuristic algorithms for the tardiness blocking flow shop problem
This paper proposes an Iterated Local Search (ILS) procedure and an Iterated Greedy (IG) algorithm, which are both combined with a variable neighbourhood search (VNS), for dealing with the flow shop problem with blocking, in order to minimize the total tardiness of jobs. The structure of both algorithms is very similar, but they differ in the way that the search is diversified in the space of s...
full textA Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
full textAlgorithms for Solving the Independent. Flow Problems
Given a capacitated network with the entrance· vertex set VI and the exit-vertex set V2 on which polymatroids are defmed, an independent flow is a flow in the network such that a vector corresponding to the supplies in VI and a vector corresponding to the demands in V2 are, respectively, independent vectors of the polymatroids on VI and V2 • The independent-flow problems considered in the prese...
full textGenetic Algorithms for Solving Open Shop Scheduling Problems
In this paper we investigate the use of three evolutionary based heuristics to the open shop scheduling problem. The intractability of this problem is a motivation for the pursuit of heuristics that produce approximate solutions. This work introduces three evolutionary based heuristics, namely, a permutation genetic algorithm, a hybrid genetic algorithm and a sellsh gene algorithm, and tests th...
full textMy Resources
Journal title
volume 2 issue 3
pages 197- 213
publication date 2008-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023