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

Tamás Kis, Dominique de Werra, Wieslaw Kubiak

Research output: Contribution to journalArticle

11 Citations (Scopus)


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
Issue number2
Publication statusPublished - Mar 1 2010



  • Linear programming
  • Multiprocessor operations
  • Preemptive open shop scheduling

ASJC Scopus subject areas

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

Cite this