Paper Titles

Dynamic Reentrant Scheduling Simulation for Assembly and Test Production Line in Semiconductor Industry
p.2418

The Conjugation of the Hardened and Grinded Worm Gear
p.2423

An Effective Immune Based Approach for the No-Wait Flow Shop Scheduling Problems with Multiple Machines
p.2432

A Production Scheduling Method for Bell-Type Batch Annealing Shop
p.2436

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

A Symbolic OBDD-Based Algorithm for Assembly Sequence Planning
p.2444

An Improved Genetic Algorithm for Multi-Objective Flexible Job-Shop Scheduling Problem
p.2449

Optimization of Printed Circuit Board Assignment and Component Allocation in Assembly Line
p.2455

Study on the Scheduling Problem of Powder Painting Production - A Case Study
p.2459

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 97-101Filtered Beam Search Based Flexible Job Shop...

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

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Manufacturing Science and Engineering I

Info:

Periodical:

Advanced Materials Research (Volumes 97-101)

Pages:

2440-2443

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.97-101.2440

Citation:

Cite this paper

Online since:

March 2010

Authors:

Shi Jin Wang

Keywords:

Filtered Beam Search, Flexible Job-Shop Scheduling, Material Handling Device (MHD), Transportation Time

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S.J. Wang, B.H. Zhou, and L.F. Xi: Int. J. Prod. Res., Vol. 46 (2008), pp.3027-3058.

[2] I., Kacem, S., Hammadi and P., Borne: IEEE Trans. Syst., Man & Cyber., Part C, Vol. 32(2002), pp.1-13.

[3] W.J., Xia and Z.M., Wu: Comp. Indust. Eng., Vol. 48(2005), pp.409-425.

[4] G. Ulusoy, F. Sivrikaya-Serifoglu, and U. Bilge: Computers Ops Res., Vol. 24(1997), pp.335-351.

[5] L. Deroussi, M. Gourgand, and N. Tchernev: Int. J. Prod. Res., Vol. 46(2008), pp.2143-2164.

[6] G.E., Khayat, A. Langevin and D., Riopel: Eur. J. Op. Res., Vol. 175(2006), pp.1818-1832.

[7] B.S.P. Reddy and C.S.P. Rao: Int. J. Adv. Manuf. Technol, Vol. 31(2006), pp.602-613.

[8] P. Lacomme, A. Moukrim, and N. Tchernev: Int. J. Prod. Res., Vol. 43(2005), p.1911-(1942).

[9] K.V. Subbaiah, M. N. Rao, and K.N. Rao: Int. J. Phys. Sci., Vol. 42(2009), pp.139-148. Fig. 4. Gantt chart for the example using M_EET rule Makespan=14 M2 M1 J3-1 J3-2 J1-2 J2-2.

[1] 2 3 4 5 6 7 8 9 10 11 12 13 L/U-M1 (J2) M1-M2 (J2) M2-L/U L/U-M1 (J1) M1-L/U L/U-M2 (J3) M2-M1 AGV.

DOI: 10.1002/chin.200732004

[1] [1] [42] 6.

[7] [7] [8] [8] [9] [9] 10.

[12] J2-1.

[2] [3] 5 J1-1.

[6] M1-M2 (J1).

[11] M2-M1 (J3).

[14] [14] [12] [0] M_EET rule Makespan=17 M2 M1 J3-1 J3-2 J1-2 J2-2.

[1] 2 3 4 5 6 7 8 9 10 11 12 13 L/U-M1 (J2) L/U-M2 (J3) M2-M1 (J3) M2-L/U M1-M2 (J2) AGV.

DOI: 10.1002/chin.200732004

[1] [1] [42] 6.

[7] [7] [8] [8] [9] [9] 10 11 J2-1.

[2] [3] 5 J1-1 L/U-M1 (J1).

[11] [14] [14] [0] M_SPT rule M1-L/U M1-M2 (J1).

[15] 1716 1514 Fig. 5. Gantt chart for the example using M_SPT rule.