Single facility scheduling with multiple job classes (Q1105481): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Ya. M. Shafransky / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Ya. M. Shafransky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(88)90252-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018260967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal schedules for single facility with two job classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Errata / rank
 
Normal rank

Latest revision as of 17:02, 18 June 2024

scientific article
In more languages
Configure
Language Label Description Also known as
English
Single facility scheduling with multiple job classes
scientific article

    Statements

    Single facility scheduling with multiple job classes (English)
    The one-machine scheduling problem aiming at minimizing the mean flow time is considered. The jobs set is divided into K classes. The processing of a job from class s immediately after the processing of a job from class r requires switching time \(\alpha_{rs}>0\) \((\alpha_{rr}=0)\). A heuristic \(O(nK+n\) log n) algorithm is proposed, where n is the number of jobs. The author failed to establish the worst- case bound for the algorithm. The results of numerical experiments are reported.
    one-machine scheduling
    mean flow time
    switching time
    heuristic

    Identifiers