| 一个不同时刻加工成本有差异的单机排序问题 |
| |
| 引用本文： | 顾燕红,甘小冰.一个不同时刻加工成本有差异的单机排序问题[J].运筹学学报,2006,10(2):37-45. |
| |
| 作者姓名： | 顾燕红 甘小冰 |
| |
| 作者单位： | 1. 深圳大学理学院数学系,深圳,518060
2. 深圳大学管理学院信息与系统管理系,深圳,518060 |
| |
| 基金项目： | This work is partially supported by NSFC 70571059
SZU R／D Fund(Project 200552)． |
| |
| 摘 要： | 考虑一个单机排序问题:一批工件在零时刻到达可加工,加工时不可中断,在某个给定时间区间外的加工工时将招致额外的加工成本;当时间区间为给定参数时,要求确定一个最优加工序,当时间区间为决策变量时,要求找到一个最优序及最优区间位置, 由此来最小化总额外加工成本．文中对各种区间外单位加工工时之额外成本的情况给出了多项式算法, NP-hardness的证明及伪多项式时间算法．
|
| 关 键 词： | 运筹学 排序 时间区间 额外加工费 NP-hard 算法 |
| 收稿时间： | 2005-12-27 |
| 修稿时间： | 2005年12月27 |
A Single Machine Scheduling Problem with Different Processing Costs |
| |
| Gu Yanhong,Gan Xiaobing.A Single Machine Scheduling Problem with Different Processing Costs[J].OR Transactions,2006,10(2):37-45. |
| |
| Authors: | Gu Yanhong Gan Xiaobing |
| |
| Institution: | 1. Applied Mathematics Department, College of Science, Shenzhen University, Shenzhen 518060, China;2.Dept. of Information and System Management, College of Management, Shenzhen University, Shenzhen 518060, China |
| |
| Abstract: | This paper addresses a scheduling problem of n jobs available at time zero on a single machine, in which any preemption is prohibited and any processing time unit out of a tune window with given length incurs some extra operation payment for each job. The aim is to minimize the total extra processing expenditure of these n jobs. Two scenarios of this problem are investigated: one where the position of that time window is a specified parameter and the other where it is also a decision variable. For all types of extra cost, polynomial and pseudopolynomial algorithms are developed respectively. Moreover the NP-hardness on a complicated case is proved. |
| |
| Keywords: | Operation research scheduling time window extra operation cost NP-hard algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
