A study of the single-machine two-agent scheduling problem with release times

Authors:
Chin-Chia Wu;Wen-Hung Wu;Juei-Chao Chen;Yunqiang Yin;Wen-Hsiang Wu
Affiliations:
Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Business Administration, Kang-Ning Junior College, Taipei, Taiwan;Department of Statistics and Information Science & Graduate Institute of Applied Statistics, Fu-Jen Catholic University, Taipei County, Taiwan;School of Mathematics and Information Sciences, East China Institute of Technology, Fuzhou, Jiangxi 344000, China;Department of Healthcare Management, Yuanpei University, Hsinchu, Taiwan
Venue:
Applied Soft Computing
Year:
2013

Citing 14
Cited 1

Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness

Computers and Industrial Engineering
Ant algorithms for discrete optimization

Artificial Life
A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
Improved genetic algorithm for the permutation flowshop scheduling problem

Computers and Operations Research
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
A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem

Expert Systems with Applications: An International Journal
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

Computers and Operations Research
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems

Computer-Aided Design
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations

Journal of Intelligent Manufacturing

A tabu method for a two-agent single-machine scheduling with deterioration jobs

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many management situations, multiple agents compete on the usage of common processing resources. On the other hand, the importance of the ready times can be shown in Wafer fabrication with the presence of unequal ready times. It is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. However, research on scheduling with two-agent and ready time simultaneously is relatively unexplored. This paper addresses a single-machine two-agent scheduling problem with ready times. The aim is to find an optimal schedule to minimize the total completion time of the jobs of the first agent with the restriction that total completion time is allowed an upper bound for the second agent. To the best of our knowledge, the problem under study has not been considered. Firstly, we show that the proposed problem is strongly NP-hard. Following that, we then develop a branch-and-bound, an ant colony, and four genetic algorithms for an optimal and near-optimal solution, respectively. In addition, the extensive computational experiments are also given.