skip to main content
Idioma:

A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0

Ivanov, Dmitry ; Dolgui, Alexandre ; Sokolov, Boris ; Werner, Frank ; Ivanova, Marina

International journal of production research, 2016-01, Vol.54 (2), p.386-402 [Periódico revisado por pares]

London: Taylor & Francis

Texto completo disponível

Citações Citado por
  • Título:
    A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0
  • Autor: Ivanov, Dmitry ; Dolgui, Alexandre ; Sokolov, Boris ; Werner, Frank ; Ivanova, Marina
  • Assuntos: Algorithms ; alternative machines ; Computer Science ; Dynamics ; Factories ; flexible flow shop ; Industrial plants ; Industry 4.0 ; Mathematical models ; Modeling and Simulation ; Networks ; optimal programme control ; Production scheduling ; Project management ; Scheduling ; smart factory ; structure dynamics ; supply chain scheduling ; Supply chains
  • É parte de: International journal of production research, 2016-01, Vol.54 (2), p.386-402
  • Notas: ObjectType-Article-1
    SourceType-Scholarly Journals-1
    ObjectType-Feature-2
    content type line 23
  • Descrição: Smart factories Industry 4.0 on the basis of collaborative cyber-physical systems represents a future form of industrial networks. Supply chains in such networks have dynamic structures which evolve over time. In these settings, short-term supply chain scheduling in smart factories Industry 4.0 is challenged by temporal machine structures, different processing speed at parallel machines and dynamic job arrivals. In this study, for the first time, a dynamic model and algorithm for short-term supply chain scheduling in smart factories Industry 4.0 is presented. The peculiarity of the considered problem is the simultaneous consideration of both machine structure selection and job assignments. The scheduling approach is based on a dynamic non-stationary interpretation of the execution of the jobs and a temporal decomposition of the scheduling problem. The algorithmic realisation is based on a modified form of the continuous maximum principle blended with mathematical optimisation. A detailed theoretical analysis of the temporal decomposition and computational complexity is performed. The optimality conditions as well as the structural properties of the model and the algorithm are investigated. Advantages and limitations of the proposed approach are discussed.
  • Editor: London: Taylor & Francis
  • Idioma: Inglês
Links
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.