Heuristic Algorithms for Multistage Flowshop Scheduling Problem

1972 ◽  
Vol 4 (1) ◽  
pp. 11-18 ◽  
Author(s):  
Jatinder N. D. Gupta
Keyword(s):  
Heuristic Algorithms ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Flowshop Scheduling Problem

AN EVOLUTIONARY ALGORITHM FOR PURE FUZZY FLOWSHOP SCHEDULING PROBLEMS

2003 ◽  
Vol 11 (06) ◽  
pp. 655-669 ◽  
Author(s):  
G. CELANO ◽  
A. COSTA ◽  
S. FICHERA
Keyword(s):  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Shop Floor ◽  
Test Problems ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Due Dates ◽  
Flowshop Scheduling ◽  
Real Process ◽  
Flowshop Scheduling Problem

The pure flowshop scheduling problem is here investigated from a perspective considering me uncertainty associated with the execution of shop floor activities. Being the flowshop problem is NP complete, a large number of heuristic algorithms have been proposed in literature to determine an optimal solution. Unfortunately, these algorithms usually assume a simplifying hypothesis: the problem data are assumed as deterministic, i.e. job processing times and the due dates are expressed through a unique value, which does not reflect the real process variability. For this reason, some authors have recently proposed the use of a fuzzy set theory to model the uncertainty in scheduling problems. In this paper, a proper genetic algorithm has been developed for solving the fuzzy flowshop scheduling problem. The optimisation involves two different objectives: the completion time minimisation and the due date fulfilment; both the single and multi-objective configurations have been considered. A new ranking criterion has been proposed and its performance has been tested through a set of test problems. A numerical analysis confirms the efficiency of the proposed optimisation procedure.

Heuristics for an m-Machine Re-Entrant Permutation Flowshop with the Objective of Total Tardiness

2015 ◽  
Vol 752-753 ◽  
pp. 890-895 ◽  
Author(s):  
Seong Woo Choi
Keyword(s):  
Heuristic Algorithms ◽  
Total Tardiness ◽  
Computational Experiments ◽  
Test Problems ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Permutation Flowshop ◽  
Flowshop Scheduling Problem ◽  
Flowshop Problem

We focus on an m-machine re-entrant flowshop scheduling problem with the objective of minimizing total tardiness. In the re-entrant flowshop considered here, routes of all jobs are identical as in ordinary flowshops, but the jobs must be processed multiple times on the machines. We present heuristic algorithms, which are modified from well-known existing algorithms for the general m-machine flowshop problem or newly developed in this paper. For evaluation of the performance of the algorithms, computational experiments are performed on randomly generated test problems and results are reported.

A Hybrid Firefly - VNS Algorithm for the Permutation Flowshop Scheduling Problem

2019 ◽  
pp. 274-286
Author(s):  
Andromachi Taxidou ◽  
Ioannis Karafyllidis ◽  
Magdalene Marinaki ◽  
Yannis Marinakis ◽  
Athanasios Migdalas
Keyword(s):  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Permutation Flowshop ◽  
Flowshop Scheduling Problem
Sign in / Sign up

Export Citation Format

Share Document