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


Wyświetlanie 1-3 z 3
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ł:
Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times
Autorzy:
Mousavi, Seyyed Mostafa
Shahnazari-Shahrezaei, Parisa
Powiązania:
https://bibliotekanauki.pl/articles/2201180.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
dispatching rule
genetic algorithm
hybrid flow shop
neighborhood search structure
Opis:
The paper considers the production scheduling problem in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimizing both the makespan and the total tardiness. The multi-objective genetic algorithm is applied to solve this problem, which belongs to the non-deterministic polynomial-time (NP)-hard class. In the structure of the proposed algorithm, the initial population, neighborhood search structures and dispatching rules are studied to achieve more efficient solutions. The performance of the proposed algorithm compared to the efficient algorithm available in literature (known as NSGA-II) is expressed in terms of the data envelopment analysis method. The computational results confirm that the set of efficient solutions of the proposed algorithm is more efficient than the other algorithm.
Źródło:
Management and Production Engineering Review; 2023, 14, 1; 13--24
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Accurate and Robust Genetic Algorithm to Minimize the Total Tardiness in Parallel Machine Scheduling Problems
Autorzy:
Ramadan, Saleem Zeyad
Almasarwah, Najat
Abdelall, Esraa S.
Suer, Gursel A.
Albashabsheh, Nibal T.
Powiązania:
https://bibliotekanauki.pl/articles/27324201.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
identical parallel machines
accurate generic algorithm
robust generic algorithm
immigration
surrogate fitness function
vegetative reproduction
Opis:
This paper uses a Genetic Algorithm (GA) to reduce total tardiness in an identical parallel machine scheduling problem. The proposed GA is a crossover-free (vegetative reproduction) GA but used for four types of mutations (Two Genes Exchange mutation, Number of Jobs mutation, Flip Ends mutation, and Flip Middle mutation) to make the required balance between the exploration and exploitation functions of the crossover and mutation operators. The results showed that use of these strategies positively affects the accuracy and robustness of the proposed GA in minimizing the total tardiness. The results of the proposed GA are compared to the mathematical model in terms of the time required to tackle the proposed problem. The findings illustrate the ability of the propounded GA to acquire the results in a short time compared to the mathematical model. On the other hand, increasing the number of machines degraded the performance of the proposed GA.
Źródło:
Management and Production Engineering Review; 2023, 14, 4; 28--40
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
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