Results 1 to 10 of about 9,994,877 (227)

TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING WITH JOB PRIORITY WEIGHTS BY HEURISTIC’S EFFICIENT JOB ORDER INPUT

KPI Science News, 2021
Background. In setting a problem of minimizing total weighted tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or ...
Vadim V. Romanuke
doaj   +1 more source

A study on m-machines n-jobs flow shop scheduling problems

Studies in Science and Technology, 2021
This paper deals with one of the most difficult sequencing problems, m-machines n-jobs flow shop scheduling problems. Conventional methods adopted in previous studies include the Monte Carlo method by sampling or the simulation method in which the target
Yudai Kitagawa, Shinichi Funase, Toshihiko Shimauchi, Haruhiko Kimura   +3 more
doaj   +1 more source

Protecting Wastewater Workers by Categorizing Risks of Pathogen Exposures by Splash and Fecal-Oral Transmission during Routine Tasks

Waste, 2022
Quantitative microbial risk assessments (QMRAs) present an opportunity to systematically assess risk to wastewater treatment plant (WWTP) workers and mitigate work-related infectious diseases. However, while QMRAs often explore the impacts of aeration or
Rasha Maal-Bared
doaj   +1 more source

A SORTING IMPROVEMENT IN THE HEURISTIC BASED ON REMAINING AVAILABLE AND PROCESSING PERIODS TO MINIMIZE TOTAL TARDINESS IN PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING

KPI Science News, 2021
Background. In preemptive job scheduling, which is a part of the flow-shop sequencing tasks, one of the most crucial goals is to obtain a schedule whose total tardiness would be minimal.
Vadim V. Romanuke
doaj   +1 more source

SORTING APPROACHES IN THE HEURISTIC BASED ON REMAINING AVAILABLE AND PROCESSING PERIODS TO MINIMIZE TOTAL WEIGHTED TARDINESS IN PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING

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

HEURISTIC’S JOB ORDER EFFICIENCY IN TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING OF EQUAL-LENGTH JOBS

KPI Science News, 2020
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending order ...
Vadim V. Romanuke
doaj   +1 more source

TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING BY HEURISTIC’S EFFICIENT JOB ORDER INPUT

KPI Science News, 2020
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending order ...
Vadim V. Romanuke
doaj   +1 more source

EFFICIENT EXACT MINIMIZATION OF TOTAL TARDINESS IN TIGHT-TARDY PROGRESSIVE SINGLE MACHINE SCHEDULING WITH IDLING-FREE PREEMPTIONS OF EQUAL-LENGTH JOBS

KPI Science News, 2020
Background. A schedule ensuring the exactly minimal total tardiness can be found with the respective integer linear programming problem. An open question is whether the exact schedule computation time changes if the job release dates are input to the ...
Vadim V. Romanuke
doaj   +1 more source

Estudo da influência da programação do primeiro estágio em flow shop híbridos com tempos de setup explícitos

Exacta, 2013
Neste artigo são apresentados quatro métodos heurísticos construtivos (denominados LPT, TOTAL, SCT e LPST) para programação da produção em sistemas flow shop híbridos com tempos de setup independentes da sequência de execução das tarefas.
Helio Yochihiro Fuchigami, João Vitor Moccellin   +1 more
doaj   +1 more source

The minimization of exact total weighted completion time in the preemptive scheduling problem by subsequent length-equal job importance growth

Вісник Харківського національного університету імені В.Н. Каразіна. Серія: Математичне моделювання, інформаційні технології, автоматизовані системи управління, 2018
For the preemptive scheduling problem in case of subsequent job importance growth, it is studied whether the optimal schedule might be found faster within an exact model.
Vadim Romanuke
doaj   +1 more source