All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Production Scheduling with Alternative Process Plans

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00182616" target="_blank" >RIV/68407700:21230/12:00182616 - isvavai.cz</a>

  • Result on the web

    <a href="http://80.www.sciencedirect.com.dialog.cvut.cz/science/article/pii/S0377221711008460" target="_blank" >http://80.www.sciencedirect.com.dialog.cvut.cz/science/article/pii/S0377221711008460</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ejor.2011.09.018" target="_blank" >10.1016/j.ejor.2011.09.018</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Production Scheduling with Alternative Process Plans

  • Original language description

    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 final schedule has to be made during the scheduling process. We extend classic RCPSP problem by a definition of alternative branchings, represented by the Petri nets formalism allowing one to define alternatives and parallelism within one data structure. For this representation of the problem, an integer linear programming model is formulated and the reduction of the problem, using time symmetry mapping, is shown.Finally, a heuristic algorithm based on priority schedule construction with an unscheduling step is proposed for the nested version of the problem and it is used to solve the case study of the wire harnesses production.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    European Journal of Operational Research

  • ISSN

    0377-2217

  • e-ISSN

  • Volume of the periodical

    217

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    12

  • Pages from-to

    300-311

  • UT code for WoS article

    000297873700008

  • EID of the result in the Scopus database