Supply Chain Scheduling In A Make-to-Order Environment

Scheduling problems consist in deciding the appropriate processing sequence on the machines under certain production constraints, in order to optimize one or more given objectives. Supply chain management is the plan,coordination and optimization of the whole supply chain system. Production and delivery operations are the two key operational functions in a supply chain. This thesis mainly concerns some scheduling problems in supply chain management. The objective is to find the optimal production and delivery scheduling when considering both the cost and customer satisfaction. The main contribution of this thesis can be summarized as follows:First this thesis study the supply chain scheduling problems with multiple job families. The jobs belong to different families and they need to be delivered to multiple customers after processing. 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. Processed jobs are delivered in batches to their respective customers, each shipment incurs a delivery cost and takes a fixed amount of time. We study four different objectives. The first is to minimize the weighted maximum completion time of jobs and delivery costs. The second is to minimize the weighted total completion time of jobs and delivery costs. The third is to minimize the weighted maximum lateness of jobs and delivery costs. The last is to minimize the weighted total number of late jobs and delivery costs. Optimal algorithms are proposed to solve the problems, and a numerical example is given to demonstrate the implementation of the algorithms.Secondly this thesis study the supply chain scheduling with deadlines. A set of orders with deadlines needs to be processed by the manufacturer and delivered to the customers upon completion. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the manufacturer and order delivery from the manufacturer to the customers that minimize the total distribution cost with deadline constraint. We study the solvability of multiple cases of the problem by providing efficient algorithms.Thirdly this thesis study the supply chain scheduling with multiple transportation modes. A set of orders with deadlines needs to be processed by the manufacturer and delivered to the customers upon completion. The manufacturer adopts a commit-to-delivery business mode. The problem is to find a joint schedule of order processing at the manufacturer and order delivery from the manufacturer to the customers that minimize the total distribution cost with deadline constraint. We study the solvability of multiple cases of the problem by providing efficient algorithms.Finally this thesis study the supply chain scheduling with due date assignment. A set of orders needs to be processed by the manufacturer and delivered to the customers upon completion. Each customer has a specific acceptable lead time. The manufacturer assigns a due date for one order by negotiating with the customers. The problem is to assign appropriate due date for the orders, and find a joint schedule of order processing at the manufacturer and order delivery from the manufacturer to the customers that minimize the total cost. We study two different objectives. The first is to minimize the total number of late order penalty, due date assignment and delivery costs. The second is to minimize the total tardiness penalty, due date assignment and delivery costs. We study the solvability of multiple cases of the problem by providing efficient algorithms.