Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization

Integer programming (90C10) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

Unnamed Item
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
Scheduling problems with two competing agents to minimized weighted earliness-tardiness
Two-agent scheduling on uniform parallel machines with min-max criteria
Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
Fixed interval scheduling: models, applications, computational complexity and algorithms
An optimal greedy heuristic to color interval graphs
Scheduling two agents with controllable processing times
Scheduling interfering job sets on parallel machines
Two-agent parallel-machine scheduling with rejection
Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
Approximation schemes for two-agent scheduling on parallel machines
Scheduling batches in flowshop with limited buffers in the shampoo industry
Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
An approximation algorithm for multi-agent scheduling on two uniform parallel machines
An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
Single-machine multi-agent scheduling problems with a global objective function
A multiple-criterion model for machine scheduling
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
Competitive Two-Agent Scheduling and Its Applications
Scheduling Problems with Two Competing Agents
On Finding the Maxima of a Set of Vectors
Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
Scheduling independent tasks to reduce mean finishing time
Multiagent Scheduling
Solving multi-agent scheduling problems on parallel machines with a global objective function
Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan

This page was built for publication: Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization