Bicriteria scheduling of equal length jobs on uniform parallel machines

DOI10.1007/s10878-019-00507-wzbMath1442.90090OpenAlexW2991911158WikidataQ126668232 ScholiaQ126668232MaRDI QIDQ2307491

Jinjiang Yuan, Qiu-Lan Zhao

Publication date: 24 March 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00507-w

zbMATH Keywords

bicriteria schedulingpolynomial time algorithmNP-hardnessuniform parallel machinesgenerated completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Pareto-scheduling of two competing agents with their own equal processing times ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ Faster algorithms for bicriteria scheduling of identical jobs on uniform machines ⋮ Online NDP-constraint scheduling of jobs with delivery times or weights ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Single machine scheduling with two competing agents and equal job processing times
• Two-agent scheduling on uniform parallel machines with min-max criteria
• Bicriterion scheduling of identical processing time jobs by uniform processors
• Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
• Equal processing time bicriteria scheduling on parallel machines
• Single-machine scheduling with positional due indices and positional deadlines
• Scheduling two agents on uniform parallel machines with~makespan and cost functions
• Multicriteria scheduling
• Scheduling identical jobs on uniform parallel machines
• Scheduling Problems with Two Competing Agents
• Multiagent Scheduling

This page was built for publication: Bicriteria scheduling of equal length jobs on uniform parallel machines