Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains |
| |
Authors: | Morteza Rasti-Barzoki Seyed Reza Hejazi |
| |
Institution: | Department of Industrial & Systems Engineering, Isfahan University of Technology, Isfahan 84156-8311, Iran |
| |
Abstract: | In this paper, an integrated due date assignment and production and batch delivery scheduling problem for make-to-order production system and multiple customers is addressed. Consider a supply chain scheduling problem in which n orders (jobs) have to be scheduled on a single machine and delivered to K customers or to other machines for further processing in batches. A common due date is assigned to all the jobs of each customer and the number of jobs in delivery batches is constrained by the batch size. The objective is to minimize the sum of the total weighted number of tardy jobs, the total due date assignment costs and the total batch delivery costs. The problem is NP-hard. We formulate the problem as an Integer Programming (IP) model. Also, in this paper, a Heuristic Algorithm (HA) and a Branch and Bound (B&B) method for solving this problem are presented. Computational tests are used to demonstrate the efficiency of the developed methods. |
| |
Keywords: | Supply chain management Supply chain scheduling Due date assignment Batch delivery and tardy job |
本文献已被 ScienceDirect 等数据库收录! |