Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Nondominated Schedules for a Job-Shop with Two Competing Users
Computational & Mathematical Organization Theory
Scheduling Problems with Two Competing Agents
Operations Research
A note on the scheduling with two families of jobs
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
A DP algorithm for minimizing makespan and total completion time on a series-batching machine
Information Processing Letters
A Lagrangian approach to single-machine scheduling problems with two competing agents
Journal of Scheduling
A decision support system for production scheduling in an ion plating cell
Expert Systems with Applications: An International Journal
Competitive Two-Agent Scheduling and Its Applications
Operations Research
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
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
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
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
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
Maximum latency scheduling problem on two-person cooperative games
Journal of Combinatorial Optimization
Single machine scheduling with interfering job sets
Computers and Operations Research
Hi-index | 0.01 |
We consider a scheduling problem involving a single processor being utilized by two or more customers. Traditionally, such scenarios are modeled by assuming that each customer has the same criterion. In practice, this assumption may not hold. Instead of using a single criterion, we examine the implications of minimizing an aggregate scheduling objective function in which jobs belonging to different customers are evaluated based on their individual criteria. We examine three basic scheduling criteria: minimizing makespan, minimizing maximum lateness, and minimizing total weighted completion time. Although determining a minimum-cost schedule according to any one of these criteria is polynomially solvable, we demonstrate that when minimizing a mix of these criteria, the problem becomes NP-hard.