Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Order by Relevance | Title | Year of publication

Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals

Valery S. Gordon; F. Werner; O. A. Yanushkevich — 2001

RAIRO - Operations Research - Recherche Opérationnelle

This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, i.e., no two of them overlap (either they have at most...

Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals

Valery S. Gordon; F. Werner; O. A. Yanushkevich — 2010

RAIRO - Operations Research

This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, , their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, , no two of them overlap (either they have at most...

Page 1

Download Results (CSV)