Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates
We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhanc...
Saved in:
| Main Authors: | Tao Ren, Chuan Zhang, Lin Lin, Meiting Guo, Xionghang Xie |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/979238 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates
by: Tao Ren, et al.
Published: (2015-01-01) -
The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times
by: Marcelus Fabri, et al.
Published: (2019-01-01) -
A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
by: Ricardo Pérez-Rodríguez
Published: (2024-10-01) -
New measures of algorithms quality for permutation flow-shop scheduling problem
by: Radosław Puka, et al.
Published: (2023-09-01) -
On a Flow-Shop Scheduling Problem with Fuzzy Pentagonal Processing Time
by: Majed G. Alharbi, et al.
Published: (2021-01-01)