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
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s10288-021-00480-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3164495234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on competing-agent Pareto-scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on unbounded parallel-batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5197262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multitasking scheduling problems with two competitive agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of due-date related single-machine with two-agent scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with two competing agents and equal job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities of some problems on multi-agent scheduling on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary NP-hardness of minimizing the number of tardy jobs with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities of four problems on two-agent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates and preemption to minimize multiple max-form objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria scheduling of equal length jobs on uniform parallel machines / rank
 
Normal rank

Latest revision as of 04:11, 29 July 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