Sequencing with earliness and tardiness penalties: a review
Operations Research
Common due date assignment and scheduling with ready times
Computers and Operations Research
A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Scheduling Problems with Two Competing Agents
Operations Research
Computers and Operations Research
Minmax scheduling problems with a common due-window
Computers and Operations Research
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Information Processing Letters
A Lagrangian approach to single-machine scheduling problems with two competing agents
Journal of Scheduling
Competitive Two-Agent Scheduling and Its Applications
Operations Research
A two-machine flowshop problem with two agents
Computers and Operations Research
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
Unbounded parallel-batching scheduling with two competitive agents
Journal of Scheduling
A tabu method for a two-agent single-machine scheduling with deterioration jobs
Computers and Operations Research
Hi-index | 0.01 |
We study scheduling problems with two competing agents, sharing the same machines. All the jobs of both agents have identical processing times and a common due date. Each agent needs to process a set of jobs, and has his own objective function. The objective of the first agent is total weighted earliness-tardiness, whereas the objective of the second agent is maximum weighted deviation from the common due date. Our goal is to minimize the objective of the first agent, subject to an upper bound on the objective value of the second agent. We consider a single machine, and parallel (both identical and uniform) machine settings. An optimal solution in all cases is shown to be obtained in polynomial time by solving a number of linear assignment problems. We show that the running times of the single and the parallel identical machine algorithms are O(n^m^+^3), where n is the number of jobs and m is the number of machines. The algorithm for solving the problem on parallel uniform machine requires O(n^m^+^3m^3) time, and under very reasonable assumptions on the machine speeds, is reduced to O(n^m^+^3). Since the number of machines is given, these running times are polynomial in the number of jobs.