• Home
  • Search
  • Effective heuristics for the distributed permutation flowshop scheduling problem with release dates
  • https://doi.org/10.23919/ccc52363.2021.9550178Copy DOI Icon

Effective heuristics for the distributed permutation flowshop scheduling problem with release dates

  • Jul 26, 2021
  • Biao Han +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

In recent years, the distributed permutation flowshop scheduling problem (DPFSP) has become a hotspot in research. In this paper, we change several heuristics for a single factory to the heuristics for a multi-factory environment to solve the DPFSP with total completion time (TCT) criterion. Further, these distributed heuristics are improved to deal with the minimization of the TCT for the DPFSP with release dates by modifying the initialization procedure and local search methods. Finally, we calculate 720 instances and compare our proposed heuristics and those from the recent literature. Computational results indicate the superiority of the presented heuristics for the problem considered.

Similar Papers
  • PDF
  • Research Article
  • Citations14

Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming

  • Nov 21, 2023
  • Applied Sciences
  • Christos Gogos
  • Conference Article

NEH-based heuristics for the distributed permutation flowshop with rejection and tardiness

  • Feb 16, 2023
  • Zhen Lin +2
  • Conference Article
  • Citations6

An iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime

  • Jul 01, 2020
  • Jiayang Mao +5
  • Conference Article
  • Citations7

The distributed permutation flowshop scheduling problem: A genetic algorithm approach

  • Jan 01, 2015
  • Yan Li +1
  • Research Article
  • Citations13

Towards a Distributed Implementation of Chemical Reaction Optimization for the Multi-factory Permutation Flowshop Scheduling Problem

  • Jan 01, 2017
  • Procedia Computer Science
  • Hafewa Bargaoui +2
  • Book Chapter
  • Citations1

Scheduling Unit Execution Time Tasks on Two Parallel Machines with the Criteria of Makespan and Total Completion Time

  • Jan 01, 2005
  • Yakov Zinder +1
  • PDF
  • Research Article
  • Citations27

A new solution to distributed permutation flow shop scheduling problem based on NASH Q-Learning

  • Sep 30, 2021
  • Advances in Production Engineering & Management
  • J.F Ren +2
  • Book Chapter

Improved Flow Shop Schedules with Total Completion Time Criterion

  • Jan 01, 2013
  • Dipak Laha +1
  • Research Article
  • Citations20

Scheduling with controllable release dates and processing times: Total completion time minimization

  • Dec 01, 2006
  • European Journal of Operational Research
  • T.C Edwin Cheng +2
  • Research Article
  • Citations4

Robust face alignment and tracking by combining local search and global fitting

  • May 03, 2016
  • Image and Vision Computing
  • Jongju Shin +1
  • Research Article
  • Citations7

Single machine total tardiness maximization problems: complexity and algorithms

  • Dec 28, 2012
  • Annals of Operations Research
  • Evgeny R Gafarov +2
  • Conference Article
  • Citations40

Locals Search Algorithms for Efficient Router Nodes Placement in Wireless Mesh Networks

  • Aug 01, 2009
  • Fatos Xhafa +2
  • Research Article
  • Citations47

Optimizing blocking flow shop scheduling problem with total completion time criterion

  • Feb 13, 2013
  • Computers & Operations Research
  • Ghasem Moslehi +1
  • Research Article
  • Citations26

Inventory and total completion time minimization for assembly job-shop scheduling considering material integrity and assembly sequential constraint

  • Oct 01, 2022
  • Journal of Manufacturing Systems
  • Lixin Cheng +3
  • Research Article
  • Citations107

A hybrid genetic local search algorithm for the permutation flowshop scheduling problem

  • Oct 01, 2009
  • European Journal of Operational Research
  • Lin-Yu Tseng +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.