Citation
Bounding schemes for the parallel processors scheduling problem with release date, delivery time and with no-idle time constraint. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 393-402, 2015.
Paper
Abstract
In this paper, we address the parallel processors scheduling problem with release date, delivery time and no-idle time. In this problem we are given a system composed of parallel processors intended to treat a family of tasks. These tasks are characterized by a release date (arrival time), processing time and delivery time. In addition, the idle time between consecutive tasks is not allowed during the treatment on each processor. The no-idle time constraint is intended to avoid wasting the consumed energy while treating tasks. The objective is to provide a feasible schedule that minimizes the completion time of the last treated task (makespan). In order to solve this optimization scheduling problem we propose a tight and new lower bound, which is based on the optimal solution of a relaxed parallel processors scheduling problem. In addition a family of two-phase heuristics, providing a near optimal solution is presented. More precisely, Phase 1 is intended to construct an initial feasible schedule that is improved in Phase 2. Finally, we present the results of extensive computational experiments in order to evaluate the performance of the proposed procedures.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2015-393-402-P, author = {L. Hidri and A. Gazdar },
title = {Bounding schemes for the parallel processors scheduling problem with release date, delivery time and with no-idle time constraint },
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {393--402},
note = {Paper},
abstract = { In this paper, we address the parallel processors scheduling problem with release date, delivery time and no-idle time. In this problem we are given a system composed of parallel processors intended to treat a family of tasks. These tasks are characterized by a release date (arrival time), processing time and delivery time. In addition, the idle time between consecutive tasks is not allowed during the treatment on each processor. The no-idle time constraint is intended to avoid wasting the consumed energy while treating tasks. The objective is to provide a feasible schedule that minimizes the completion time of the last treated task (makespan). In order to solve this optimization scheduling problem we propose a tight and new lower bound, which is based on the optimal solution of a relaxed parallel processors scheduling problem. In addition a family of two-phase heuristics, providing a near optimal solution is presented. More precisely, Phase 1 is intended to construct an initial feasible schedule that is improved in Phase 2. Finally, we present the results of extensive computational experiments in order to evaluate the performance of the proposed procedures. },
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-393-402-P.pdf} }