In this paper we consider the non-linear objective function ΣwjCβj, where Cj is the completion time of job j and β > 0 is some arbitrary real constant. Except ...
Typically 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 ...
Dec 18, 2013 · Typically in a scheduling problem we are given jobs of different processing times pj and different priority weights wj, and need to schedule ...
Cj is the completion time of job j and β > 0 is some arbitrary real constant. Except for β = 1 the complexity status of this problem is open.
Numerical methods for single machine scheduling with non-linear cost functions to minimize total cost. Journal of the Operational Research Society, pages 125-- ...
We present an approach that allows to find an optimal schedule with respect to different scheduling criteria, such as the minimization of makespan, lateness or ...
The problem of scheduling n jobs with a single machine where each job has a differentiable cost function and the total cost being minimized is studied.
When considering nonlinear cost functions, there are apparently no local or global order constraints which immediately imply an optimal schedule (cf. [9]) ...
People also ask
What is single-machine sequencing problem with precedence constraints?
What is the concept of single-machine scheduling?
We study the problem of scheduling n jobs in a single machine. The jobs are released at different points in time and subjected to job-dependent due dates. The ...
The practical efficiency of these methods heavily depends on the utilization of structural properties of optimal schedules such as order constraints, i.e., ...