By Topic

Minimizing the number of late jobs in single machine scheduling with nested execution intervals

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Cyril Briand ; LAAS-CNRS, Université de Toulouse, UPS, 7 av. du Colonel Roche, 31077 Toulouse, France. briand@lass.fr ; Samia Ourari ; Brahim Bouzouia

This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Job execution intervals are assumed to be nested each inside the other, like Russian dolls. The objective is to minimize the number of late jobs. For this problem, denoted as 1|ri , nested| SigmaUi, a new dominance condition and an optimal O(n3) solving procedure are proposed

Published in:

2006 International Conference on Service Systems and Service Management  (Volume:2 )

Date of Conference:

25-27 Oct. 2006