Alternative Process Plans in Wire Harnesses Production

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00169733" target="_blank" >RIV/68407700:21230/10:00169733 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Alternative Process Plans in Wire Harnesses Production

Popis výsledku v původním jazyce

This paper deals with a scheduling problem with alternative process plans that was motivated by a production of wire harnesses where certain parts can be processed manually or automatically by different types of machines. Only a subset of all the given activities will form the solution, so the decision whether the activity will appear in the schedule has to be made during the scheduling process. The problem considered is an extension of the resource constrained project scheduling problem with unary resources, positive and negative time-lags and sequence dependent setup times. We have proposed the problem representation by a special graph allowing to define alternative process plans. For this representation of the problem, an integer linear programmingmodel is formulated. Finally a heuristic algorithm based on priority schedule construction with an unscheduling step is proposed and used to solve the case study of the wire harnesses production.

Název v anglickém jazyce

Alternative Process Plans in Wire Harnesses Production

Popis výsledku anglicky

This paper deals with a scheduling problem with alternative process plans that was motivated by a production of wire harnesses where certain parts can be processed manually or automatically by different types of machines. Only a subset of all the given activities will form the solution, so the decision whether the activity will appear in the schedule has to be made during the scheduling process. The problem considered is an extension of the resource constrained project scheduling problem with unary resources, positive and negative time-lags and sequence dependent setup times. We have proposed the problem representation by a special graph allowing to define alternative process plans. For this representation of the problem, an integer linear programmingmodel is formulated. Finally a heuristic algorithm based on priority schedule construction with an unscheduling step is proposed and used to solve the case study of the wire harnesses production.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2010

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

15th IEEE International Conference on Emerging Technologies and Factory Automation

ISBN

978-1-4244-6848-5

ISSN

1946-0740

e-ISSN

—

Počet stran výsledku

8

Strana od-do

—

Název nakladatele

IEEE

Místo vydání

Barcelona

Místo konání akce

Bilbao

Datum konání akce

13. 9. 2010

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

WRD - Celosvětová akce

Kód UT WoS článku

—