Search Procedure for Earliness and Tardiness Scheduling Problem

Kód výsledku v 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>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Search Procedure for Earliness and Tardiness Scheduling Problem
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Search Procedure for Earliness and Tardiness Scheduling Problem
Popis výsledku anglicky
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.

Projekt
<a href="/cs/project/1M0567" target="_blank" >1M0567: Centrum aplikované kybernetiky</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2007
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)