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

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. Total tardiness minimization is commonly reduced to solving a combinatorial problem which becomes practically in...

Täydet tiedot

Bibliografiset tiedot

Päätekijä:	Vadim V. Romanuke
Aineistotyyppi:	Artigo
Kieli:	Inglês
Julkaistu:	Igor Sikorsky Kyiv Polytechnic Institute 2021-05-01
Sarja:	KPI Science News
Aiheet:	preemptive 1-machine job scheduling total tardiness heuristic sorting approach remaining processing periods remaining available periods
Linkit:	http://scinews.kpi.ua/article/view/211935
Tagit:	Lisää tagi Ei tageja, Lisää ensimmäinen tagi!