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

• Published in: Computers & industrial engineering Vol. 78; pp. 66 - 73
• Main Authors: Cheng, T.C.E., Liu, Chih-Yu, Lee, Wen-Chiung, Ji, M.
• Format: Journal Article
• Language: English
• Published: New York Elsevier Ltd 01.12.2014; Pergamon Press Inc
• Subjects: Algorithms; Branch & bound algorithms; Completion time; Computer simulation; Genetic algorithms; Industrial engineering; Job shops; Mathematical analysis; Mathematical functions; Mathematical models; Operations research; Optimization algorithms; Production scheduling; Scheduling; Simulated annealing; Single machine; Studies; Total completion time; Total tardiness; Two agents; Two agents; Scheduling; Total completion time; Total tardiness; Single machine

•We study a two-agent single-machine multi-objective scheduling problem.•The backward branch-and-bound algorithm can solve problems of up to 40 jobs.•The genetic algorithm with initial sequences has the best performance. Scheduling with two competing agents on a single machine has become a popular r...