A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Theoretical Computer Science
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
Theoretical Computer Science
Mixed Criteria Packet Scheduling
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Reliability versus performance for critical applications
Journal of Parallel and Distributed Computing
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
Scheduling in multi-organization grids: measuring the inefficiency of decentralization
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Expert Systems with Applications: An International Journal
Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem
Expert Systems with Applications: An International Journal
A two-machine flowshop problem with two agents
Computers and Operations Research
Approximation algorithms for scheduling with a variable machine maintenance
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
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
Computers and Industrial Engineering
Minimizing the number of late jobs on a single machine under due date uncertainty
Journal of Scheduling
Scheduling two agents on uniform parallel machines with makespan and cost functions
Journal of Scheduling
Two-agent scheduling with learning consideration
Computers and Industrial Engineering
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
Information Sciences: an International Journal
On bilevel machine scheduling problems
OR Spectrum
Single-machine multi-agent scheduling problems with a global objective function
Journal of Scheduling
Two-Agent scheduling on an unbounded serial batching machine
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
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
Journal of Intelligent Manufacturing
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
A study of the single-machine two-agent scheduling problem with release times
Applied Soft Computing
Noncooperative Games for Subcontracting Operations
Manufacturing & Service Operations Management
Machine scheduling with contiguous processing constraints
Information Processing Letters
Bounded parallel-batching scheduling with two competing agents
Journal of Scheduling
A tabu method for a two-agent single-machine scheduling with deterioration jobs
Computers and Operations Research
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Maximum latency scheduling problem on two-person cooperative games
Journal of Combinatorial Optimization
A multi-agent system for the weighted earliness tardiness parallel machine problem
Computers and Operations Research
Single machine scheduling with interfering job sets
Computers and Operations Research
Hi-index | 0.01 |
We consider the scheduling problems arising when two agents, each with a set of nonpreemptive jobs, compete to perform their respective jobs on a common processing resource. Each agent wants to minimize a certain objective function, which depends on the completion times of its jobs only. The objective functions we consider in this paper are maximum of regular functions (associated with each job), number of late jobs, and total weighted completion times. We obtain different scenarios, depending on the objective function of each agent, and on the structure of the processing system (single machine or shop). For each scenario, we address the complexity of various problems, namely, finding the optimal solution for one agent with a constraint on the other agent's cost function, finding single nondominated schedules (i.e., such that a better schedule for one of the two agents necessarily results in a worse schedule for the other agent), and generating all nondominated schedules.