Citation
Modeling the single-processor scheduling problem with time restrictions as a parallel machine scheduling problem. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 325-330, 2015.
Paper
Abstract
This paper addresses the single processor scheduling problem with time restrictions. The problem is new in the scheduling literature and was described for the ?rst time by Braun et al. in [3]. A set of n jobs are simultaneously available for processing, nonpreemptively, on a single processor which can handle only one job at a time. Furthermore, the number of jobs being executed during any time period of length ? > 0 is less than or equal to a given integer value B ? 2. The objective function is to minimize the makespan Cmax. We present a mixed integer programming (MIP) formulation to solve this problem optimally. In addition, we show that this problem can also be considered as a B+1 parallel machine scheduling problem with one dedicated machine among them. The performance of the models are tested by running them on randomly generated instances
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-325-330-P, author = {R. Benmansour and O. Braun and H. Allaoui},
title = {Modeling the single-processor scheduling problem with time restrictions as a parallel machine scheduling problem},
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 = {325--330},
note = {Paper},
abstract = { This paper addresses the single processor scheduling problem with time restrictions. The problem is new in the scheduling literature and was described for the ?rst time by Braun et al. in [3]. A set of n jobs are simultaneously available for processing, nonpreemptively, on a single processor which can handle only one job at a time. Furthermore, the number of jobs being executed during any time period of length ? > 0 is less than or equal to a given integer value B ? 2. The objective function is to minimize the makespan Cmax. We present a mixed integer programming (MIP) formulation to solve this problem optimally. In addition, we show that this problem can also be considered as a B+1 parallel machine scheduling problem with one dedicated machine among them. The performance of the models are tested by running them on randomly generated instances},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-325-330-P.pdf} }