Fast approximation algorithm for the multislot just-in-time scheduling problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F03%3A00002366" target="_blank" >RIV/00216208:11320/03:00002366 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Fast approximation algorithm for the multislot just-in-time scheduling problem
Original language description
In this paper we are concerned with the problem of just in time scheduling with periodic time slots. We design here a fast algorithm which produces a feasible schedule that approximates the optimal schedule with a maximum error of one extra slot.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Methods for Decision Support in Environment with Uncertainty
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
1-6
Publisher name
University of Ostrava
Place of publication
Ostrava
Event location
Ostrava
Event date
Jan 1, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—