Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
476355 | Computers & Operations Research | 2006 | 12 Pages |
Abstract
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The cost functions are job dependent and asymmetric. The problem consists of two sub-problems. The first one is to find a sequence of jobs and the second one is to find the job completion times that are optimal for the given sequence. We consider the second sub-problem and propose an algorithm solving the problem in O(nlogn)O(nlogn) time.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jakub Bauman, Joanna Józefowska,