Single machine scheduling problems with controllable processing times and total absolute differences penalties

Single machine scheduling problems with controllable processing times and total absolute differences penalties

0.00 Avg rating0 Votes
Article ID: iaor20084389
Country: Netherlands
Volume: 177
Issue: 1
Start Page Number: 638
End Page Number: 645
Publication Date: Feb 2007
Journal: European Journal of Operational Research
Authors: ,
Abstract:

In this paper, we consider single machine scheduling problem in which job processing times are controllable variables with linear costs. We concentrate on two goals separately, namely, minimizing a cost function containing total completion time, total absolute differences in completion times and total compression cost; minimizing a cost function containing total waiting time, total absolute differences in waiting times and total compression cost. The problem is modelled as an assignment problem, and thus can be solved with the well-known algorithms. For the case where all the jobs have a common difference between normal and crash processing time and an equal unit compression penalty, we present an O(n log n) algorithm to obtain the optimal solution.

Reviews

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