|
|||||
|
|
Scheduling problems on tardiness penalty and earliness award with simply linear processing time |
|
| Authors: | Ying Yu Zhen Lu Shi-jie Sun Long-min He Jing-di Hu |
| Affiliation: | 1. Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China;Guangsha College of Applied Constraction Technology, Dongyang 322100, Zhejiang, P. R. China 2. Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China 3. Guangsha College of Applied Constraction Technology, Dongyang 322100, Zhejiang, P. R. China |
| Abstract: | In this paper, a single-machine scheduling model with a given common due date and simple linear processing times was considered. The objective is the total weighted tardiness penalty and earliness award. Some polynomial time solvable cases for this problem are given. A dynamic programming algorithm was provided and a branch and bound algorithm for general case of the problem was provided based on a rapid method for estimating the lower bound. |
| Keywords: | scheduling single machine tardiness earliness |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ | |
| 点击此处可从《上海大学学报(英文版)》浏览原始摘要信息 | |
| 点击此处可从《上海大学学报(英文版)》下载全文 | |