Two-agent singe-machine scheduling with release times to minimize the total weighted completion time

Authors:
T. C. E. Cheng;Yu-Hsiang Chung;Shan-Ci Liao;Wen-Chiung Lee
Affiliations:
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Industrial & Engineering Management, National Chiao Tung University, Hsinchu, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan
Venue:
Computers and Operations Research
Year:
2013

Citing 11
Cited 1

Scheduling with release dates on a single machine to minimize total weighted completion time

Discrete Applied Mathematics
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
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

Information Processing Letters
A Lagrangian approach to single-machine scheduling problems with two competing agents

Journal of Scheduling
Competitive Two-Agent Scheduling and Its Applications

Operations Research
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

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

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In many management situations multiple agents pursuing different objectives compete on the usage of common processing resources. In this paper we study a two-agent single-machine scheduling problem with release times where the objective is to minimize the total weighted completion time of the jobs of one agent with the constraint that the maximum lateness of the jobs of the other agent does not exceed a given limit. We propose a branch-and-bound algorithm to solve the problem, and a primary and a secondary simulated annealing algorithm to find near-optimal solutions. We conduct computational experiments to test the effectiveness of the algorithms. The computational results show that the branch-and-bound algorithm can solve most of the problem instances with up to 24 jobs in a reasonable amount of time and the primary simulated annealing algorithm performs well with an average percentage error of less than 0.5% for all the tested cases.