Minimizing the earliness–tardiness costs on a single machine

Minimizing the earliness–tardiness costs on a single machine

0.00 Avg rating0 Votes
Article ID: iaor20072272
Country: United Kingdom
Volume: 33
Issue: 11
Start Page Number: 3219
End Page Number: 3230
Publication Date: Nov 2006
Journal: Computers and Operations Research
Authors: ,
Keywords: computational analysis
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(n log n) time.

Reviews

Required fields are marked *. Your email address will not be published.