Online deadline scheduling with preemption penalties

Online deadline scheduling with preemption penalties

0.00 Avg rating0 Votes
Article ID: iaor20113835
Volume: 60
Issue: 4
Start Page Number: 542
End Page Number: 549
Publication Date: May 2011
Journal: Computers & Industrial Engineering
Authors: , , , ,
Keywords: job shop, penalty functions
Abstract:

This paper presents a study of the problem of online deadline scheduling under the preemption penalty model of Zheng, Xu, and Zhang (2007). In that model, each preemption incurs a penalty of ρ times the weight of the preempted job, where ρ ≥ 0 is the preemption penalty parameter. The objective is to maximise the total weight of jobs completed on time minus the total penalty.

Reviews

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