نتایج جستجو برای: precedence constraints
تعداد نتایج: 189129 فیلتر نتایج به سال:
Abstract We consider a variant of the NP-hard problem assigning jobs to machines minimize completion time last job. Usually, precedence constraints are given by partial order on set jobs, and each job requires all its predecessors be completed before it can start. In this paper, we different type relation that has not been discussed as extensively is called OR-precedence. for start, require at ...
Formal results for precedence constrained, real-time scheduling of unit time tasks are extended to arbitrary timed tasks with preemp-tion. An exact characterisation of the EDF-like schedulers that can be used to transparently enforce precedence constraints among tasks is shown. These extended results are then integrated with a well-known protocol that handles real-time scheduling of tasks with ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید