An improved memetic algorithm to solve the energy-efficient distributed flexible job shop scheduling problem with transportation and start-stop constraints
In the current global cooperative production environment, modern industries are confronted with intricate production plans, demanding the adoption of contemporary production scheduling strategies. Within this context, distributed manufacturing has emerged as a prominent trend. Manufacturing enterpri...
Main Authors: | Yifan Gu, Hua Xu, Jinfeng Yang, Rui Li |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-12-01
|
Series: | Mathematical Biosciences and Engineering |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/mbe.2023950?viewType=HTML |
Similar Items
-
A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem
by: Henry Lamos-Díaz, et al.
Published: (2017-01-01) -
A Memetic Algorithm for Hybrid Flowshops with Flexible Machine
Availability Constraints
by: Fariborz Jolai, et al.
Published: (2010-02-01) -
Research on Multi-Objective Hybrid Flow Shop Scheduling Problem With Dual Resource Constraints Using Improved Memetic Algorithm
by: Kaifeng Geng, et al.
Published: (2020-01-01) -
A Self-Adaptive Memetic Algorithm for Distributed Job Shop Scheduling Problem
by: Guangchen Wang, et al.
Published: (2024-02-01) -
A Hybrid Discrete Memetic Algorithm for Solving Flow-Shop Scheduling Problems
by: Levente Fazekas, et al.
Published: (2023-08-01)