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ę "tardiness" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
    Autorzy:
    Chung, Chia-Shin
    Flynn, James
    Rom, Walter
    Staliński, Piotr
    Powiązania:
    https://bibliotekanauki.pl/articles/475000.pdf
    Data publikacji:
    2012
    Wydawca:
    Fundacja Upowszechniająca Wiedzę i Naukę Cognitione
    Tematy:
    genetic algorithm
    scheduling
    permutation flowshop
    tardiness
    Opis:
    The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA, which can handle problems with larger n. We also undertake a numerical study comparing GA with an optimal branch and bound algorithm, and various heuristic algorithms including the well known NEH algorithm and a local search heuristic LH. Extensive computational experiments indicate that LH is an effective heuristic and GA can produce noticeable improvements over LH.
    Źródło:
    Journal of Entrepreneurship, Management and Innovation; 2012, 8, 2; 26-43
    2299-7075
    2299-7326
    Pojawia się w:
    Journal of Entrepreneurship, Management and Innovation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Collaborative paradigm for single-machine scheduling under just-in-time principles: total holding-tardiness cost problem
    Autorzy:
    Varela, M. L. R.
    Madureira, A. M.
    Dantas, J. D.
    Santos, A. S.
    Putnik, G. D.
    Trojanowska, J.
    Machado, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/406794.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    single-machine
    scheduling
    heuristics
    just-in-time
    agile manufacturing
    holding-tardiness cost problem
    Opis:
    The problem of sequencing jobs on a single machine to minimize total cost (earliness and tardiness) is nowadays not just important due to traditional concerns but also due to its importance in the context of Collaborative Networked Organizations and Virtual Enterprises, where precision about promptly responses to customers’ requests, along with other important requirements, assume a crucial role. In order to provide a contribution in this direction, in this paper the authors contribute with an applied constructive heuristics that tries to find appropriate solutions for single machine scheduling problems under different processing times and due dates, and without preemption allowed. In this paper, two different approaches for single-machine scheduling problems, based on external and internal performance measures are applied to the problem and a comparative analysis is performed. Computational results are presented for the problem under Just-in-Time and agile conditions on which each job has a due date, and the objective is to minimize the sum of holding costs for jobs completed before their due date and tardiness costs for jobs completed after their due date. Additional computational tests were developed based on different customer and enterprise oriented performance criteria, although preference is given to customer-oriented measures, namely the total number of tardy jobs and the maximum tardiness.
    Źródło:
    Management and Production Engineering Review; 2018, 9, 1; 90-103
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Scheduling problems with a common due window assignment: a survey
    Autorzy:
    Janiak, A.
    Kwiatkowski, T.
    Lichtenstein, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/330540.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    scheduling
    due window assignment
    earliness/tardiness
    practical example
    szeregowanie
    wcześniej/później
    przykład zastosowania
    Opis:
    In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this survey we separately analyse the classical models with job-independent and job-dependent earliness/tardiness penalty functions and some other more complicated models. We describe the computational complexity of the problems and the main features of the approaches developed to solve them. Particular attention is paid to practical applications of the analysed models. As turns out, some complicated models combining classical scheduling problems with, e.g., learning and aging effects have no reasonable practical justification in the literature.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2013, 23, 1; 231-241
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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