By Topic

Parallel processor scheduling problems with optimal due interval

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

2 Author(s)
A. Janiak ; Inst. of Eng. Cybern., Wroclaw Univ. of Technol., Poland ; M. Marek

In the paper we consider two problems, in which we should find a schedule of jobs on parallel processors and a common due interval determination for all jobs such that the criterion value is minimized. A due interval is a generalization of the classical due date and describes a time interval, in which a job should be finished. In the first problem we minimize the sum of the total tardiness, total earliness and due interval size. In the second problem, we minimize the weighted maximum of the following three parts: maximum tardiness, maximum earliness and due interval size. We proved that the considered problems are equivalent to the strong NP-hard classical scheduling problem with the parallel processors subject to the minimization of the makespan criterion.

Published in:

Computer Science, 2004. ENC 2004. Proceedings of the Fifth Mexican International Conference in

Date of Conference:

20-24 Sept. 2004