Integrated Production And Delivery Scheduling With Due Date Assignment And Two Competing Customers

With the rapid development of the world economy and the continuous progress of information technology,supply chain has gradually become an urgent research direction for many enterprises.In the supply chain scheduling,production and distribution are two extremely important parts.Compared with previous independent research,integrated production and delivery scheduling can effectively improve the overall performance of the supply chain,and focuses on the cooperation in operational affairs.As consumers are increasingly sensitive to the timeliness of product production and delivery.Therefore,scheduling problems with due date assignment are emerging in classical integrated production and distribution scheduling problems.Therefore,this paper considers integrated production and delivery scheduling problem with due date assignment and two competing customers.Prior to the planning cycle,the manufacturer received orders from two different customers.All the jobs of the first customer have a common due date,which is a decision variable to be determined by the decision maker in the context of the problem,whereas the due date of the jobs of the second customer are exogenously given.The jobs of each customer are processed in serial batches and the processing time of each batch is equal to the sum of the processing time of all the jobs in the batch.Finished jobs are kept in inventory,if necessary,and it will be delivered to the corresponding customers in batches directly by the third-party logistics.The transportation time of each batch of job is equal to the completion time of the job in this batch,where the batch size can be bounded or unbounded.This paper studies a two-objective optimization problem in which the due date of the first customer is determined according to the problem situation and optimization objective,and the due date of another customer has been given in advance.The goal I s to find the optimal delivery time and the optimal processing sequence of the jobs,so as to minimize the objective value of the first customer,subject to the objective value of the second customer not exceeding a given threshold.The first customer wishes to minimize the total cost comprising the earliness,weighted number of tardy jobs,job holding,due date assignment and batch delivery costs,while the second customer seeks to minimize one of the following criteria plus the batch delivery cost: the maximum value of a regular scheduling criterion,total completion time,and weighted number of tardy jobs.For each of the problems considered,this paper studies the structural properties and computational complexity of the problems and develop exact or approximation solution algorithms.The large-scale numerical experiments are used to verify the effectiveness of the proposed algorithm.The research results show that the purposed algorithms is not sensitive to the batch size of the first customer,but it is more sensitive to the batch size of the second customer.