Search Procedure for Earliness and Tardiness Scheduling Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A00130380" target="_blank" >RIV/68407700:21230/07:00130380 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Search Procedure for Earliness and Tardiness Scheduling Problem
Original language description
The aim of this paper is to present an algorithm to solving a scheduling problem with earliness and tardiness costs using constraint programming approach. The proposed algorithm consists of a constraint programming model usual for scheduling with problemspecific greedy search procedure. The algorithm is applied to the case study of a lacquer production that includes some real life features like operating hours or changeover times. The results are compared to the ones from the prior constraint programming algorithm and from the original timed automata approach.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0567" target="_blank" >1M0567: Centre for Applied Cybernetics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů