Total Setup Time Minimisation in Production Scheduling with Alternatives

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00317229" target="_blank" >RIV/68407700:21230/17:00317229 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21730/17:00317229

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007/978-3-319-64635-0_2" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-64635-0_2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-64635-0_2" target="_blank" >10.1007/978-3-319-64635-0_2</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Total Setup Time Minimisation in Production Scheduling with Alternatives

Popis výsledku v původním jazyce

The research presented in this paper is focused on the scheduling problem with alternative process plans where the goal is to minimise the sum of all the performed setup times in the schedule. The setup times play an important role in scheduling problems, yet they are, in most cases, considered only as an additional constraint, not as a part of the objective function. We propose a model, based on the resource constrained project scheduling problem with alternative process plans, release times and deadlines, that includes the setup times in the scheduling criterion. Both the exact mathematical model and the new heuristic algorithm are proposed to solve the problem. The effectiveness of the proposed two-phase heuristic algorithm, designed with the intention to solve the large instances of the problem, is evaluated on a wide set of instances.

Název v anglickém jazyce

Total Setup Time Minimisation in Production Scheduling with Alternatives

Popis výsledku anglicky

The research presented in this paper is focused on the scheduling problem with alternative process plans where the goal is to minimise the sum of all the performed setup times in the schedule. The setup times play an important role in scheduling problems, yet they are, in most cases, considered only as an additional constraint, not as a part of the objective function. We propose a model, based on the resource constrained project scheduling problem with alternative process plans, release times and deadlines, that includes the setup times in the scheduling criterion. Both the exact mathematical model and the new heuristic algorithm are proposed to solve the problem. The effectiveness of the proposed two-phase heuristic algorithm, designed with the intention to solve the large instances of the problem, is evaluated on a wide set of instances.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA16-23509S" target="_blank" >GA16-23509S: Flexibilní rozvrhovací a optimalizační algoritmy pro distribuované systémy reálného času</a><br>

Návaznosti

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

Rok uplatnění

2017

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ů

Název statě ve sborníku

Industrial Applications of Holonic and Multi-Agent Systems

ISBN

978-3-319-64634-3

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

13

Strana od-do

11-23

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Lyon

Datum konání akce

28. 9. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—