Minimizing due date assignment, holding, distribution costs and maximum tardiness in supply chain

In this paper, four of decisions that are effective in production systems, are modeled concurrently: due date assignment, production scheduling, holding cost and outbound distribution scheduling. These four decisions are made in the market, production system, transport scheduling and storehouse. In the present paper, we study minimizing total costs that includes maximum tardiness, due date assignment, delivery and holding cost on a single machine for multi-customer. Mixed Integer Non-Linear programming (MINLP) and a Mixed Integer Programming (MIP) are applied for the solution. This problem is NP-hard, thus Multi-Objective Particle Swarm Optimization algorithm (MOPSO), is used for solution of large-scale instances. This paper is the first time that has considered holding costs and has been used MOPSO algorithm for finding optimal solution. The computational results showed MOPSO algorithm has good performance

Keywords:

Supply chain scheduling , due date assignment , holding costs , multi-objective Particle Swarm Optimization