Results 1 to 10 of about 363 (138)
Blocks for two-machines total weighted tardiness flow shop scheduling problem [PDF]
Bulletin of the Polish Academy of Sciences: Technical Sciences, 2020 The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties
W. Bożejko, M. Uchroński, M. Wodecki
doaj +1 more source
Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags [PDF]
Yugoslav Journal of Operations Research, 2022 This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm.
Almathkour Fatmah +3 more
doaj +1 more source
KPI Science News, 2021 Background. In preemptive job scheduling, total weighted tardiness minimization is commonly reduced to solving a combinatorial problem, which becomes practically intractable as the number of jobs and the numbers of their processing periods increase.
Vadym V. Romanuke
doaj +1 more source
Parallel Algorithm with Blocks for a Single-Machine Total Weighted Tardiness Scheduling Problem
Applied Sciences, 2021 In this paper, the weighted tardiness single-machine scheduling problem is considered. To solve it an approximate (tabu search) algorithm, which works by improving the current solution by searching the neighborhood, is used.
Mariusz Uchroński
doaj +1 more source
A MIXED-INTEGER PROGRAMMING MODEL FOR THE JOB SCHEDULING PROBLEM IN A PRODUCTION COMPANY
Verimlilik Dergisi, 2022 Purpose: In this study, a mixed-integer programming model is developed to minimize the total lateness and total completion time of the jobs in an automotive company.
Durdu Hakan Utku +2 more
doaj +1 more source
The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem [PDF]
مجله مدل سازی در مهندسی, 2018 The development and extending the classic models for approaching the real world conditions are always in consideration of researchers. For this reason, many efforts are made for generalization of the job shop scheduling problem. The stage shop scheduling
Mohammad Mahdi Nasiri
doaj +1 more source
Scheduling on unrelated parallel machines with sequence dependent setup times
Revista Produção Online, 2014 This article proposes a scheduling heuristic for unrelated parallel machines with sequence dependent setup times. The minimization of total weighted completion time and the minimization of weighted tardiness are the objective functions of interest.
Guilherme Etcheverry +1 more
doaj +1 more source
Applied Computer Systems, 2022 A problem of minimizing the total weighted tardiness in the preemptive single machine scheduling for discrete manufacturing is considered. A hyper-heuristic is presented, which is composed of 24 various heuristics, to find an approximately optimal ...
Romanuke Vadim
doaj +1 more source
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2014 We propose an efficient heuristic method for job-shop scheduling problems (JSP) with the objective of total weighted tardiness minimization. The proposed method uses schedule reconstructions by priority rules to guide a local search towards promising ...
Soichiro YOKOYAMA +2 more
doaj +1 more source
Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling
Applied Computer Systems, 2019 Two possibilities of obtaining the minimal total weighted tardiness in tight-tardy single machine preemptive idling-free scheduling are studied. The Boolean linear programming model, which allows obtaining the exactly minimal tardiness, becomes too time ...
Romanuke Vadim
doaj +1 more source