Hybrid flow-shop scheduling problem based on saving energy

In this paper, the mixed-integer nonlinear programming model is established for hybrid flow-shop scheduling problem (HFSP), with the minimum of energy consumption as the objective function. Aiming at the characteristic of this problem and the shortcomings of simple genetic algorithm, a hybrid genetic algorithm (Memetic) is presented. To validate the preciseness of the model and the availability of the method, the simulating experimentation is done on the three-two-three HFSP, and the result indicates that the scheduling algorithm can reduce the energy consumption in the process of production.

[1]  Weiwu Yan,et al.  Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times , 2004, Proceedings of the 2004 American Control Conference.

[2]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[3]  Wendong Xiao,et al.  Hybrid flow shop scheduling using genetic algorithms , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[4]  Yi Wu,et al.  A genetic algorithm for solving flow shop scheduling problems with parallel machine and special procedure constraints , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[5]  Farid Benhammadi,et al.  Heuristics Resolution of a Constrained Hybrid Flow Shop Problem , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).

[6]  Gupta J.N.D..  TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[7]  D. Chaudhuri,et al.  A multi-stage parallel-processor flowshop problem with minimum flowtime , 1992 .