Computers and Operations Research
Nondominated Schedules for a Job-Shop with Two Competing Users
Computational & Mathematical Organization Theory
A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Scheduling Problems with Two Competing Agents
Operations Research
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Theoretical Computer Science
A two-machine flowshop problem with two agents
Computers and Operations Research
Single-machine scheduling problems with two agents competing for makespan
LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part I
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
Genetic algorithms for a two-agent single-machine problem with release time
Applied Soft Computing
Scheduling problems with two competing agents to minimized weighted earliness-tardiness
Computers and Operations Research
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
Computers and Operations Research
Unbounded parallel-batching scheduling with two competitive agents
Journal of Scheduling
Approximation schemes for two-machine flow shop scheduling with two agents
Journal of Combinatorial Optimization
Approximation schemes for two-agent scheduling on parallel machines
Theoretical Computer Science
Hi-index | 0.01 |
In this paper, we develop branch-and-bound algorithms for several hard, two-agent scheduling problems, i.e., problems in which each agent has an objective function which depends on the completion times of its jobs only. Our bounding approach is based on the fact that, for all problems considered, the Lagrangian dual gives a good bound and can be solved exactly in strongly polynomial time. The problems addressed here consist in minimizing the total weighted completion time of the jobs of agent A, subject to a bound on the cost function of agent B, which may be: (i) total weighted completion time, (ii) maximum lateness, (iii) maximum completion time. An extensive computational experience shows the effectiveness of the approach.