A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect

Wen Hung Wu, Yunqiang Yin, Edwin Tai Chiu Cheng, Win Chin Lin, Juei Chao Chen, Shin Yi Luo, Chin Chia Wu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

11 Citations (Scopus)


This paper considers a scheduling model involving two agents, job release times, and the sum-of-processing-times-based learning effect. The sum-of-processing-times-based learning effect means that the actual processing time of a job of either agent is a decreasing function of the sum of the processing times of the jobs already scheduled in a given schedule. The goal is to seek for an optimal schedule that minimizes the total weighted completion time of the first agent, subject to no tardy job for the second agent. We first provide a branch-and-bound method to solve the problem. We then develop an approach that combines genetic algorithm and simulated annealing to seek for approximate solutions for the problem. We carry on extensive computational tests to assess the performance of the proposed algorithms.
Original languageEnglish
Pages (from-to)111-120
Number of pages10
JournalJournal of the Operational Research Society
Issue number2
Publication statusPublished - 1 Feb 2017


  • Agent scheduling
  • Branch-and-bound algorithm
  • Genetic algorithm
  • Simulated annealing
  • Sum-of-processing-times-based learning effect

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Cite this