Production Scheduling with Alternative Process Plans

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00223326" target="_blank" >RIV/68407700:21230/15:00223326 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.amazon.ca/Handbook-Project-Management-Scheduling-Vol/dp/3319059149" target="_blank" >http://www.amazon.ca/Handbook-Project-Management-Scheduling-Vol/dp/3319059149</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Production Scheduling with Alternative Process Plans

Popis výsledku v původním jazyce

This chapter 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 givenactivities will form the solution, so the decision whether the activity will appear in the final schedule has to be made during the scheduling process. The problem considered is an extension of the resource constrained project scheduling problem (RCPSP)with positive and negative time-lags and semence dependent setup times. We extend classic RCPSP problem by a definition of alternative branchings and for this representation of the problem, an mixed integer linear programming model is formulated. Furthermore, a heuristic algorithm based on priority schedule construction with an unscheduling step is proposed for the considered problem and it is used to solve the large instances of the considered problem.

Název v anglickém jazyce

Production Scheduling with Alternative Process Plans

Popis výsledku anglicky

This chapter 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 givenactivities will form the solution, so the decision whether the activity will appear in the final schedule has to be made during the scheduling process. The problem considered is an extension of the resource constrained project scheduling problem (RCPSP)with positive and negative time-lags and semence dependent setup times. We extend classic RCPSP problem by a definition of alternative branchings and for this representation of the problem, an mixed integer linear programming model is formulated. Furthermore, a heuristic algorithm based on priority schedule construction with an unscheduling step is proposed for the considered problem and it is used to solve the large instances of the considered problem.

Druh

C - Kapitola v odborné knize

CEP obor

BB - Aplikovaná statistika, operační výzkum

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í

2015

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 knihy nebo sborníku

Handbook on Project Management and Scheduling Vol. 2

ISBN

978-3-319-05914-3

Počet stran výsledku

18

Strana od-do

1187-1204

Počet stran knihy

1405

Název nakladatele

Springer

Místo vydání

Heidelberg

Kód UT WoS kapitoly

—