Inventory based Bi-objective flow shop scheduling model and its hybrid genetic algorithm

Mathematical Problems in Engineering

Volumn 2013, Issue , 2013, Pages

  Qing Dao Er Ji, Ren ^a   Wang, Yuping ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; HYBRID GENETIC ALGORITHMS; LOCAL SEARCH OPERATORS; MULTIOBJECTIVE MODELS; MUTATION OPERATORS; TOTAL COMPLETION TIME;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; INVENTORY CONTROL; MACHINE SHOP PRACTICE; SCHEDULING;

GENETIC ALGORITHMS;

EID: 84877290763     PISSN: 1024123X     EISSN: 15635147     Source Type: Journal    
DOI: 10.1155/2013/976065     Document Type: Article

References (31)

1. Johnson S. M., Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954 1 1 61 68
2. Lenstra J. K., Kan A. H. G. R., Brucker P., Complexity of machine scheduling problems. Annals of Discrete Mathematics 1977 1 343 362 2-s2.0-77951139709 10.1016/S0167-5060(08)70743-X
3. Hege L., Minoux M., van Canneyt W., A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. Computers & Operations Research 2012 39 3 629 636 10.1016/j.cor.2011.02.017 MR2820252 ZBL1251.90147
4. Gokbayrak K., Selvi O., Service time optimization of mixed-line flow shop systems. IEEE Transactions on Automatic Control 2010 55 2 395 404 2-s2.0-76949105648 10.1109/TAC.2009.2037273 MR2604415
5. Ravindran D., Selvakumar S. J., Sivaraman R., Haq A. N., Flow shop scheduling with multiple objective of minimizing makespan and total flow time. International Journal of Advanced Manufacturing Technology 2005 25 9 1007 1012 2-s2.0-18144431039 10.1007/s00170-003-1926-1 (Pubitemid 40609447)
6. Eren T., Güner E., A bicriteria scheduling with sequence-dependent setup times. Applied Mathematics and Computation 2006 179 1 378 385 2-s2.0-33747373886 10.1016/j.amc.2005.11.112 MR2260886 ZBL1125.90352 (Pubitemid 44247123)
7. Lemesre J., Dhaenens C., Talbi E. G., An exact parallel method for a bi-objective permutation flowshop problem. European Journal of Operational Research 2007 177 3 1641 1655 2-s2.0-33750743054 10.1016/j.ejor.2005.10.011 MR2271414 ZBL1102.90049 (Pubitemid 44709442)
8. Tseng C. T., Liao C. J., A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. European Journal of Operational Research 2008 191 2 360 373 2-s2.0-43849110246 10.1016/j.ejor.2007.08.030 (Pubitemid 351698067)
9. Naderi B., Zandieh M., Khaleghi Ghoshe Balagh A., Roshanaei V., An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems with Applications 2009 36 6 9625 9633 2-s2.0-64449085610 10.1016/j.eswa.2008.09.063
10. Qian B., Wang L., Huang D. X., Wang X., Multi-objective flow shop scheduling using differential evolution. Lecture Notes in Control and Information Sciences 2006 345 1125 1136 2-s2.0-33748858298 10.1007/11816515-146 (Pubitemid 44421696)
11. Pasupathy T., Rajendran C., Suresh R. K., A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. International Journal of Advanced Manufacturing Technology 2006 27 7-8 804 815 2-s2.0-29344433807 10.1007/s00170-004-2249-6 (Pubitemid 43004635)
12. Melab N., Mezmaz M., Talbi E. G., Parallel cooperative meta-heuristics on the computational grid. A case study: the bi-objective Flow-Shop problem. Parallel Computing 2006 32 9 643 659 2-s2.0-33750397101 10.1016/j.parco.2006.01. 003 MR2269535 (Pubitemid 44637307)
13. Tavakkoli-Moghaddam R., Rahimi-Vahed A., Mirzaei A. H., A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Information Sciences 2007 177 22 5072 5090 10.1016/j.ins.2007.06.001 MR2362813 ZBL1121.90340 (Pubitemid 47331458)
14. Li B. B., Wang L., A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE Transactions on Systems, Man, and Cybernetics B 2007 37 3 576 591 2-s2.0-34249018250 10.1109/TSMCB.2006.887946 (Pubitemid 46784593)
15. Chang P. C., Chen S. H., Liu C. H., Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems. Expert Systems with Applications 2007 33 3 762 771 2-s2.0-33847658312 10.1016/j.eswa.2006.06.019 (Pubitemid 46366680)
16. Dugardin F., Yalaoui F., Amodeo L., New multi-objective method to solve reentrant hybrid flow shop scheduling problem. European Journal of Operational Research 2010 203 1 22 31 10.1016/j.ejor.2009.06.031 MR2556612 ZBL1176.90205
17. Karimi N., Zandieh M., Karamooz H. R., Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach. Expert Systems with Applications 2010 37 6 4024 4032 2-s2.0-77549083772 10.1016/j.eswa.2009.09.005
18. Geiger M. J., Decision support for multi-objective flow shop scheduling by the Pareto Iterated Local Search methodology. Computers & Industrial Engineering 2011 61 3 805 812
19. Chiang T. C., Cheng H. C., Fu L. C., NNMA: an effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Expert Systems with Applications 2011 38 5 5986 5999 2-s2.0-79151476944 10.1016/j.eswa.2010.11.022
20. Dubois-Lacoste J., López-Ibáñez M., Stützle T., A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Computers & Operations Research 2011 38 8 1219 1236 10.1016/j.cor.2010.10. 008 MR2749479 ZBL1208.90059
21. Cho H. M., Bae S. J., Kim J., Jeong I. J., Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Computers & Industrial Engineering 2011 61 3 529 541
22. Lei D., A Pareto archive particle swarm optimization for multi-objective job shop scheduling. Computers & Industrial Engineering 2008 54 4 960 971 2-s2.0-41449114635 10.1016/j.cie.2007.11.007 (Pubitemid 351458391)
23. Khalili M., Tavakkoli-Moghaddam R., A multi-objective electromagnetism algorithm for a bi-objective flow shop scheduling problem. Journal of Manufacturing Systems 2012 31 2 232 239
24. Holland J. H., Genetic algorithm. Scientific American 1992 266 44 50
25. Murata T., Ishibuchi H., Tanaka H., Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers & Industrial Engineering 1996 30 4 957 968 2-s2.0-0030241820 10.1016/0360-8352(96)00045-9 (Pubitemid 126375906)
26. Qing-dao-er-ji R., Wang Y., A new hybrid genetic algorithm for job shop scheduling problem. Computers & Operations Research 2012 39 10 2291 2299 10.1016/j.cor.2011.12.005 MR2885347 ZBL1251.90178
27. Ren Q. D. E. J., Wang Y., Si X., An improved genetic algorithm for job shop scheduling problem. Proceedings of the International Conference on Computational Intelligence and Security (CIS '10) December 2010 113 116 2-s2.0-79951649396 10.1109/CIS.2010.32
28. Dell'Amico M., Trubian M., Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 1993 41 3 231 252 2-s2.0-34250074609 10.1007/BF02023076
29. Reeves C. R., A genetic algorithm for flowshop sequencing. Computers & Operations Research 1995 22 1 5 13 2-s2.0-0029224965
30. Deb K., Pratap A., Agarwal S., Meyarivan T., A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 2002 6 2 182 197 2-s2.0-0036530772 10.1109/4235.996017 (Pubitemid 34555372)
31. Ishibuchi H., Yoshida T., Murata T., Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 2003 7 2 204 223 2-s2.0-0038273913 10.1109/TEVC.2003.810752