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
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Information Sciences: an International Journal
A new approach to the learning effect: Beyond the learning curve restrictions
Computers and Operations Research
Dispatching policy for manufacturing jobs and time-delay plots
International Journal of Computer Integrated Manufacturing
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
A single-machine bi-criterion learning scheduling problem with release times
Expert Systems with Applications: An International Journal
Solution algorithms for the makespan minimization problem with the general learning model
Computers and Industrial Engineering
Two-machine flow shop problem with effects of deterioration and learning
Computers and Industrial Engineering
Single-machine scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Scheduling problems with deteriorating jobs and learning effects including proportional setup times
Computers and Industrial Engineering
Scheduling with job-dependent learning effects and multiple rate-modifying activities
Information Processing Letters
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect
Computers and Industrial Engineering
Minimizing the makespan on a single machine with learning and unequal release times
Computers and Industrial Engineering
Single-machine scheduling with learning effect and resource-dependent processing times
Computers and Industrial Engineering
A two-machine flowshop problem with two agents
Computers and Operations Research
Mathematical and Computer Modelling: An International Journal
Some single-machine scheduling problems with a truncation learning effect
Computers and Industrial Engineering
Computers and Industrial Engineering
Two-machine flowshop scheduling with truncated learning to minimize the total completion time
Computers and Industrial Engineering
Information Sciences: an International Journal
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
A periodic tabular policy for scheduling of a single stage production-inventory system
Computers and Industrial Engineering
Computers and Industrial Engineering
Genetic algorithms for a two-agent single-machine problem with release time
Applied Soft Computing
Journal of Intelligent Manufacturing
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves
Computers and Industrial Engineering
A study of the single-machine two-agent scheduling problem with release times
Applied Soft Computing
A tabu method for a two-agent single-machine scheduling with deterioration jobs
Computers and Operations Research
Several flow shop scheduling problems with truncated position-based learning effect
Computers and Operations Research
Hi-index | 0.01 |
Scheduling with learning effects has received a lot of research attention lately. By learning effect, we mean that job processing times can be shortened through the repeated processing of similar tasks. On the other hand, different entities (agents) interact to perform their respective tasks, negotiating among one another for the usage of common resources over time. However, research in the multi-agent setting is relatively limited. Meanwhile, the actual processing time of a job under an uncontrolled learning effect will drop to zero precipitously as the number of jobs increases or a job with a long processing time exists. Motivated by these observations, we consider a two-agent scheduling problem in which the actual processing time of a job in a schedule is a function of the sum-of-processing-times-based learning and a control parameter of the learning function. The objective is to minimize the total weighted completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We develop a branch-and-bound and three simulated annealing algorithms to solve the problem. Computational results show that the proposed algorithms are efficient in producing near-optimal solutions.