Single Machine Serial Batching Scheduling With Deteriorating Job Processing Times

Scheduling is an important part of the operations research which have very important research significance. In traditional scheduling problems, it is assumed that the job processing times are fixed. However, in practical manufacture, the processing time of each job may depend on some factors, such as its basic processing times, its deteriorating rate, its starting time or the actual resource allocation to it.In chapter 1 we mainly introduce the background of scheduling problem, the current situation of batch scheduling problem, the related mathematical symbols and present some preparation works in this paper.In chapter 2 we consider the scheduling problems of a single serial-batching machine with independent setup time and linear deteriorating job processing time.Jobs have different basic processing times, but they have the same deterioration rate.The actual processing time ofiJ is indicated as a linear function of its starting time and basic processing time. The objective is to determine the number of batches and the optimal sequence in batches, so as to minimize the makespan. All the jobs are first partitioned into serial batches and then processed on a single serial-batching machine.Before each batch is processed, an independent constant setup time is required. An optimal algorithm is presented to solve the problem of minimizing the makespan with modifying the Algorithm R-FBLDR.In chapter 3 we consider the scheduling problems of production and transportation in a two-stage supply chain. A set of jobs is processed contiguously and completed together when the processing of the last job in the batch is finished. After the batches are completed, the batches are delivered to a customer by a single vehicle with limited capacity during the transportation stage, and the vehicle can only deliver one batch at one time. The round trip time between the manufacturer and the customer is defined as a constant T. We mainly consider the scheduling model with a buffer for storing the processed batches before transportation. i.e, the manufacturer can place the finished batch from the machine into the buffer and continue to process the next batch on the machine immediately no matter whether the vehicle returns to the manufacturer or not. The objective is to determine the number of the first batch and batchsequencing so as to minimize the makespan.Finally, we summarize this paper, and provide some related problems needed to study in the future.