About: Scheduling with Start Time Related Deadlines     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Není k dispozici (cs)
  • This paper presents a scheduling problem for a monoprocessor without preemption with timing constraints given by a task-on-node graph. The precedence relations are given by an oriented graph where edges are related either to the minimum time or to the maximum time elapsed between start times of the tasks. The processing time of a given task is associated to a given node in the oriented graph. The problem, finding an optimal schedule satisfying the timing constraints while minimizing makespan Cmax, is solved by two approaches. The first is implemented as a B&B algorithm using a Critical Path estimation and estimation of Remaining Processing TimeThe second solution is based on ILP. Experimental results show comparison of the B&B and ILP solution.
  • This paper presents a scheduling problem for a monoprocessor without preemption with timing constraints given by a task-on-node graph. The precedence relations are given by an oriented graph where edges are related either to the minimum time or to the maximum time elapsed between start times of the tasks. The processing time of a given task is associated to a given node in the oriented graph. The problem, finding an optimal schedule satisfying the timing constraints while minimizing makespan Cmax, is solved by two approaches. The first is implemented as a B&B algorithm using a Critical Path estimation and estimation of Remaining Processing TimeThe second solution is based on ILP. Experimental results show comparison of the B&B and ILP solution. (en)
Title
  • Není k dispozici (cs)
  • Scheduling with Start Time Related Deadlines
  • Scheduling with Start Time Related Deadlines (en)
skos:prefLabel
  • Není k dispozici (cs)
  • Scheduling with Start Time Related Deadlines
  • Scheduling with Start Time Related Deadlines (en)
skos:notation
  • RIV/68407700:21230/04:03099440!RIV/2005/MSM/212305/N
http://linked.open.../vavai/riv/strany
  • 94 ; 94
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(LN00B096)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 585534
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/04:03099440
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • branch and bound; integer linear programming; monoprocessor; sheduling (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [0B36CFD129C5]
http://linked.open...v/mistoKonaniAkce
  • Taipei
http://linked.open...i/riv/mistoVydani
  • New York
http://linked.open...i/riv/nazevZdroje
  • IEEE Conference on Control Applications, International Symposium on Inteligent Control, Computer Aided Control Systems Design 2004
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hanzálek, Zdeněk
  • Šůcha, Přemysl
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE Control System Society
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software