Exact mathematical formulations and metaheuristic algorithms for production cost minimization: A case study of the cable industry

International Transactions in Operational Research

Volumn 22, Issue 3, 2015, Pages 519-544

  Niroomand, Sadegh ^a   Vizvari, Bela ^b  

^a ISTANBUL AYDIN UNIVERSITY   (Turkey)

^b EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

Author keywords

Cable industry; Mathematical programming; Production scheduling; Simulated annealing; Variable neighborhood search

Indexed keywords

CABLES; CONTINUOUS TIME SYSTEMS; MATHEMATICAL PROGRAMMING; PRODUCTION CONTROL; SCHEDULING; SIMULATED ANNEALING;

CABLE INDUSTRY; CONTINUOUS-TIME REPRESENTATION; MATHEMATICAL FORMULATION; MATHEMATICAL PROGRAMMING MODELS; META HEURISTIC ALGORITHM; PRODUCTION SCHEDULING; PRODUCTION SCHEDULING PROBLEMS; VARIABLE NEIGHBORHOOD SEARCH;

COSTS;

EID: 84926479947     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/itor.12096     Document Type: Article

References (44)

1. Adibi, M.A., Zandieh, M., Amiri, M., 2010. Multi-objective scheduling of dynamic job shop using variable neighborhood search. Expert Systems with Applications 37, 1, 282-287.
2. Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y., 2008. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187, 985-1032.
3. Barton, P.I., Lee, C.K., 2004. Design of process operations using hybrid dynamic optimization. Computers & Chemical Engineering 28, 6-7, 955-969.
4. Bilge, U., Kirac, F., Kurtulan, M., Pekgun, P.A., 2004. Tabu search algorithm for parallel machine total tardiness problem. Computers and Operations Research 31, 397-414.
5. Castro, P.M., Grossmann, I.E., Novais, A.Q., 2006. Two new continuous-time models for the scheduling of multistage batch plants with sequence dependent changeovers. Industrial & Engineering Chemistry Research 45, 18, 6210-6226.
6. Chaovalitwongse, W., Pardalos, P.M., Prokoyev, O.A., 2004. A new linearization technique foe multi-quadratic 0-1 programming problems. Operations Research Letters 32, 517-522.
7. Damodaran, P., Hirani, N.S., Velez-Gallego, M.C., 2009. Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. European Journal of Industrial Engineering 3, 2, 187-206.
8. Dhingra, A., Chandna, P., 2010. Multi-objective flow shop scheduling using hybrid simulated annealing. Measuring Business Excellence 14, 3, 30-41.
9. Dua, V.P., E., Morari, M., 2004. Hybrid systems modeling, parametric programming, and model predictive control-impact on process operations. Paper presented at the Sixth International Conference on Foundations of Computer-Aided Process Design (FOCAPD), Austin, TX.
10. Dunstall, S., Wirth, A., 2005. A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. European Journal of Operational Research 167, 283-296.
11. Dupuy, M., Lamothe, J., Gaborit, P., Dupont, L., 2005. Efficient neighbors in simulated annealing algorithm to optimize the lead time in a parallel multipurpose machine scheduling problem with setup and calendar constraints. Proceedings of the International Conference on Industrial Engineering and Systems Management, Marrakech, Morocco, May 16-19, pp. 22-31.
12. Elmi, A., Solimanpur, M., Topaloglu, S., Elmi, A., 2011. A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts. Computers & Industrial Engineering 61, 1, 171-178.
13. Fahmy, S.A., ElMekkawy, T.Y., Balakrishnan, S., 2008. Deadlock-free scheduling of flexible job shops with limited capacity buffers. European Journal of Industrial Engineering 2, 3, 231-252.
14. Floudas, C.A., Lin, X.X., 2004. Continuous-time versus discrete-time approaches for scheduling of chemical processes: A review. Computers & Chemical Engineering 28, 11, 2109-2129.
15. Floudas, C.A., Lin, X.X., 2005. Mixed integer linear programming in process scheduling: modeling, algorithms, and applications. Annals of Operations Research 139, 1, 131-162.
16. Giannelos, N.F., Georgiadis, M.C., 2002. A simple new continuous-time formulation for short-term scheduling of multipurpose batch processes. Industrial & Engineering Chemistry Research 41, 9, 2178-2184.
17. Gilland, W.G., 2002. A simulation study comparing performance of CONWIP and bottleneck-based release rule. Production Planning and Control 13, 211-219.
18. Harjunkoski, I., Grossmann, I.E., 2002. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Computers & Chemical Engineering 26, 11, 1533-1552.
19. He, X., Chen, A., Chaovalitwongse, W., Liu, H., 2012. An improved linearization technique for a class of quadratic 0-1 programming problems. Optimization Letters 6, 31-41.
20. Hendizadeh, S.H., ElMekkawy, T.Y., Wang, G.G., 2007. Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times. European Journal of Industrial Engineering 1, 4, 391-413.
21. Heragu, S.S., Alfa, A.S., 1992. Experimental analysis of simulated annealing based algorithms for the facility layout problem. European Journal of Operational Research 57, 190-202.
22. Janak, S.L., Lin, X.X., Floudas, C.A., 2004. Enhanced continuous-time unit-specific event-based formulation for short-term scheduling of multipurpose batch processes: Resource constraints and mixed storage policies. Industrial and Engineering Chemistry Research 43, 10, 2516-2533.
23. Kallrath, J., 1999. Mixed-integer nonlinear programming applications. In Ciriani, T.A., Gliozzi, S., Johnson, E.L., Tadei, R. (eds) Operational Research in Industry. Macmillan, Basingstoke.
24. Kim, D.W., Kim, K.H., Jang, W., Chen, F.F., 2002. Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer-Integrated Manufacturing 18, 223-231.
25. Kirkpatrick, S., Gelatt, Jr, C.D., Vecchi, M.P., 1983. Optimization by simulated annealing. Science 220, 671-680.
26. Laarhoven, P.J.M., Aarts, E.H.L., 1987. Simulated Annealing: Theory and Applications. Kluwer Academic, Boston, MA.
27. Lee, S., Grossmann, I.E., 2003. Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks. Computers & Chemical Engineering 27, 11, 1557-1575.
28. Li, X., Gao, L., Shao, X., Zhang, C., Wang, C., 2010. Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling. Computers & Operations Research 37, 4, 656-667.
29. Low, C., 2005. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers and Operations Research 32, 2013-2025.
30. Mendes, A.S., Muller, F.M., Franca, P.M., 2002. Comparing meta-heuristic approach for parallel machine scheduling problems. Production Planning and Control, 13, 143-154.
31. Neto, T., Constantino, M., Martins, I., Pedroso, J.P., 2013. A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability. International Transactions in Operational Research 20, 5, 689-709.
32. Pinedo, M.L., 2008. Scheduling: Theory, Algorithms, and Systems (3rd edn). Springer, New York.
33. Rabadi, G., Mollaghasemi, M., Anagnostopoulos, G.C., 2004. A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence dependent setup time. Computers and Operations Research 31, 1727-1751.
34. Ranjbar, M., 2013. A branch-and-bound algorithm for scheduling of new product development projects. International Transactions in Operational Research 20, 2, 251-266.
35. Rios-Mercado, R.Z., Bard, J.F., 1999. A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times. IIE Transactions 31, 721-731.
36. Ruiz, R., Sivrikaya-Serifoglu, F., Urlings, T., 2006. Evolutionary approach to realistic hybrid flexible flowshop scheduling problems. Technical Report, Department of Applied Statistics and Operations Research, Polytechnic University of Valencia, Spain.
37. Stefansson, H., Sigmarsdottir, S., Jensson, P., Shah, N., 2011. Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry. European Journal of Operational Research 215, 383-392.
38. Valente, J.M.S., 2007. Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. European Journal of Industrial Engineering 1, 4, 431-448.
39. Wan, L., Yuan, J., 2013. Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. Operations Research Letters 41, 363-365.
40. Wong, T. N., Zhang, S., Wang, G., Zhang, L., 2012. Integrated process planning and scheduling-multi-agent system with two-stage ant colony optimisation algorithm. International Journal of Production Research 50, 21, 6188-6201.
41. Yang, T., Shen, Y., 2012. Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: integrated-circuit wire bonding. Production Planning and Control 23, 1, 67-78.
42. Yazdani, M., Amirib, M., Zandieh, M., 2010. Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Systems with Applications 37, 1, 678-687.
43. Yousefi, M., Yusuff, R. M., 2013. Minimising earliness and tardiness penalties in single machine scheduling against common due date using imperialist competitive algorithm. International Journal of Production Research 51, 16, 4797-4804.
44. Zhang, R., Wu, C., 2011. A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective. Computers & Operations Research 38, 5, 854-867.