Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "production scheduling problem" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Particle swarm optimization and discrete artificial bee colony algorithms for solving production scheduling problems
    Autorzy:
    Witkowski, Tadeusz
    Powiązania:
    https://bibliotekanauki.pl/articles/298169.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Warmińsko-Mazurski w Olsztynie
    Tematy:
    Discrete Artificial Bee Colony
    particle swarm optimization (PSO)
    production scheduling problem
    makespan
    Opis:
    This paper shows the use of Discrete Artificial Bee Colony (DABC) and Particle Swarm Optimization (PSO) algorithm for solving the job shop scheduling problem (JSSP) with the objective of minimizing makespan. The Job Shop Scheduling Problem is one of the most difficult problems, as it is classified as an NP-complete one. Stochastic search techniques such as swarm and evolutionary algorithms are used to find a good solution. Our objective is to evaluate the efficiency of DABC and PSO swarm algorithms on many tests of JSSP problems. DABC and PSO algorithms have been developed for solving real production scheduling problem too. The experiment results indicate that this problem can be effectively solved by PSO and DABC algorithms.
    Źródło:
    Technical Sciences / University of Warmia and Mazury in Olsztyn; 2019, 22(1); 61-74
    1505-4675
    2083-4527
    Pojawia się w:
    Technical Sciences / University of Warmia and Mazury in Olsztyn
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Classification Of Scheduling Problems Under Production Uncertainty
    Autorzy:
    Wojakowski, P.
    Warżołek, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/409534.pdf
    Data publikacji:
    2014
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    scheduling problem
    production uncertainty
    production disruption
    Opis:
    One of the most important issue regarding scheduling problem is production uncertainty. From the standpoint of real-world scheduling problem, it is necessary to find solution of building the schedule which can be insensitive to production disruptions such as machine breakdowns, incorrectly estimated time interval of machines maintenance, absence of workers, unavailability of materials or tooling, production defects, variable processing times, etc. This research study is conducted to answer the question: how the researchers cope with the problem of production uncertainty taking into account the scheduling problem? Our investigation focuses on approaches developed for scheduling with production uncertainty consideration. Among these approaches the most popular ones are: reactive scheduling, proactive scheduling, predictive scheduling and robust predictive-reactive approaches. A brief explanation of individual approaches are presented. Further, models of uncertainty used in scheduling approaches are highlighted.
    Źródło:
    Research in Logistics & Production; 2014, 4, 3; 245-256
    2083-4942
    2083-4950
    Pojawia się w:
    Research in Logistics & Production
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Iterated Local Search for Foundry Lot-sizing and Scheduling Problem with Setup Costs
    Autorzy:
    Stawowy, A.
    Duda, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/379789.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    information technology
    foundry industry
    scheduling problem
    production planning
    local search heuristics
    technologia informatyczna
    przemysł odlewniczy
    szeregowanie zadań
    planowanie produkcji
    wyszukiwanie lokalne
    Opis:
    The paper presents a novel Iterated Local Search (ILS) algorithm to solve multi-item multi-family capacitated lot-sizing problem with setup costs independent of the family sequence. The model has a direct application to real production planning in foundry industry, where the goal is to create the batches of manufactured castings and the sequence of the melted metal loads to prevent delays in delivery of goods to clients. We extended existing models by introducing minimal utilization of furnace capacity during preparing melted alloy. We developed simple and fast ILS algorithm with problem-specific operators that are responsible for the local search procedure. The computational experiments on ten instances of the problem showed that the presence of minimum furnace utilization constraint has great impact on economic and technological conditions of castings production. For all test instances the proposed heuristic is able to provide the results that are comparable to state-of-the art commercial solver.
    Źródło:
    Archives of Foundry Engineering; 2017, 17, 4; 161-164
    1897-3310
    2299-2944
    Pojawia się w:
    Archives of Foundry Engineering
    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