Citation

Kravchenko, S. A and Werner, F Parallel machine problems with equal processing times: a survey. Journal of Scheduling, 14 (5): 435-444, 2011.

Selected


Abstract

The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. In this paper, we survey existing approaches for the problem class considered.


pdf

There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)


doi

The doi for this publication is 10.1007/s10951-011-0231-3 You can link directly to the original paper, via the doi, from here

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

@ARTICLE{2011-435-444-SI, author = {S. A. Kravchenko and F. Werner},
title = {Parallel machine problems with equal processing times: a survey},
journal = {Journal of Scheduling},
year = {2011},
volume = {14},
pages = {435--444},
number = {5},
note = {Selected},
abstract = {The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. In this paper, we survey existing approaches for the problem class considered.},
doi = {10.1007/s10951-011-0231-3},
owner = {user},
timestamp = {2012.05.25} }