Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "car sequencing" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
A Two-stage approach for an optimum solution of the car assembly scheduling problem Part 1. Problem statement, solution outline and tutorial example
Autorzy:
Mazur, M.
Niederliński, A.
Tematy:
car sequencing
car assembly scheduling
workstation capacity constraints
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:
https://bibliotekanauki.pl/articles/229304.pdf  Link otwiera się w nowym oknie
Opis:
A new approach to solving realistic car assembly scheduling problems for mixed model assembly line is presented. It is proposed to decompose the problem into two subproblems: 1) a sequencing problem that generates admissible car sequences fulfilling capacity constraints for all car models in the production plan, 2) a scheduling problem that determines an admissible car sequence with shortest makespan. The details of this approach are illustrated by a simple numerical example.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Two-stage approach for an optimum solution of the car assembly scheduling problem. Part 2. CLP solution and real-world example
Autorzy:
Mazur, M.
Niederliński, A.
Tematy:
car sequencing
car assembly scheduling
workstation capacity constraints
constraint logic programming
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:
https://bibliotekanauki.pl/articles/230028.pdf  Link otwiera się w nowym oknie
Opis:
A Constraint Logic Programming (CLP) tool for solving the problem discussed in Part 1 of the paper has been designed. It is outlined and discussed in the paper. The program has been used for solving a real-world car assembly scheduling problem.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Buffer management in solving a real sequencing problem in the automotive industry – Paint Shop 4.0 concept
Autorzy:
Bysko, Sara
Krystek, Jolanta
Bysko, Szymon
Lenort, Radim
Tematy:
sequencing
car production
paint shop
buffer management
changeovers
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:
https://bibliotekanauki.pl/articles/229585.pdf  Link otwiera się w nowym oknie
Opis:
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 new concept, 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.
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies