QR-koodi

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

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 model in reverse order. Objective. The goal is to...

Täydet tiedot

Tallennettuna:
Päätekijä: Vadim V. Romanuke
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: Igor Sikorsky Kyiv Polytechnic Institute 2020-03-01
Sarja:KPI Science News
Aiheet:
Job scheduling
Preemptive single machine scheduling
Exact model
Total tardiness
Computation time
Ascending job order
Linkit:http://scinews.kpi.ua/article/view/180877
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!

Samankaltaisia teoksia