A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates
This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the heuristic to...
Saved in:
| Main Authors: | Tao Ren, Meiting Guo, Lin Lin, Yunhui Miao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2015/320140 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates
by: Tao Ren, et al.
Published: (2014-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) -
Cauchy distribution with Cuckoo search algorithms for solving job shop scheduling Problem
by: Ruqaya A. Muter, et al.
Published: (2023-11-01) -
Applying Decision Transformers to Enhance Neural Local Search on the Job Shop Scheduling Problem
by: Constantin Waubert de Puiseau, et al.
Published: (2025-03-01) -
New measures of algorithms quality for permutation flow-shop scheduling problem
by: Radosław Puka, et al.
Published: (2023-09-01)