Using GRASP for optimization of flow production in FJSP problem with transportation operations

Author

Witkowski, Tadeusz ; Antczak, A. ; Antczak, P.

Author_Institution

Fac. of Production Eng., Warsaw Univ. of Technol., Warsaw, Poland

fYear

2012

fDate

29-31 May 2012

Firstpage

1255

Lastpage

1261

Abstract

In the paper flexible job shop scheduling problem FJSP with transportation operations is analyzed. We discuss the influence of different production factors on makespan. For the analysis of the production process the greedy randomized adaptive search procedure (GRASP) heuristic was used. Experiments with different levels of factors have been considered and compared. The GRASP algorithm has been tested and illustrated with results for the serial and parallel route.

Keywords

greedy algorithms; job shop scheduling; optimisation; randomised algorithms; search problems; transportation; FJSP problem; GRASP; flexible job shop scheduling problem; flow production; greedy randomized adaptive search procedure; optimization; production factors; production process; transportation operations; Analytical models; Loading; Optimization; Production; Schedules; Table lookup; Transportation; factors of production; flexible job shop problem; makespan; serial and parallel route; simulation modeling;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Computation (ICNC), 2012 Eighth International Conference on

Conference_Location

Chongqing

ISSN

2157-9555

Print_ISBN

978-1-4577-2130-4

Type

conf

DOI

10.1109/ICNC.2012.6234520

Filename

6234520