The paper presents the first complete survey of scheduling problems with the late work criteria. Late work objective functions estimate the quality of a schedule based on durations of late parts of jobs, not taking into account the amount of delay for fully late jobs. The paper provides a formal definition of the late work parameter and compares the criteria based on it with other classical performance measures. It shows the relationship between the late work model and the imprecise computation model known from the hard real-time literature. Moreover, the paper presents a few real world applications of the late work objective function. The paper lists results obtained for nearly forty problems of scheduling jobs on a single machine, paralle...
The paper considers the problem of scheduling n jobs on a single machine to minimize the number of t...
In this paper, we examine the scheduling of jobs, each of which comprises a standard and a specific ...
In this paper we consider a single machine preemptive scheduling problem to minimize the weighted nu...
The paper concerns the application of a non-classical performance measure, a late work criterion (Y,...
AbstractThe paper concerns the application of a non-classical performance measure, a late work crite...
Scheduling is considered as a key task in many industries, such as project based scheduling, crew sc...
We consider the scheduling problem on unrelated parallel machines in order to minimize the total lat...
AbstractIn this paper we consider generalizing the objective criterion of minimizing maximum latenes...
We consider the problem of scheduling jobs on a single machine subject to given release dates and pr...
Based on different types of binary variables, three mixed-integer linear programming formulations fo...
A scheduling problem in considered on unrelated machines with the goal of total late work minimizati...
77 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980.This thesis addresses the prob...
This paper focuses on the problem of scheduling on a single machine to minimise the maximum lateness...
[[abstract]]This article considers a two-machine flow-shop scheduling problem of minimizing total la...
Abstract: Task scheduling is a wide research area with several scheduling techniques, each of which ...
The paper considers the problem of scheduling n jobs on a single machine to minimize the number of t...
In this paper, we examine the scheduling of jobs, each of which comprises a standard and a specific ...
In this paper we consider a single machine preemptive scheduling problem to minimize the weighted nu...
The paper concerns the application of a non-classical performance measure, a late work criterion (Y,...
AbstractThe paper concerns the application of a non-classical performance measure, a late work crite...
Scheduling is considered as a key task in many industries, such as project based scheduling, crew sc...
We consider the scheduling problem on unrelated parallel machines in order to minimize the total lat...
AbstractIn this paper we consider generalizing the objective criterion of minimizing maximum latenes...
We consider the problem of scheduling jobs on a single machine subject to given release dates and pr...
Based on different types of binary variables, three mixed-integer linear programming formulations fo...
A scheduling problem in considered on unrelated machines with the goal of total late work minimizati...
77 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980.This thesis addresses the prob...
This paper focuses on the problem of scheduling on a single machine to minimise the maximum lateness...
[[abstract]]This article considers a two-machine flow-shop scheduling problem of minimizing total la...
Abstract: Task scheduling is a wide research area with several scheduling techniques, each of which ...
The paper considers the problem of scheduling n jobs on a single machine to minimize the number of t...
In this paper, we examine the scheduling of jobs, each of which comprises a standard and a specific ...
In this paper we consider a single machine preemptive scheduling problem to minimize the weighted nu...