Complexity of scheduling tasks with time-dependent execution times
Information Processing Letters
Three scheduling problems with deteriorating jobs to minimize the total completion time
Information Processing Letters
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
Computers and Industrial Engineering
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Information Processing Letters
Batching work and rework processes with limited deterioration of reworkables
Computers and Operations Research
Scheduling jobs under decreasing linear deterioration
Information Processing Letters
Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem
Expert Systems with Applications: An International Journal
Information Sciences: an International Journal
A two-machine flowshop problem with two agents
Computers and Operations Research
Scheduling problems with general effects of deterioration and learning
Information Sciences: an International Journal
Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times
Computers and Industrial Engineering
Information Sciences: an International Journal
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Computers and Operations Research
Genetic algorithms for a two-agent single-machine problem with release time
Applied Soft Computing
A tabu method for a two-agent single-machine scheduling with deterioration jobs
Computers and Operations Research
Information Sciences: an International Journal
Hi-index | 0.07 |
We consider a scheduling environment with two agents and a linear non-increasing deterioration. By the linear non-increasing deterioration we mean that the actual processing time of a job belonging to the two agents is defined as a non-increasing linear function of its starting time. Two agents compete to perform their respective jobs on a common single machine and each agent has his own criterion to be optimized. The goal is to schedule the jobs such that the combined schedule performs well with respect to the measures of both agents. Three different objective functions are considered for one agent, including the maximum earliness cost, total earliness cost and total weighted earliness cost, while keeping the maximum earliness cost of the other agent below or at a fixed level U. We propose the optimal (nondominated) properties and present the complexity results for the problems addressed here.