Two-agent single-machine scheduling with release dates to minimize the makespan

DOI10.1007/s11590-022-01967-6OpenAlexW4313644914MaRDI QIDQ6081603

Xi-wen Lu, Jin Yu, Peihai Liu

Publication date: 26 October 2023

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

Full work available at URL: https://doi.org/10.1007/s11590-022-01967-6

zbMATH Keywords

approximation algorithmmakespantwo-agent schedulingFPTASrelease date

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Two-agent scheduling in a flowshop
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness
• Two-agent scheduling to minimize the total cost
• Two-agent scheduling on uniform parallel machines with min-max criteria
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine
• Scheduling two agents with controllable processing times
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Approximation schemes for two-machine flow shop scheduling with two agents
• A note on competing-agent Pareto-scheduling
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• Two-agent scheduling on a single machine with release dates
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• A multiple-criterion model for machine scheduling
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• A comment on scheduling two parallel machines with capacity constraints
• Competitive Two-Agent Scheduling and Its Applications
• A competitive scheduling problem and its relevance to UMTS channel assignment
• Scheduling Problems with Two Competing Agents
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Single machine just‐in‐time scheduling problems with two competing agents
• Multiagent Scheduling
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Two-agent single-machine scheduling with release dates to minimize the makespan