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

  • Authors:

  • TamáS Kis;Dominique De Werra;Wieslaw Kubiak

  • Affiliations:

  • Computer and Automation Research Institute, Kende utca 13-17, 1111 Budapest, Hungary;Institute of Mathematics, Ecole Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland;Faculty of Business Administration, Memorial University, St. John's, NL, Canada

  • Venue:
  • Operations Research Letters
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.