Complexities of some problems on multi-agent scheduling on a single machine

DOI10.1007/S40305-016-0124-4zbMATH Open1368.90080OpenAlexW2300977462MaRDI QIDQ2014052FDOQ2014052

Jinjiang Yuan

Publication date: 10 August 2017

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-016-0124-4

Recommendations

• A note on the complexity of the problem of two-agent scheduling on a single machine
• scientific article
• Complexities of four problems on two-agent scheduling
• Multi-agent single machine scheduling
• Multi-agent scheduling on a single machine with max-form criteria

zbMATH Keywords

multi-agent schedulingcompeting agentsunary NP-hardnon-disjoint agents

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• A multiple-criterion model for machine scheduling
• Scheduling Problems with Two Competing Agents
• Multiagent Scheduling
• Title not available (Why is that?)

Cited In (15)

• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
• Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• Serial-batching scheduling with two agents to minimize makespan and maximum cost
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
• A note on a two-agent scheduling problem related to the total weighted late work
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• Scheduling with release dates and preemption to minimize multiple max-form objective functions
• Two-agent single-machine scheduling with cumulative deterioration
• ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
• Title not available (Why is that?)
• Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
• Single-machine multi-agent scheduling problems with a global objective function
• Single-machine scheduling with multi-agents to minimize total weighted late work

This page was built for publication: Complexities of some problems on multi-agent scheduling on a single machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014052)