General time schedule
Similarity:
Similarity:
Jacek Błażewicz, Piotr Formanowicz (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: non-preemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may be suspended and continued without additional cost when the machine becomes available. In...
Nelson Maculan, Stella C.S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza (2010)
RAIRO - Operations Research
Similarity:
We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.
Ewa Figielska (2009)
Control and Cybernetics
Similarity:
Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Fengxiang Zhang, Yanfeng Zhai, Jianwei Liao (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems which are scheduled by EDF and FP. The proposed analysis has a polynomial time complexity and no restrictions on task parameters, where the relative deadline of each task could be less than,...
Jacek Błażewicz, Paolo Dell'Olmo, Maciej Drozdowski (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.