Publication

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

Dominique de Werra
2010
Journal Articles

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. (C) 2009 Elsevier B.V. All rights reserved.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Chat with Graph Search

Exploring High-Performance and Energy-Efficient Architectures for Edge AI-Enabled Applications

Design Space Exploration for Partitioning Dataflow Program on CPU-GPU Heterogeneous System

Approximation Algorithms for Allocation and Network Design