A distributed flexible job shop scheduling problem considering rush order insertion using a two-stage memetic algorithm

doi:10.1016/j.asoc.2025.114008

A distributed flexible job shop scheduling problem considering rush order insertion using a two-stage memetic algorithm

2025-10-06

0

PRE

AI

D

Dian Lu

龚

龚桂良 (Guiliang Gong) *

龚

龚中良 (Zhongliang Gong)

DOI：10.1016/j.asoc.2025.114008

Original

Original request for help

Save

Abstract

En 中文

• Distributed flexible job-shop scheduling with rush order insertion is studied. • A two-stage memetic algorithm (TMA) is proposed to solve the problem. • A new insertion rescheduling method is designed to make full use of the machines’ idle time. • An effective local search operator is designed to improve the performance of TMA. • Results show that the TMA is superior in terms of solution quality and efficiency.

A distributed flexible job shop scheduling problem considering rush order insertion using a two-stage memetic algorithm

Abstract

Journal

Organization