An Integrated Mathematical Model of Production Planning Considering Order Acceptance, Production and Customer Delivery at Marun Petrochemical Company

Document Type : Research Paper


Department of Management, Islamic Azad University, Central Tehran Branch, Tehran, Iran



The scheduling and batch delivery problem has been studied by many researchers as one of the classic operation sequence problems. However, this study attempted to address this problem by adding order acceptance determination and sequence-dependent setup. In this study, a mathematical model has been presented in Marun Petrochemical Company considering the number of orders received for production to maximize the organization's profit by selecting the order and planning the production based on the order received. Therefore, to realize this goal in the small production space, the mathematical model was coded in GAMS software and solved using the CPLEX solving method. Then, to investigate the larger scale of the model under study, the validation of 23 generated problems was carried out by the exact solution in GAMS software and genetic algorithm in MATLAB software, and in the end, the comparative evaluation was performed. The evaluation showed that the meta-heuristic solution on a small scale has a small deviation from the exact solution, and the mathematical model is solved in a proper time by the meta-heuristic algorithm. As the problem's size grows up, the exact solution loses its efficiency in terms of time, and the application of the exact solution algorithm to solve the model becomes inadequate. The genetic algorithm achieves an acceptable solution in a proper time with reasonable deviation. So, this algorithm can replace the exact solution properly.


Ahmadizar, S., Farhadi, S. (2015). Single machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs, Computers & Operations Research, 08.012.
Asadi, A., Hooshmand M., Torabi. M. (2016). Order Production Scheduling in the Environment of Reconfigurable Manufacturing Systems (RMS) considering Delivery Due, 4th International Conference on Applied Research in Management and Accounting, Tehran, Shahid Beheshti University.
Ayough, A., & Khorshidvand, B. (2019). Designing a manufacturing cell system by assigning workforce. Journal of Industrial Engineering and Management12(1), 13-26.
Ayough, A., Hosseinzadeh, M., & Motameni, A. (2020). Job rotation scheduling in the Seru system: shake enforced invasive weed optimization approach. Assembly Automation.
Babaee Tirkolaee, E., Goli, A., Pahlevan, M., & Malekalipour Kordestanizadeh, R. (2019). A robust bi-objective multi-trip periodic capacitated arc routing problem for urban waste collection using a multi-objective invasive weed optimization. Waste Management & Research37(11), 1089-1101.
Badri, S., Nick Pimachafi. R. (2017). Presenting A Model For Workshop Scheduling Considering Constraints on Maintenance Based on Constraint Theory, 1st International Conference on System Optimization and Business Management, Babol, Industrial University of Noshirvani - Iranian Association for Operations Research.
Chen, S. H., Liou, Y. C., Chen, Y. H., & Wang, K. C. (2019). Order Acceptance and Scheduling Problem with Carbon Emission Reduction and Electricity Tariffs on a Single Machine. Sustainability, 11(19), 5432.
Iranpoor, S., Fatemi Ghomi, M.T., Zandieh, M. (2014). Order acceptance and due-date quotation in low machine rates, Applied Mathematical Modelling, vol 38, pages 2063–2072.
Jiang, D., Tan, J., & Li, B. (2017). Order acceptance and scheduling with batch delivery. Computers & Industrial Engineering, 107, 100-104.
Li, Q., Zhang, D., Kucukkoc, I., & He, N. (2020). Heuristic Techniques for Real-Time Order Acceptance and Scheduling in Metal Additive Manufacturing. In Mathematical Modelling and Optimization of Engineering Problems (pp. 1-24). Springer, Cham.
Moghaddam, F., Yalaoui, L., Amodeo, (2015). Efficient meta-heuristics based on various dominance criteria for asingle-machine bi-criteria scheduling problem with rejection, Journal of Manufacturing Systems, vol 34, pages 12–22.
Mokhtari, H. (2015). A nature inspired intelligent water drops evolutionary algorithm for parallel processor scheduling with rejection, Applied Soft Computing, vol 26, pages 166–179.
Park, J., Nguyen, S., Zhang, M., Johnston, M. (2013). Genetic Programming for Order Acceptance and Scheduling, IEEE Congress on Evolutionary Computation.
Parsaei, M., Shahraki, A., shahgholian, K. (2014). Selecting the best responsive option to unexpected orders at the time of capacity-shortage using multi criteria decision models, Decision Science Letters, vol 3, pages 375–390.
Petering, M. E., Chen, X., & Hsieh, W. H. (2019). Inventory control with flexible demand: Cyclic case with multiple batch supply and demand processes. International Journal of Production Economics, 212, 60-77.
Rasti Barzoki, M., Hejazi, S.R. (2013). Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains, European Journal of Operational Research, vol 228, Issue 2, Pages 345-357.
Sarvestani, H. K., Zadeh, A., Seyfi, M., & Rasti-Barzoki, M. (2019). Integrated order acceptance and supply chain scheduling problem with supplier selection and due date assignment. Applied Soft Computing, 75, 72-83.
Silva, Y. L. T., Subramanian, A., & Pessoa, A. A. (2018). Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. Computers & Operations Research, 90, 142-160.
Tavakoli Moghaddam, R., Yazdani, M., Molla Alizadeh Zavardehi, S. (2012). Integrated Scheduling of Production and Air Transport in the Supply Chain Considering Sequence-Based Setup Times, International Journal of Industrial Engineering and Production Management.
Wang, B., & Wang, H. (2018). Multiobjective Order Acceptance and Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints .
Yang, J. Geunes, (2007). A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times, Computers & Industrial Engineering, vol 53, pages 420–432.
Yang, S., & Xu, Z. (2020). The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery. International Journal of Production Research, 1-19.
Yin, Y., Cheng, T.C.E., Cheng, S.R., Wu, C.C. (2013). Single-machine batch delivery scheduling with an assignable common due date and controllable processing times, Computers & Industrial Engineering, vol 65, pages 652-662.
Yin, Y., Cheng, T.C.E., Cheng, S.R., Wu, C.C. (2013). Single-machine batch delivery scheduling with an assignable common due date and controllable processing times, Computers & Industrial Engineering, vol 65, pages 652-662.
Yin, Y., Ye, D., Zhang, G. (2014). Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval, Information Sciences, vol 274, pages 310-322.