TITLE

Hybrid Algorithms for Hybrid Flow Shop Scheduling considering Limited Buffers and Due Dates

AUTHOR(S)
Yanhui Yu; Tieke Li
PUB. DATE
May 2013
SOURCE
Advances in Information Sciences & Service Sciences;May2013, Vol. 5 Issue 10, p861
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The mode of continuous casting and hot charge rolling can be abstracted as a kind of two-stage HFS problem with limited buffers and due dates. Based on the analysis from a new angle, a hybrid algorithm, which includes heuristic repairing and neighborhood search, is proposed. Jobs are processed by heuristic rules, the starting time of jobs are repaired using the rules of reducing the idle time in buffers and minimizing the tardiness. At last, the neighborhood search is performed to improve objectives. Experiments show that the hybrid algorithm is feasible and effective.
ACCESSION #
97952306

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics