Partial dominated schedules and minimizing the total completion time of deteriorating jobs - Publikacja - MOST Wiedzy

Wyszukiwarka

Partial dominated schedules and minimizing the total completion time of deteriorating jobs

Abstrakt

A problem of scheduling deteriorating jobs on a single processor is considered. The processing time of a job is given by a function pi=ai+bisi, where si is the starting time of the job, ai>=0, bi>=0, for i=1,...,n. Jobs are non-preemptive and independent and there are neither ready times nor deadlines. The goal is to minimize the total weighted completion time. We show how to employ the concept of non-dominated schedules to construct an exact algorithm for the problem. We also consider extending the algorithm to solve problems with precedence constraints and finding all Pareto-optimal solutions. Then we present how to use the concept to the problem 1|pi=a+bisi|sum Ci. We use elimination of dominated partial schedules to improve the efficiency of a branch-and-bound algorithm and present another algorithm, based solely on the elimination of dominated partial schedules.

Cytowania

  • 0

    CrossRef

  • 0

    Web of Science

  • 0

    Scopus

Informacje szczegółowe

Kategoria:
Publikacja w czasopiśmie
Typ:
artykuł w czasopiśmie wyróżnionym w JCR
Opublikowano w:
OPTIMIZATION nr 62, strony 1341 - 1356,
ISSN: 0233-1934
Język:
angielski
Rok wydania:
2013
Opis bibliograficzny:
Ocetkiewicz K.: Partial dominated schedules and minimizing the total completion time of deteriorating jobs// OPTIMIZATION. -Vol. 62, nr. 10 (2013), s.1341-1356
DOI:
Cyfrowy identyfikator dokumentu elektronicznego (otwiera się w nowej karcie) 10.1080/02331934.2013.836647
Weryfikacja:
Politechnika Gdańska

wyświetlono 11 razy

Publikacje, które mogą cię zainteresować

Meta Tagi