Minimizing the Range of Lateness on a Single Machine |
| |
| Authors: | Sushil Gupta Tapan Sen |
| |
| Affiliation: | 1.Department of Decision Sciences,Florida International University and School of Management, University of Tennessee,Chattanooga |
| |
| Abstract: | This paper gives an optimizing algorithm to minimize the range of lateness, that is the difference between the maximum and minimum lateness, of jobs in a single-machine sequencing problem. The procedure is based on a branch-and-bound technique. One example has been solved to illustrate the method. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
