Código QR (código de barras bidimensional)

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

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 descending order. It was recently ascertained that sche...

Fuld beskrivelse

Na minha lista:
Hovedforfatter: Vadim V. Romanuke
Format: Artigo
Sprog:Inglês
Udgivet: Igor Sikorsky Kyiv Polytechnic Institute 2021-03-01
Serier:KPI Science News
Fag:
preemptive single machine job scheduling
total weighted tardiness
heuristic;
ascending job order
descending job order
computation time
Online adgang:http://scinews.kpi.ua/article/view/209129
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

Lignende værker