Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s10288-021-00480-3 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10288-021-00480-3 / rank
 
Normal rank

Latest revision as of 08:59, 28 December 2024

scientific article
Language Label Description Also known as
English
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
scientific article

    Statements

    Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (English)
    0 references
    0 references
    0 references
    1 June 2022
    0 references
    Pareto-scheduling
    0 references
    parallel-batch machine
    0 references
    family jobs
    0 references
    ND agents
    0 references
    polynomial time
    0 references
    0 references
    0 references
    0 references

    Identifiers