Output details
11 - Computer Science and Informatics
University of Leicester
Article title
Online scheduling with preemption or non-completion penalties
Type
D - Journal article
Title of journal
Journal of Scheduling
Article number
-
Volume number
N/A (online publ
Issue number
-
First page of article
1
ISSN of journal
1094-6136
Year of publication
2013
URL
-
Number of additional authors
0
Additional information
<12> Scheduling jobs with commitment has received increasing attention due to its practical importance in e.g. supply chain management. While there are many papers in this area, this paper is the first to use a parameter to quantify the cost of breaking a commitment, and to analyse the performance of algorithms with respect to this parameter. This paper (the COCOON'10 version) is cited in a variety of application domains ranging from production scheduling (Zheng et al, J. Comb. Opt. 2012) to charging of electric vehicles (Chen et al, IEEE SmartGridComm 2012) to agent-based e-commerce (Wu et al, AMEC 2013).
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
