A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

T. Kis, Dominique de Werra, Wieslaw Kubiak

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even if preemptions are restricted to integral times.

Original languageEnglish
Pages (from-to)129-132
Number of pages4
JournalOperations Research Letters
Volume38
Issue number2
DOIs
Publication statusPublished - Mar 2010

Fingerprint

Open Shop Scheduling
Preemptive Scheduling
Multiprocessor
Scheduling
Preemption
Minimization Problem
Scheduling Problem
Integral
Makespan

Keywords

  • Linear programming
  • Multiprocessor operations
  • Preemptive open shop scheduling

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Applied Mathematics
  • Industrial and Manufacturing Engineering
  • Software

Cite this

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. / Kis, T.; de Werra, Dominique; Kubiak, Wieslaw.

In: Operations Research Letters, Vol. 38, No. 2, 03.2010, p. 129-132.

Research output: Contribution to journalArticle

Kis, T. ; de Werra, Dominique ; Kubiak, Wieslaw. / A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. In: Operations Research Letters. 2010 ; Vol. 38, No. 2. pp. 129-132.
@article{c3d33ac29e154d04bd994642b4720c01,
title = "A projective algorithm for preemptive open shop scheduling with two multiprocessor groups",
abstract = "We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even if preemptions are restricted to integral times.",
keywords = "Linear programming, Multiprocessor operations, Preemptive open shop scheduling",
author = "T. Kis and {de Werra}, Dominique and Wieslaw Kubiak",
year = "2010",
month = "3",
doi = "10.1016/j.orl.2009.10.007",
language = "English",
volume = "38",
pages = "129--132",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

AU - Kis, T.

AU - de Werra, Dominique

AU - Kubiak, Wieslaw

PY - 2010/3

Y1 - 2010/3

N2 - We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even if preemptions are restricted to integral times.

AB - We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even if preemptions are restricted to integral times.

KW - Linear programming

KW - Multiprocessor operations

KW - Preemptive open shop scheduling

UR - http://www.scopus.com/inward/record.url?scp=75949092134&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=75949092134&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2009.10.007

DO - 10.1016/j.orl.2009.10.007

M3 - Article

AN - SCOPUS:75949092134

VL - 38

SP - 129

EP - 132

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 2

ER -