Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling |
| |
Authors: | Wlodzimierz Szwarc Samar K Mukhopadhyay |
| |
Institution: | 1.University of Wisconsin-Milwaukee,USA |
| |
Abstract: | This paper deals with scheduling n jobs on a single machine in order to minimize the weighted sum of squared waiting times of the jobs. We present a powerful decomposition mechanism, based on a precedence relation concept, that easily handles problems of the size n = 50 and 100 where the processing times and penalties are independently drawn from a uniform distribution. This mechanism is incorporated along with new branching rules in a branch-and-bound scheme that efficiently handles tough problems of the size 20 and 50. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |