Scheduling Problems In Supply Chain Management

This thesis concerns machine scheduling problem with delivery of the size of job coordination in two-stage supply chain. Both single machine and parallel machines cases are considered. The thesis is split up into four chapters. We first introduce some preliminary concepts related to the scheduling problems and supply chain management, and summarize recent results of supply chain scheduling problem with the size of job coordination in chapter 1.In chapter 2, we consider single machine scheduling problem with delivery of the size of job coordination, in which jobs are first processed on a single machine, and then delivered by a capacitated vehicle to a single customer. The size of jobs is different. The goal is to minimize the time when a last finished job arrives at its customer. When there are two vehicles and m vehicles, and only a customer, we denoted by 1â†'D, k = 1 |v = 2, c =z |C_max, 1â†'D, k = 1 |v = m, c = z ,( m≥2)| C_max.We respectively provide an optimal algorithm with the worst-case ratio of 3 2 .In chapter 3, we consider two parallel machines scheduling problem with delivery of the size of job coordination, in which jobs are first processed on a single machine, and then delivered by only one vehicle to two customers who are located two different places. The vehicle has limited capacity, and the size of jobs is different. The goal is to minimize the time when a last finished job arrives at its customer. We denoted by P₂â†'D, k = 2| v = 1, c =z| C_max. We propose an approximation algorithm with the worst-case ratio of 2 .In chapter 4, we give the future study and research.