到达时间与工期同序的串行批处理机排序问题-应用数学专业论文.docx

Scheduling with agreeable arrival times and due dates on a serial batch processing machine Abstract In the wafer and other electronic products manufacturing system, we often put jobs finished processing from the former procedure on a pallet, and jobs on the same pallet as a batch are placed on the machine to process one by one. This equivalent to the situation of dynamic job arrivals. A batch starts to process after all jobs in this batch arrived. For each new batch, a constant set-up time is needed before the first job of the batch is processed. There isn’t a set-up time between jobs in the same batch. Moreover, the machine can’t process any jobs during a set-up time. Jobs in the same batch have the same start processing time and completion time. The processing time of a batch is equal to the sum of processing time among all jobs in this batch. And the completion time of each job in the batch coincides with the completion time of the last job in this batch. All of the jobs on the pallet can be deliveried after they have been processed. In this paper, we consider different objective functions under the assumption that job arrival times and due dates are agreeable. The specific content of this paper is summarized as follows: All of the jobs have only two distinct arrival times, but job due dates, processing times and weights can have a number of different values. We show that the problem of minimizing the weighted number of late jobs is NP-hard. Besides, we study the characterizations of the optimal scheduling, present a pseudo-polynomial time dynamic programming algorithm and analyze the complexity of algorithms. Finally, we show the efficiency of the proposed algorithm by a numeral example. When jobs have several different arrival times and processing times are equal, for the particular case above, we consider two distinct objective functions. When job due dates are given, different schedulings make some jobs complete on time and others delay. In this paper, we con