Just in time scheduling on identical parallel machines
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F02%3A00003334" target="_blank" >RIV/00216208:11320/02:00003334 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Just in time scheduling on identical parallel machines
Original language description
In this short note we study a scheduling problem on parallel machines. The objective is to maximize the number of just in time jobs, where a job is called just in time if it is completed exactly on its due date.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F01%2F0942" target="_blank" >GA201/01/0942: Advanced Planning and Scheduling</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
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
Proceedings of 5th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
30-33
Publisher name
Osaka Institute of Technology
Place of publication
Osaka
Event location
Osaka
Event date
Jan 1, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—