New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem

2016 ◽  
Vol 74 ◽  
pp. 165-174 ◽  
Author(s):  
Hamid Abedinnia ◽  
Christoph H. Glock ◽  
Andreas Brill
Keyword(s):  
Heuristic Algorithms ◽  
Flow Time ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Total Flow ◽  
Permutation Flowshop ◽  
Total Flow Time ◽  
Constructive Heuristic ◽  
Flowshop Scheduling Problem

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