Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions

Edwin Tai Chiu Cheng; Chih Yu Liu; Wen Chiung Lee; M. Ji

doi:10.1016/j.cie.2014.09.028

Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions

Edwin Tai Chiu Cheng, Chih Yu Liu, Wen Chiung Lee, M. Ji

Research output: Journal article publication › Journal article › Academic research › peer-review

15 Citations (Scopus)

Abstract

Scheduling with two competing agents on a single machine has become a popular research topic in recent years. Most research focuses on minimizing the objective function of one agent, subject to the objective function of the other agent does not exceed a given limit. In this paper we adopt a weighted combination approach to treat the two-agent single-machine scheduling problem. The objective that we seek to minimize is the weighted sum of the total completion time of the jobs of one agent and the total tardiness of the jobs of the other agent. We provide two branch-and-bound algorithms to solve the problem. In addition, we present a simulated annealing and two genetic algorithms to obtain near-optimal solutions. We report the results of the computational experiments conducted to test the performance of the proposed algorithms.

Original language	English
Pages (from-to)	66-73
Number of pages	8
Journal	Computers and Industrial Engineering
Volume	78
DOIs	https://doi.org/10.1016/j.cie.2014.09.028
Publication status	Published - 1 Jan 2014

Keywords

Scheduling
Single machine
Total completion time
Total tardiness
Two agents

ASJC Scopus subject areas

General Computer Science
General Engineering

More information

10.1016/j.cie.2014.09.028

Cite this

@article{3af2ecdf67af4e9bbda09cb4685c1e4f,

title = "Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions",

abstract = "Scheduling with two competing agents on a single machine has become a popular research topic in recent years. Most research focuses on minimizing the objective function of one agent, subject to the objective function of the other agent does not exceed a given limit. In this paper we adopt a weighted combination approach to treat the two-agent single-machine scheduling problem. The objective that we seek to minimize is the weighted sum of the total completion time of the jobs of one agent and the total tardiness of the jobs of the other agent. We provide two branch-and-bound algorithms to solve the problem. In addition, we present a simulated annealing and two genetic algorithms to obtain near-optimal solutions. We report the results of the computational experiments conducted to test the performance of the proposed algorithms.",

keywords = "Scheduling, Single machine, Total completion time, Total tardiness, Two agents",

author = "Cheng, {Edwin Tai Chiu} and Liu, {Chih Yu} and Lee, {Wen Chiung} and M. Ji",

year = "2014",

month = jan,

day = "1",

doi = "10.1016/j.cie.2014.09.028",

language = "English",

volume = "78",

pages = "66--73",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

}

TY - JOUR

T1 - Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions

AU - Cheng, Edwin Tai Chiu

AU - Liu, Chih Yu

AU - Lee, Wen Chiung

AU - Ji, M.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Scheduling with two competing agents on a single machine has become a popular research topic in recent years. Most research focuses on minimizing the objective function of one agent, subject to the objective function of the other agent does not exceed a given limit. In this paper we adopt a weighted combination approach to treat the two-agent single-machine scheduling problem. The objective that we seek to minimize is the weighted sum of the total completion time of the jobs of one agent and the total tardiness of the jobs of the other agent. We provide two branch-and-bound algorithms to solve the problem. In addition, we present a simulated annealing and two genetic algorithms to obtain near-optimal solutions. We report the results of the computational experiments conducted to test the performance of the proposed algorithms.

AB - Scheduling with two competing agents on a single machine has become a popular research topic in recent years. Most research focuses on minimizing the objective function of one agent, subject to the objective function of the other agent does not exceed a given limit. In this paper we adopt a weighted combination approach to treat the two-agent single-machine scheduling problem. The objective that we seek to minimize is the weighted sum of the total completion time of the jobs of one agent and the total tardiness of the jobs of the other agent. We provide two branch-and-bound algorithms to solve the problem. In addition, we present a simulated annealing and two genetic algorithms to obtain near-optimal solutions. We report the results of the computational experiments conducted to test the performance of the proposed algorithms.

KW - Scheduling

KW - Single machine

KW - Total completion time

KW - Total tardiness

KW - Two agents

UR - http://www.scopus.com/inward/record.url?scp=84908367272&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2014.09.028

DO - 10.1016/j.cie.2014.09.028

M3 - Journal article

SN - 0360-8352

VL - 78

SP - 66

EP - 73

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

ER -

Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this