While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...

in this paper by combining caching and replication techniques proposed a hybrid heuristic method based on the greedy algorithm to use the benefit of each other techniques. the algorithm in each interaction compares all the contents and one that made the best benefit value is selected for replication. the hybrid approach tested in a simulation environment and the results show that hybrid algorit...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...

Integrated production-distribution planning (PDP) is one of the most important approaches in supply chain networks. We consider a supply chain network (SCN) to consist of multi suppliers, plants, distribution centers (DCs), and retailers. A bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...