Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints

DOI10.1016/j.disopt.2017.02.004zbMath1387.90088OpenAlexW2595195611MaRDI QIDQ1751234

Yuan Gao, Jinjiang Yuan

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2017.02.004

zbMATH Keywords

precedence constraintsbi-criteriapositional due indicesPareto-scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Pareto-scheduling of two competing agents with their own equal processing times ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ A note on competing-agent Pareto-scheduling ⋮ Single-machine scheduling with positional due indices and positional deadlines ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ 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

• Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
• Pareto minimizing total completion time and maximum cost with positional due indices
• A note on Pareto minimizing total completion time and maximum cost
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• Scheduling Problems with Two Competing Agents
• Complexity of Scheduling under Precedence Constraints
• Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Multiagent Scheduling
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints