For the current REF see the REF 2021 website REF 2021 logo

Output details

10 - Mathematical Sciences

University of Greenwich

Return to search Previous output Next output
Output 0 of 0 in the submission
Article title

A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines

Type
D - Journal article
Title of journal
SIAM Journal on Discrete Mathematics
Article number
-
Volume number
27
Issue number
1
First page of article
186
ISSN of journal
0895-4801
Year of publication
2013
Number of additional authors
2
Additional information

This research has been undertaken within the project EP/J019755/1 “Linking Submodular Optimisation to Scheduling with Controllable Parameters” funded by the EPSRC (2012-2013). Scheduling with controllable processing time, an active research area in the 1980-90s, stagnated in the late 1990s mainly because of lack of new methodological ideas. Since 2005, the team of authors have pursued a novel approach based on the reformulation of relevant scheduling problems in terms of mathematical programming problems with submodular constraints. This paper is a good illustration of the power of this “schedule-free” approach and contains several breakthrough results for the bicriteria scheduling models.

Interdisciplinary
-
Cross-referral requested
-
Research group
2 - Statistics and Operational Research Group
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-