2025-02-23T11:00:20-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-51990%22&qt=morelikethis&rows=5
2025-02-23T11:00:20-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-51990%22&qt=morelikethis&rows=5
2025-02-23T11:00:20-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T11:00:20-05:00 DEBUG: Deserialized SOLR response
Задача побудови допустимого розкладу з найпізнішим моментом запуску і мінімальним сумарним випередженням

Задача побудови допустимого розкладу з найпізнішим моментом запуску і мінімальним сумарним випередженням

We considered a problem of scheduling a single device performing independent tasks with different durations and due terms on the criteria of maximizing the startup time of the task and minimizing the total earliness, in which all the tasks are not delayed. For the specified launch time, the algorith...

Full description

Saved in:
Bibliographic Details
Main Authors: Zgurovsky, M. Z., Pavlov, O. A., Khalus, O. A.
Format: Article
Language:rus
Published: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2015
Online Access:http://journal.iasa.kpi.ua/article/view/51990
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We considered a problem of scheduling a single device performing independent tasks with different durations and due terms on the criteria of maximizing the startup time of the task and minimizing the total earliness, in which all the tasks are not delayed. For the specified launch time, the algorithm is presented to build a feasible schedule with the minimum total earliness. The proof is provided that the problem of constructing an optimal feasible schedule according to the criteria of maximizing the startup time of the task and simultaneously minimizing the total earliness specified in the lexicographical order is P-solvable. We propose an exact polynomial algorithm for finding the optimal schedule on the criteria of minimizing the total earliness for a given startup time of the tasks.

Similar Items