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ę "Józefczyk, M." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Evolutionary algorithm for minmax regret flow-shop problem
    Autorzy:
    Ćwik, M.
    Józefczyk, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/406859.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    manufacturing
    flow-shop
    interval uncertainty
    min-max regret
    heuristic algorithms
    evolutionary algorithms
    simulation
    Opis:
    The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally compared with a simple middle interval heuristic algorithm for three machines instances. The conducted simulations confirmed the several percent advantage of the evolutionary approach.
    Źródło:
    Management and Production Engineering Review; 2015, 6, 3; 3-9
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Scatter Search based algorithms for min-max regret task scheduling problems with interval uncertainty
    Autorzy:
    Józefczyk, J.
    Siepak, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206069.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    task scheduling
    interval uncertainty
    min-max regret
    branch and bound
    Opis:
    Uncertain versions of three task scheduling problems: P║Cmax, F2║Cmax, R║Σ Cj are investigated. Parametric uncertainty is only considered which is represented by intervals. It is assumed that values of execution times of tasks are not a priori given, and they belong to the intervals of known bounds. No distributions additionally characterizing the uncertain parameters are assumed. The regret is used as the basis for a criterion evaluating the uncertainty. In a consequence, min-max regret combinatorial problems are solved. Heuristic algorithms based on Scatter Search are proposed. They are evaluated via computational experiments and compared to a simple middle intervals heuristics and to exact solutions for small instances of the problems considered.
    Źródło:
    Control and Cybernetics; 2013, 42, 3; 667-698
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Routing flow-shop with buffers and ready times - comparison of selected solution algorithms
    Autorzy:
    Józefczyk, J.
    Markowski, M.
    Balgabaeva, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/406986.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    manufacturing systems
    operations research
    complex systems
    optimization problems
    scheduling algorithms
    routing algorithms
    heuristics
    computer simulation
    Opis:
    This article extends the former results concerning the routing flow-shop problem to minimize the makespan on the case with buffers, non-zero ready times and different speeds of machines. The corresponding combinatorial optimization problem is formulated. The exact as well as four heuristic solution algorithms are presented. The branch and bound approach is applied for the former one. The heuristic algorithms employ known constructive idea proposed for the former version of the problem as well as the Tabu Search metaheuristics. Moreover, the improvement procedure is proposed to enhance the quality of both heuristic algorithms. The conducted simulation experiments allow evaluating all algorithms. Firstly, the heuristic algorithms are compared with the exact one for small instances of the problem in terms of the criterion and execution times. Then, for larger instances, the heuristic algorithms are mutually compared. The case study regarding the maintenance of software products, given in the final part of the paper, illustrates the possibility to apply the results for real-world manufacturing systems.
    Źródło:
    Management and Production Engineering Review; 2014, 5, 4; 26-35
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A method for remediation of soil contaminated with simazine
    Autorzy:
    Balawejder, M.
    Józefczyk, R.
    Antos, P.
    Pieniążek, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/204949.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    simazine
    remediation
    soil
    ozone
    Opis:
    Although the utilization of pesticides accounted for the group of persistent organic pollutants was banned years ago, a count of pesticides are still directly or indirectly a source of contamination in Europe. One of them, simazine is still allowed for use in the United States. Aim of this experiment was development of soil remediation method which could be utilized for degradation triazine class pesticides – simazine was an example used. A method for soil remediation based on ozonation processes in fluidized bed was successfully utilized for removal of simazine from contaminated soil. For the study soil highly contaminated with simazine up to the concentration of 0.05% w/w was used. Determination of the pesticide levels in soil was performed using extraction and gas chromatography. The method allowed 80% reduction of pesticide concentration level. The degradation of pesticide was accompanied with changes of physicochemical parameters of soil, i.e., decrease of pH and a increase of nitrates concentration. Despite changes in physicochemical properties of the soil, the developed method proved to be highly effective and can be successfully applied on an industrial scale.
    Źródło:
    Archives of Environmental Protection; 2016, 42, 3; 41-46
    2083-4772
    2083-4810
    Pojawia się w:
    Archives of Environmental Protection
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    MCPA decomposition method in soil matrix using ozone as an oxidant
    Metoda rozkładu MCPA w matrycy glebowej z użyciem ozonu jako utleniacza
    Autorzy:
    Balawejder, M.
    Antos, P.
    Jozefczyk, R.
    Pieniazek, M.
    Odzimek, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/905746.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    2-methyl-4-chlorophenoxyacetic acid
    decomposition method
    soil matrix
    ozone
    oxidant
    soil contamination
    Opis:
    In presented research a method for remediation of MCPA contaminated soil based on the combination of fluidization process technique and ozone was utilized. Exposition of soil contaminated with MCPA at the concentration of 0,1 % w/w on the a mixture of air and ozone allowed for removal of over 90% of MCPA in form of MCPA 2-ethylhexanol-ester (MCPA 2-EHE) in laboratory conditions. The efficacy of the method was proven by GC-MS analysis of MCPA concentration profile during soil remediation procedure and by comparing of kinetic data, such as half life time, with the natural half life time of MCPA in the soil.
    Źródło:
    Polish Journal of Soil Science; 2014, 47, 2
    0079-2985
    Pojawia się w:
    Polish Journal of Soil Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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