Search Results - subject:"Multiprocessor scheduling"

Packing-based branch-and-bound for discrete malleable task scheduling

Braune, Roland - In: Journal of scheduling : JOS 25 (2022) 6, pp. 675-704

Persistent link: https://www.econbiz.de/10013453989

A matheuristic approach to large-scale avionic scheduling

Karlsson, Emil; Rönnberg, Elina; Stenberg, Andreas; … - In: The practice and theory of automated timetabling (2018), (pp. 425-459). 2021

Persistent link: https://www.econbiz.de/10012605626

A note on posterior tight worst-case bounds for longest processing time schedules

Ho, Johnny; Massabo, Ivar; Paletta, Guiseppe; … - In: 4OR : a quarterly journal of operations research 17 (2019) 1, pp. 97-107

Persistent link: https://www.econbiz.de/10011991615

Approximation for scheduling on uniform nonsimultaneous parallel machines

Grigoriu, Liliana; Friesen, Donald K. - In: Journal of scheduling 20 (2017) 6, pp. 593-600

Persistent link: https://www.econbiz.de/10011784942

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

Kellerer, Hans; Kotov, Vladimir N.; Gabay, Michaël - In: Journal of scheduling 18 (2015) 6, pp. 623-630

Persistent link: https://www.econbiz.de/10011391844

TABU SEARCH FOR MULTIPROCESSOR SCHEDULING: APPLICATION TO HIGH LEVEL SYNTHESIS

SEVAUX, MARC; SINGH, ALOK; ROSSI, ANDRÉ - In: Asia-Pacific Journal of Operational Research (APJOR) 28 (2011) 02, pp. 201-212

This paper describes a tabu search approach for a multiprocessor scheduling problem, where a list of jobs has to be …

Persistent link: https://www.econbiz.de/10009642916

Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors

Manaa, Adel; Chu, Chengbin - In: European Journal of Industrial Engineering 4 (2010) 3, pp. 265-279

In this paper, we consider the problem of scheduling tasks on two dedicated processors where some tasks need to be processed only by the first processor and some others by the second processor; the remaining tasks, however, need both processors simultaneously. Tasks have release dates and have...

Persistent link: https://www.econbiz.de/10008755652

On polynomial solvability of two multiprocessor scheduling problems

Girlich, Eberhard; Tarnowski, Alexander G. - In: Mathematical Methods of Operations Research 50 (1999) 1, pp. 27-51

We discuss a new approach for solving multiprocessor scheduling problems by using and improving results for guillotine … also consider two multiprocessor scheduling problems and prove that they can be solved in polynomial time. Copyright …

Persistent link: https://www.econbiz.de/10010949981

On polynomial solvability of two multiprocessor scheduling problems

Girlich, Eberhard; Tarnowski, Alexander G. - In: Computational Statistics 50 (1999) 1, pp. 27-51

Persistent link: https://www.econbiz.de/10010759196

Thek-partitioning problem

Babel, Luitpold; Kellerer, Hans; Kotov, Vladimir - In: Computational Statistics 47 (1998) 1, pp. 59-82

minimal,k-partitioning is strongly related to the classical multiprocessor scheduling problem of minimizing the makespan on …

Persistent link: https://www.econbiz.de/10010847785