Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Alexander A. Lazarev / rank
Normal rank
 
Property / author
 
Property / author: Alexander A. Lazarev / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57633773 / 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.1007/s11590-016-1003-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2296842957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine problems with equal processing times: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem / rank
 
Normal rank

Latest revision as of 01:58, 14 July 2024

scientific article
Language Label Description Also known as
English
Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
scientific article

    Statements

    Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2017
    0 references
    scheduling
    0 references
    single machine
    0 references
    equal processing times
    0 references
    polynomial algorithms
    0 references
    bi-criteria problem
    0 references

    Identifiers