Citation

Bouyahia, Z Stability of probabilistic scheduling problems with precedence constraints and weighted completion time objective. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 189-202, 2015.

Paper

Abstract

We address the probabilistic problem of scheduling n tasks on m parallel identical machines under precedence constraints to minimize the probabilistic total weighted nishing time. Probabilities are associated explicitly with the data in the formulation of the problem to provide a natural model. Two strategies are proposed to solve the probabilistic problem Pm|qi, prec|?wiCi : The rst, called re-optimization, consists in solving separately each potential instance, the second called a priori strategy consists in updating a scheduling for the initial problem by means of a modication method. The aim of this paper is to dene and to study the behavior of the a priori strategy relying on natural modication method. Special care is devoted to evaluate the performance of the reoptimization and the a priori strategies.

pdf

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-189-202-P, author = {Z. Bouyahia},
title = {Stability of probabilistic scheduling problems with precedence constraints and weighted completion time objective},
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 = {189--202},
note = {Paper},
abstract = { We address the probabilistic problem of scheduling n tasks on m parallel identical machines under precedence constraints to minimize the probabilistic total weighted nishing time. Probabilities are associated explicitly with the data in the formulation of the problem to provide a natural model. Two strategies are proposed to solve the probabilistic problem Pm|qi, prec|?wiCi : The rst, called re-optimization, consists in solving separately each potential instance, the second called a priori strategy consists in updating a scheduling for the initial problem by means of a modication method. The aim of this paper is to dene and to study the behavior of the a priori strategy relying on natural modication method. Special care is devoted to evaluate the performance of the reoptimization and the a priori strategies.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-189-202-P.pdf} }