A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times

  title={A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times},
  author={Shuaipeng Yuan and Tieke Li and Bai Lin Wang},
  journal={Expert Syst. Appl.},
An integrated scheduling algorithm for multi-device-processes with the strategy of exchanging adjacent parallel processes of the same device
Based on the scheduling scheme of MISATPS, the algorithm is improved by applying the interchange strategy and the interchange adjustment strategy of multi-device adjacent parallel process so that the influence of the pre-process on the post-process is avoided, the compactness of the serial process and the parallelism of the parallel process are improved, and the scheduling result is optimized.
Blocking flowshop scheduling problems with release dates
Parallel Makespan Calculation for Flow Shop Scheduling Problem with Minimal and Maximal Idle Time
  • J. Rudy
  • Computer Science, Business
    Applied Sciences
  • 2021
The experiments on the Taillard-based problem instances using a simulated annealing solving method and employing the parallel makespan calculation show that the method is able to perform many more iterations in the given time limit and obtain better results than the non-parallel version.


A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem
A new encoding scheme based on permutation representation is proposed to transform a random job permutation to a feasible permutation for GSPs.
A tabu search approach for group scheduling in buffer-constrained flow shop cells
This article investigates the flow shop group scheduling with limited buffers to minimise the total completion time (makespan) and proposes two tabu search algorithms for solving each sub-problem.
A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of jobs that visit a set of machines in the same order. The FSP is NP-hard, which means that there is no efficient algorithm to
Two-stage hybrid flowshop scheduling with simultaneous processing machines
This paper studies a new two-stage hybrid flowshop scheduling problem, with simultaneous processing machines at the first stage and a single no-idle machine with predetermined job sequence at the second stage, and designs a list scheduling heuristic algorithm and its improvement.
Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
A meta-heuristic method based on Simulated Annealing (SA) is proposed to solve the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent.