Complexities of some problems on multi-agent scheduling on a single machine
From MaRDI portal
Publication:2014052
DOI10.1007/s40305-016-0124-4zbMath1368.90080OpenAlexW2300977462MaRDI QIDQ2014052
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
Related Items (12)
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 ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ A note on a two-agent scheduling problem related to the total weighted late work ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
Cites Work
This page was built for publication: Complexities of some problems on multi-agent scheduling on a single machine
