2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) 2013
DOI: 10.1137/1.9781611973198.10
|View full text |Cite
|
Sign up to set email alerts
|

Order constraints for single machine scheduling with non-linear cost

Abstract: International audienceTypically in a scheduling problem we are given jobs of different processing times $p_j$ and different priority weights $w_j$, and need to schedule them on a single machine in order to minimize a specific cost function. In this paper we consider the non-linear objective function $\sum w_j C_j^\beta$, where $C_j$ is the completion time of job $j$ and $\beta>0$ is some arbitrary real constant. Except for $\beta=1$ the complexity status of this problem is open. Past research mainly focused on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 19 publications
0
14
0
Order By: Relevance
“…In addition to the above rules found in the literature, Dürr and Vásquez [4] stated the conjecture local precedence implies global precedence for the scheduling problems with a penalty function f (t) := t β , β > 0. Formally, the conjecture was stated as follows.…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…In addition to the above rules found in the literature, Dürr and Vásquez [4] stated the conjecture local precedence implies global precedence for the scheduling problems with a penalty function f (t) := t β , β > 0. Formally, the conjecture was stated as follows.…”
Section: Related Workmentioning
confidence: 99%
“…Recently, Dürr and Vásquez [4] provided new rules and generalized existing ones for a general penalty function f (t) := t β , β > 0. An extensive experimental study analyzed the effect of these rules to the performance of the branch-and-prune search.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations