Parallel-batch scheduling with multi-agent jobs to minimize the weighted number of tardy jobs

MaRDI QIDQ3052575zbMATH OpenFDO

Authors Jinjiang Yuan, Cheng He, Yanpei Liu

Publication date 5 November 2010

zbMATH Keywords

multicriteria schedulingnumber of tardy jobsparallel-batching

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
• A batch scheduling problem with two agents
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
• 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

Cited in

(5)

• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
• Minimizing weighted earliness and tardiness on parallel machines using a multi-agent system
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
• 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

This page was built for publication: Parallel-batch scheduling with multi-agent jobs to minimize the weighted number of tardy jobs

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