A single-machine bi-criterion scheduling problem with two agents

作者：

Highlights：

• We study a two-agent single-machine multi-objective scheduling problem.

• We propose a branch-and-bound and seveal simulated annealing algorithms.

• The branch-and-bound algorithm can solve problems of up to 24 jobs.

• The mean error percentage of the combined SA algorithm is less than 0.5%.

摘要

Highlights•We study a two-agent single-machine multi-objective scheduling problem.•We propose a branch-and-bound and seveal simulated annealing algorithms.•The branch-and-bound algorithm can solve problems of up to 24 jobs.•The mean error percentage of the combined SA algorithm is less than 0.5%.

论文关键词：Scheduling,Total completion time,Maximum tardiness,Two-agent,Single-machine

论文评审过程：Available online 11 June 2013.

论文官网地址：https://doi.org/10.1016/j.amc.2013.05.025