TY - JOUR ID - 5244 TI - Multi-agent single machine scheduling problem with transportation constraints JO - Journal of Mathematical Modeling JA - JMM LA - en SN - 2345-394X AU - Ziaee, Mohsen AU - Imanparast, Mahdi AU - Khodabakhshi, Vahid AD - Department of Industrial Engineering, University of Bojnord, Bojnord, Iran AD - Department of Computer Science, University of Bojnord, Bojnord, Iran Y1 - 2022 PY - 2022 VL - 10 IS - 3 SP - 367 EP - 385 KW - Single machine scheduling problem KW - transportation constraints KW - mixed integer linear programming KW - heuristic algorithm DO - 10.22124/jmm.2021.20310.1769 N2 - A multi-agent single machine scheduling problem with transportation constraints is studied. We assume that there are several independent agents placed in different geographical locations, each of them has several orders and each order includes different types of products. We use a simple and effective model to obtain maximum profit of the products. To have desired on-time deliveries, the minimization of the transportation costs and total tardiness costs are considered as objective functions. The main idea of this research is to develop a simple and integrated scheduling and transportation model which can be applied in many factories, chain stores, and so on. In order to solve this problem, a mixed integer linear programming (MILP) model is presented. Moreover, since solving large instances of the proposed MILP model is very time-consuming, a heuristic algorithm is presented. Implementing of two approaches on a variety of datasets show that the heuristic algorithm can provide good-quality solutions in very short time. UR - https://jmm.guilan.ac.ir/article_5244.html L1 - https://jmm.guilan.ac.ir/article_5244_b8a4ff25455fb0e927b7b92075552931.pdf ER -