Mathematical models for job-shop scheduling problems with routing and process plan flexibility

Applied Mathematical Modelling

Volumn 34, Issue 6, 2010, Pages 1539-1548

  Özgüven, Cemal ^a   Özbakir, Lale ^a   Yavuz, Yasemin ^a  

^a ERCIYES UNIVERSITY   (Turkey)

Author keywords

Job shop scheduling; Mixed integer programming; Process plan flexibility; Routing flexibility

Indexed keywords

COMPUTATIONAL RESULTS; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; MIXED INTEGER LINEAR PROGRAMMING; MIXED-INTEGER PROGRAMMING; NP-HARD; OPTIMIZATION PROBLEMS; PROCESS PLAN; PRODUCTION TECHNOLOGY; RAPID DEVELOPMENT; ROUTING FLEXIBILITY; SUB-PROBLEMS; TEST PROBLEM;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; DYNAMIC PROGRAMMING; LINEARIZATION; MATHEMATICAL MODELS; OPTIMIZATION; PROCESS CONTROL; ROUTING ALGORITHMS; SCHEDULING; UNMANNED AERIAL VEHICLES (UAV);

INTEGER PROGRAMMING;

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

References (38)

1. Graves S.C. A review of production scheduling. Oper. Res. 29 4 (1981) 646-675
2. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. Sequencing and scheduling: algorithms and complexity. In: Graves S.C., et al. (Ed). Handbooks in OR and MS vol. 4 (1993), Elsevier Science Publishers B.V. 445-522
3. Lee C.-Y., Lei L., and Pinedo M. Current trends in deterministic scheduling. Ann. Oper. Res. 70 (1997) 1-41
4. Jain A.S., and Meeran S. Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113 (1999) 390-434
5. Beck J.C., and Fox M.S. Constraint-directed techniques for scheduling alternative activities. Artif. Intell. 121 (2000) 211-250
6. Kacem I., Hammadi S., and Borne P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simulat. 60 (2002) 245-276
7. Chan F.T.S., Wong T.C., and Chan L.Y. Flexible job-shop scheduling problem under resource constraints. Int. J. Prod. Res. 44 11 (2006) 2071-2089
8. Ho N.B., Tay J.C., and Lai E.M.-K. An effective architecture for learning and evolving flexible job-shop schedules. Eur. J. Oper. Res. 179 (2007) 316-333
9. Brandimarte P. Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41 3 (1993) 157-183
10. Dauzère-Pérès S., and Paulli J. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann. Oper. Res. 70 (1997) 281-306
11. Dauzère-Pérès S., Roux W., and Lasserre J.B. Multi-resource shop scheduling with resource flexibility. Eur. J. Oper. Res. 107 (1998) 289-305
12. Scrich C.R., Armentano V.A., and Laguna M. Tardiness minimization in a flexible job shop: a tabu search approach. J. Intell. Manuf. 15 (2004) 103-115
13. Saidi-Mehrabad M., and Fattahi P. Flexible job shop scheduling with tabu search algorithms. Int. J. Adv. Manuf. Technol. 32 (2007) 563-570
14. Low C., and Wu T.-H. Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment. Int. J. Prod. Res. 39 4 (2001) 689-708
15. Loukil T., Teghem J., and Fortemps P. A multi-objective production scheduling case study solved by simulated annealing. Eur. J. Oper. Res. 179 (2007) 709-722
16. Rossi A., and Dini G. Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robot. Comput. Integr. Manuf. 23 (2007) 503-516
17. Xia W., and Wu Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 48 (2005) 409-425
18. Gao J., Gen M., and Sun L. Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J. Intell. Manuf. 17 (2006) 493-507
19. Low C., Yip Y., and Wu T.-H. Modelling and heuristics of FMS scheduling with multiple objectives. Comput. Oper. Res. 33 (2006) 674-694
20. Fattahi P., Saidi-Mehrabad M., and Jolai F. Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18 (2007) 331-342
21. Gao J., Sun L., and Gen M. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35 (2008) 2892-2907
22. Vilcot G., and Billaut J.-C. A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur. J. Oper. Res. 190 (2008) 398-411
23. Lee Y.H., Jeong C.S., and Moon C. Advanced planning and scheduling with outsourcing in manufacturing supply chain. Comput. Ind. Eng. 43 (2002) 351-374
24. Kim Y.K., Park K., and Ko J. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput. Oper. Res. 30 (2003) 1151-1171
25. B.J. Park, H.R. Choi, A genetic algorithm for integration of process planning and scheduling in a job shop, in: A. Sattar, B.H. Kang (Eds.), AI 2006, LNAI, vol. 4304, Springer-Verlag, Berlin, Heidelberg, 2006, pp. 647-657.
26. Baykasoǧlu A., Özbaki{dotless}r L., and Sönmez A.I. Using multiple objective tabu search and grammars to model and solve multi-objective flexible job-shop scheduling problems. J. Intell. Manuf. 15 6 (2004) 777-785
27. Baykasoǧlu A. Linguistic-based meta-heuristic optimization model for flexible job-shop scheduling. Int. J. Prod. Res. 40 17 (2002) 4523-4543
28. Shapiro J.F. Mathematical programming models and methods for production planning and scheduling. In: Graves S.C., et al. (Ed). Handbooks in OR and MS vol. 4 (1993), Elsevier Science Publishers B.V. 371-443
29. Pan C.-H. A study of integer programming formulations for scheduling problems. Int. J. Syst. Sci. 28 1 (1997) 33-41
30. Kim K.-H., and Egbelu P.J. Scheduling in a production environment with multiple process plans per job. Int. J. Prod. Res. 37 12 (1999) 2725-2753
31. Brandimarte P. Exploiting process plan flexibility in production scheduling: a multi-objective approach. Eur. J. Oper. Res. 114 (1999) 59-71
32. Thomalla C.S. Job shop scheduling with alternative process plans. Int. J. Prod. Econ. 74 (2001) 125-134
33. Choi I.-C., and Choi D.-S. A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. Comput. Ind. Eng. 42 (2002) 43-58
34. Gomes M.C., Barbosa-Povoa A.P., and Novais A.Q. Optimal scheduling for flexible job shop operation. Int. J. Prod. Res. 43 11 (2005) 2323-2353
35. Manne A.S. On the job-shop scheduling problem. Oper. Res. 8 (1960) 219-223
36. Wagner H.M. An integer linear-programming model for machine scheduling. Nav. Res. Logist. Quart. 6 (1959) 131-140
37. Bowman E.H. The scheduling-sequence problem. Oper. Res. 7 (1959) 621-624
38. L. Özbaki{dotless}r, Modeling, Analyzing and Solution of Multiple Objective Flexible Job Shop Scheduling Problems by Using Meta-heuristic Algorithms, Ph.D. Dissertation, Erciyes University, Social Sciences Institute, Kayseri, Turkey, 2004 (in Turkish).