Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 2
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

The paper presents a Car Sequencing Problem, widely considered in the literature. The issue considered by the researchers is only a reduced problem in comparison with the problem in real automotive production. Consequently, a newconcept, called Paint Shop 4.0., is considered from the viewpoint of a sequencing problem. The paper is a part of the previously conducted research, identified as Car Sequencing Problem with Buffers (CSPwB), which extended the original problem to a problem in a production line equipped with buffers. The new innovative approach is based on the ideas of Industry 4.0 and the buffer management system. In the paper, sequencing algorithms that have been developed so far are discussed. The original Follow-up Sequencing Algorithm is presented, which is still developed by the authors. The main goal of the research is to find the most effective algorithm in terms of minimization of painting gun changeovers and synchronization necessary color changes with periodic gun cleanings. Carried out research shows that the most advanced algorithm proposed by the authors outperforms other tested methods, so it is promising to be used in the automotive industry.

Go to article

Authors and Affiliations

Sara Bysko
Jolanta Krystek
Szymon Bysko
Radim Lenort
Download PDF Download RIS Download Bibtex

Abstract

A method of creating production schedules regarding production lines with parallel machines is presented. The production line setup provides for intermediate buffers located between individual stages. The method mostly concerns situations when part of the production machines is unavailable for performance of operations and it becomes necessary to modify the original schedule, the consequence of which is the need to build a new schedule. The cost criterion was taken into account, as the schedule is created with the lowest possible costs regarding untimely completion of products (e.g. fines for delayed product completion). The proposed method is relaxing heuristics, thanks to which scheduling is performed in a relatively short time. This was confirmed by the presented results of computational experiments. These experiments were carried out for the rescheduling of machine parts production.

Go to article

Authors and Affiliations

Marek Magiera

This page uses 'cookies'. Learn more