Evaluation of mathematical models for flexible job-shop scheduling problems

Applied Mathematical Modelling

Volumn 37, Issue 3, 2013, Pages 977-988

  Demir, Yunus ^a   Kursat Isleyen S ^a  

^a ATATÜRK UNIVERSITY   (Turkey)

Author keywords

Flexible job shops; Mixed integer programming; Scheduling

Indexed keywords

BINARY VARIABLES; COMPARATIVE STUDIES; COMPUTER TECHNOLOGY; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; FLEXIBLE JOB-SHOPS; MATHEMATICAL FORMULATION; MIXED INTEGER PROGRAMMING; NP-HARD; ON-MACHINES; SCHEDULING PROBLEM; SEQUENCING OPERATIONS; SOLUTION METHODS;

HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; SCHEDULING;

PROBLEM SOLVING;

EID: 84870248520     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2012.03.020     Document Type: Article

References (37)

1. Pinedo M. Scheduling: Theory, Algorithms and Systems 1995, Prentice-Hall, New Jersey, Englewood Cliffs.
2. Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and jobshop scheduling scheduling. Math. Oper. Res. 1976, 1(2):117-129.
3. Bagheri A., Zandieh M., Mahdavi I., Yazdani M. An artificial immune algorithm for the flexible job-shop scheduling problem. Future Generation Comput. Syst. 2010, 26(4):533-541.
4. özgüven C., özbaki{dotless}r L., Yavuz Y. Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Modell. 2010, 34:1539-1548.
5. Wagner H.M. An integer liinear programming model for machine scheduling. Naval Res. Logistics Quart. 1959, 6:131-140.
6. Bowman E.H. The scheduling sequence problem. Oper. Res. 1959, 7:621-624.
7. Manne A.S. On the job-shop scheduling problem. Oper. Res. 1960, 8:219-223.
8. Baker K.R., Trietsch D. Principles of Sequencing and Scheduling 2009, Wiley, New Jersey.
9. Unlu Y., Mason S.J. Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Comput. Ind. Eng. 2010, 58:785-800.
10. Pan C.-H. A study of integer programming formulations for scheduling problems. Int. J. Syst. Sci. 1997, 28:33-41.
11. Blazewicz J., Dror M., Weglarz J. Mathematical programming formulations for machine scheduling: a survey. Eur. J. Oper. Res. 1991, 51:283-300.
12. Keha A.B., Ketan K., Fowler W. Mixed integer programming formulations for single machine scheduling problems. Comput. Ind. Eng. 2009, 56:357-367.
13. Pan J., Chen J. Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Comput. Oper. Res. 2005, 32:1197-1212.
14. Fattahi P., Mehrebad M.S., Jolai F. Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 2007, 18:331-342.
15. Zhang G., Gao L., Shi Y. An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 2011, 38(4):3563-3573.
16. Zhang Q., Manier H., Manier M.-A. A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Comput. Oper. Res. 2012, 39:1713-1723.
17. Zhang G., Shao X., Li P., Gao L. An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 2009, 56:1309-1318.
18. Moradi E., Fatemi Ghomi S.M.T., Zandieh M. Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem. Expert Syst. Appl. 2011, 38:7169-7178.
19. Fattahi P., Fallahi A. Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability. CIRP J. Manuf. Sci. Technol. 2010, 2:114-123.
20. Lee Y.H., Jeong C.S., Moon C. Advanced planning and scheduling with outsourcing in manufacturing supply chain. Comput. Ind. Eng. 2002, 43:351-374.
21. Mehrabad M.S., Fattahi P. Flexible job shop scheduling with tabu search algorithms. Int. J. Adv. Manuf. Technol. 2007, 32:563-570.
22. Thomalla C.S. Job shop scheduling with alternative process plans. Int. J. Production Economics 2001, 71:125-134.
23. Low C.Y., Wu T.H. Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment. Int. J. Prod. Res. 2001, 39:689-708.
24. N. Imanipour, Modeling & solving flexible job shop problem with sequence dependent setup times, in: Proceedings of the International conference on service systems and service management, October 25-27, 2006, vol. 2, IEEE, 2006, pp. 1205-1210.
25. H. Tamaki, T. Ono, H. Murao, S. Kitamura, Modeling and genetic solution of a class of flexible job shop scheduling problems, in: Proceedings of the IEEE Symposium on Emerging Techonologies and Factory Automation, vol. 2, IEEE, 2001, pp. 343-350.
26. Low C., Yip Y., Wu T.H. Modeling and heuristics of FMS scheduling with multiple objectives. Comput. Oper. Res. 2006, 33:674-694.
27. Lin L., Jia-zhen H. Multi-objective flexible job-shop scheduling problem in steel tubes production. SETP 2009, 29(8):117-126.
28. Gen M., Gao J., Lin L. Multistage-Based genetic algorithm for flexible job-shop scheduling problem. Intell. Evolut. Syst. 2009, 187:183-196.
29. M.C. Gomes, A.P. Barbosa PÓ VOA, A.Q. Novais, Optimal scheduling for flexible job shop operation, Int. J. Prod. Res. 43 (2005) 2323-2353.
30. Kim K.-H., Egbelu P.J. Scheduling in a production environment with multiple process plans per job. Int. J. Prod. Res. 1999, 37:2725-2753.
31. Gao J., Gen M., Sun L. Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J. Intell. Manuf. 2006, 17:493-507.
32. Torabi S.A., Karimi B., Fatemi Ghomi S.M.T. The common cycle economic lot scheduling in flexible job shops: the finite horizon case. Int. J. Production Economics 2005, 97:52-65.
33. Fattahi P., Jolai F., Arkat J. Flexible job shop scheduling with overlapping in operations. Appl. Math. Modell. 2009, 33:3076-3087.
34. Khalife M.A., Abbasi B., Abadi A.H.K.D. A simulated annealing algorithm for multi objective flexible job shop scheduling with overlapping in operations. J. Ind. Eng. 2010, 5:17-28.
35. Liu J., MacCarty B.L. A global milp model for FMS scheduling. Eur. J. Oper. Res. 1997, 100:441-453.
36. Kesen S.E., Güngör Z. How important is the batch splitting activity in scheduling of virtual manufacturing cells (VMCs)?. Int. J. Prod. Res. 2011, 49:1645-1667.
37. Kesen S.E., Das S.K., Güngör Z. A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs). Comput. Oper. Res. 2010, 37:1148-1156.