title: Single-machine scheduling to minimize total completion time and tardiness with two competing agents.
abstract: We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.
authors.affiliation: Department of Statistics, Feng Chia University, Taichung, Taiwan.
authors.forename: Wen-Chiung
authors.identifier: 0000-0002-6578-7479
authors.initials: WC
authors.lastname: Lee
authors.affiliation: Department of Industrial Engineering and System Management, Feng Chia University, Taichung, Taiwan.
authors.forename: Yau-Ren
authors.initials: YR
authors.lastname: Shiau
authors.affiliation: Department of Industrial & Engineering Management, National Chiao Tung University, Hsinchu, Taiwan.
authors.forename: Yu-Hsiang
authors.initials: YH
authors.lastname: Chung
authors.affiliation: Department of Statistics, Feng Chia University, Taichung, Taiwan.
authors.forename: Lawson
authors.initials: L
authors.lastname: Ding
mesh_terms: D000465:Algorithms; D008962:Models, Theoretical