工件带拒绝费用的两个单机排序问题-运筹学与控制论专业论文.docx

iii iii 曲阜师范大学硕士学位 Two Single-Machine Scheduling Problems with Rejection Abstract In the classical scheduling model, we tend to assume that the machine must be used for processing all jobs within the given processing time. But in many practical applications, a job could not be processed if its processing time or processing cost is very large. Jobs are either rejected, in which case the rejection penalty has to be paid or received and processed on the machine. The objective functions are not the only the makespan and maximum lateness. The penalty should also be considered. We call it Scheduling with rejection. Three chapters are included in this thesis. In the first chapter, some notation, definition and basic background information about the subject are introduced. In the second chapter, Scheduling problems with family jobs and rejection on a (batching) single-machine are studied for the first time in this paper. We consider of several conditions with objective function to minimize maximum completion time and provide their nature. For problems 1, s fg family - jobs, rej Cmax +? ej and 1, s fg family - jobs, rej,b Cmax +? ej , the j? s approximation algorithms and some qualities are given and proved. j? s In the third chapter, Scheduling problems with family jobs and rejection on a s-batch single-machine are studied for the first time in this paper. We consider of several conditions with objective function to minimize maximum completion time and provide their nature. For problem 1, s fg family - jobs, rej, s - batch,b ? n Cmax ? ej the approximation algorithms and some qualities are given and proved. j? s Keywords ： Scheduling; Batch scheduling; Family jobs; Rejection; Approximation algorithm; 目 录 HYPERLINK \l _bookmark0 第一章 绪论 1 HYPERLINK \l _bookmark1 §1.1 排序 1 HYPERLINK \l _bookmark2 §1.2 计算复杂性 2 HYPERLINK \l _bookmark3 §1.3 P 类、NP 类和 NP 完备 3 HYPERLINK \l _bookmark4 §1.4 近似算法 4 HYPERLINK \l _b