Supply Chain Scheduling in a Make-to-Order Environment
We consider a make-to-order productiondistribution system with one supplier and multiple customers. A set of jobs with due dates need to be processed by the supplier and delivered to the customers upon completion. The supplier can process one job at a time without preemption. Each customer is at a distinct location and only jobs from the same customer can be batched together for delivery. We consider the single machine scheduling problems in which the jobs belong to different families. A setup time is incurred for a job if it is the first job to be processed on a machine or its processing on a machine follows a job that belongs to another family. We consider two due date related objectives: the first is to minimize the weighted sum of the maximum lateness of jobs to customers and the delivery cost. The second objective is to minimize the weighted sum of thenumber of late jobs and the delivery cost. We give two optimal algorithms to solve the problems.
supply chain scheduling batch delivery make-to-order
Lei Wang Guoqing Wang
Department of Business Administration Jinan University, Guangzhou, P.R.China
国际会议
香港·广州
英文
352-355
2010-07-25（万方平台首次上网日期，不代表论文的发表时间）