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...
Main Authors: | Tao Ren, Meiting Guo, Lin Lin, Yunhui Miao |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2015/320140 |
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) -
Effective Heuristic Algorithms Solving the Jobshop Scheduling Problem with Release Dates
by: Tao Ren, et al.
Published: (2020-07-01) -
Tabu search for scheduling unrelated parallel machines with release dates
by: Hao-chen Lin, et al.
Published: (2013) -
Tabu search methods for the flow shop scheduling problem
by: Yeh, Ching I, et al.
Published: (1994)