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
From MaRDI portal
Publication:2410095
DOI10.1007/s10878-016-0078-9zbMath1382.90041OpenAlexW2508599756MaRDI QIDQ2410095
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0078-9
Related Items (7)
A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ 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 ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions
Cites Work
This page was built for publication: 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
