Improvements to genetic algorithm for flexible job shop scheduling with overlapping in operations
Authors:
Open Access
- 1 May 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 791-796
Abstract
Flexible job-shop scheduling problem (FJSP) is an extended job-shop scheduling problem. FJSP allows an operation to be processed by several different machines. FJSP with overlapping in operations means that each operation is divided into several sublots. Sublots are processed and transferred separately without waiting for the entire operation to be processed. In previous research, a mathematical model was developed and a genetic algorithm proposed to solve this problem. In this study, we try to improve the procedure of previous research to achieve better results. The proposed improvements were tested on some benchmark problems and compared with the results obtained by previous research.Keywords
This publication has 9 references indexed in Scilit:
- An effective genetic algorithm for flexible job-shop scheduling with overlapping in operationsInternational Journal of Production Research, 2014
- An effective genetic algorithm for the flexible job-shop scheduling problemExpert Systems with Applications, 2011
- A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problemThe International Journal of Advanced Manufacturing Technology, 2010
- A genetic algorithm for the Flexible Job-shop Scheduling ProblemComputers & Operations Research, 2008
- The common cycle economic lot scheduling in flexible job shops: The finite horizon caseInternational Journal of Production Economics, 2005
- A genetic algorithm for flexible job-shop scheduling2003
- A genetic algorithm for general machine scheduling problems2002
- Effective neighbourhood functions for the flexible job shop problemJournal of Scheduling, 2000
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976