DocumentCode
2852887
Title
Spreadsheet approach for solving complex flowshop scheduling problems
Author
Omar, Mohamed K.
Author_Institution
Bus. Sch. - Malaysia, Nottingham Univ., Semenyih, Malaysia
fYear
2011
fDate
6-9 Dec. 2011
Firstpage
176
Lastpage
180
Abstract
Méndez et al., [1] proposed an elegant MILP that provides a solution to a complicated short-term scheduling of resource-constraint multistage flowshop batch facilities. Moreover, the work presents a three-variation of the problem and provides a solution for each variation. In recent years, many metaheuristics are developed to work as add-in to spreadsheet popular software to provide solutions for optimization problems. This paper reports on an application of spreadsheet based Genetic Algorithm (GA) to solve the problem reported by Méndez. Moreover, our results indicate that it is possible to solve complex scheduling problems using the proposed approach, however, spreadsheet formulation knowledge and modelling skills are required.
Keywords
flow shop scheduling; genetic algorithms; integer programming; linear programming; spreadsheet programs; MILP; complex flowshop scheduling problems; mixed integer linear programming; modelling skills; optimization problems; resource-constraint multistage flowshop batch facilities; short-term scheduling; spreadsheet based genetic algorithm; spreadsheet formulation knowledge; Genetic algorithms; Job shop scheduling; Mathematical model; Optimization; Processor scheduling; Resource management; Hybrid flowshop; discrete machines; mixed integer programming; scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Engineering and Engineering Management (IEEM), 2011 IEEE International Conference on
Conference_Location
Singapore
ISSN
2157-3611
Print_ISBN
978-1-4577-0740-7
Electronic_ISBN
2157-3611
Type
conf
DOI
10.1109/IEEM.2011.6117902
Filename
6117902
Link To Document