A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time
Advanced production systems usually are complex in nature and aim to deal with multiple performance measures simultaneously. Therefore, in most cases, the consideration of a single objective function is not sufficient to properly solve scheduling problems. This paper investigates the multi-...
Main Authors: | Marcelo Seido Nagano, Fernando Luis Rossi |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2024-01-01
|
Series: | Journal of Project Management |
Online Access: | http://www.growingscience.com/jpm/Vol9/jpm_2023_12.pdf |
Similar Items
-
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
by: Fatih Tasgetiren, M., et al.
Published: (2013) -
Solving blocking flowshop scheduling problem with makespan criterion using q-learning-based iterated greedy algorithms
by: M. Fatih Tasgetiren, et al.
Published: (2024-01-01) -
Dynamic weighted idle time heuristic for flowshop scheduling
by: Zainudin, Amira Syuhada
Published: (2017) -
Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion
by: Christophe Sauvey, et al.
Published: (2020-04-01) -
An improved iterated greedy algorithm for distributed mixed no-wait permutation flowshop problems with makespan criterion
by: Chuan-Chong Li, et al.
Published: (2024-01-01)