An Instance Generator for Scheduling Problems with Alternative Process Plans

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00206372" target="_blank" >RIV/68407700:21230/13:00206372 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

An Instance Generator for Scheduling Problems with Alternative Process Plans

Popis výsledku v původním jazyce

We consider scheduling problems with alternative process plans. A new generator for problem instances is proposed. The generator is designed for both resource constrained project scheduling problems and problems based on the integrated process planning and scheduling model while the data representation for both classes of problems is unified. Our main intention is to propose a common model for scheduling problems with alternatives and to fill the gap in existing tools for randomly generating problem instances. Structural properties, the resource environment, and the attributes of activities are defined as input parameters of the generator. The parameter settings used for generating different sets of instances for benchmarking are described.

Název v anglickém jazyce

An Instance Generator for Scheduling Problems with Alternative Process Plans

Popis výsledku anglicky

We consider scheduling problems with alternative process plans. A new generator for problem instances is proposed. The generator is designed for both resource constrained project scheduling problems and problems based on the integrated process planning and scheduling model while the data representation for both classes of problems is unified. Our main intention is to propose a common model for scheduling problems with alternatives and to fill the gap in existing tools for randomly generating problem instances. Structural properties, the resource environment, and the attributes of activities are defined as input parameters of the generator. The parameter settings used for generating different sets of instances for benchmarking are described.

Druh

O - Ostatní výsledky

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP103%2F12%2F1994" target="_blank" >GAP103/12/1994: Adaptivní algoritmy pro rozvrhování a optimalizaci distribuovaných vestavěných real-time systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

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ů