Filtered Beam Search Based Flexible Job Shop Scheduling Problem with Transportation Time

Abstract:

Article Preview

Classical flexible job-shop scheduling problem (FJSP) does not consider the transportation time of jobs movement among different machines, which reduces the potential significance of its practical applications. This paper defines an FJSP problem with transportation time incurred by movement of jobs with one Automated Guided Vehicle (AGV) and one Load/Unload (L/U) station. A filtered beam search (FBS) based meta-heuristic algorithm is presented to solve this problem. The detailed procedure of the algorithm is described, and an example is shown to illustrate the algorithm. Finally, preliminary experimental results with comparisons of other dispatching rules demonstrate the feasibility and effectiveness of the proposed algorithm for the FJSP with transportation time.

Info:

Periodical:

Advanced Materials Research (Volumes 97-101)

Edited by:

Zhengyi Jiang and Chunliang Zhang

Pages:

2440-2443

DOI:

10.4028/www.scientific.net/AMR.97-101.2440

Citation:

S. J. Wang "Filtered Beam Search Based Flexible Job Shop Scheduling Problem with Transportation Time", Advanced Materials Research, Vols. 97-101, pp. 2440-2443, 2010

Online since:

March 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.