Citation
Scheduling with Special Case of Multipurpose Machines. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 88-95, 2007.
Paper
Abstract
We consider the problem of minimizing the makespan on m special multipurpose machines (called ordered parallel machines) M_1, . . . ,M_m in which the execution of each job J_i (1 <= i < n) requires a time p_i and a machine among a subset M_h_i , . . . ,M_m of machines. We prove the NP-hardness of the general problem and present some polynomial subproblems. Heuristics with an exact algorithm of branch and bound type are also presented with numerical experimentations.
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{2007-088-095-P, author = {M. Boudhar and H. Tchikou},
title = {Scheduling with Special Case of Multipurpose Machines},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {88--95},
note = {Paper},
abstract = {We consider the problem of minimizing the makespan on m special multipurpose machines (called ordered parallel machines) M_1, . . . ,M_m in which the execution of each job J_i (1 <= i < n) requires a time p_i and a machine among a subset M_h_i , . . . ,M_m of machines. We prove the NP-hardness of the general problem and present some polynomial subproblems. Heuristics with an exact algorithm of branch and bound type are also presented with numerical experimentations.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-088-095-P.pdf} }