Common due window size and location determination in a single machine scheduling problem |
| |
Authors: | S D Liman S S Panwalkar S Thongmee |
| |
Affiliation: | 1.Texas Tech University,USA;2.i2 Technologies, Inc.,USA |
| |
Abstract: | We consider a single machine static and deterministic scheduling problem in which jobs have a common due window. Jobs completed within the window incur no penalties, other jobs incur either earliness or tardiness penalties. The objective is to find the optimal size and location of the window as well as an optimal sequence to minimise a cost function based on earliness, tardiness, window size, and window location. We propose an O(n log n) algorithm to solve the problem. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|