Single facility scheduling with nonlinear processing times
Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor
Operations Research
Tabu search for total tardiness minimization in flowshop scheduling problems
Computers and Operations Research
A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
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
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Time-Dependent Scheduling
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
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
A note on single-processor scheduling with time-dependent execution times
Operations Research Letters
An investigation on a two-agent single-machine scheduling problem with unequal release dates
Computers and Operations Research
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
Journal of Intelligent Manufacturing
A study of the single-machine two-agent scheduling problem with release times
Applied Soft Computing
Hi-index | 0.01 |
In recent 10 years, the multi-agent idea applied in scheduling issues has received continuing attention. However, the study of the multi-agent scheduling with deteriorating jobs is relatively limited. In light of this, this paper deliberates upon a two-agent single-machine scheduling problem with deteriorating jobs. Taking the proposed model, the actual processing time of a job from both the first agent and the second agent is modeled as a linearly increasing function of its starting time. The goal of this paper is to minimize the total weighted number of tardy jobs of the first agent subject to the condition that the maximum lateness of the second agent is allowed to have an upper bound. The complexity of the model concerned in the paper is claimed as an NP-hard one. Following that, several dominance rules and a lower bound are proposed to be applied in a branch-and-bound algorithm for the optimal solution, and a tabu algorithm is applied to find near-optimal solutions for the problem. The simulation results obtained from all the proposed algorithms are also reported.