A parallel-machine scheduling problem with two competing agents. Issue 6 (3rd June 2017)

• Record Type: Journal Article
• Authors: Lee, Wen-Chiung; Chung, Yu-Hsiang; Wang, Jen-Ya
• Is Part Of: Engineering optimization. Volume 49:Issue 6(2017)
• Page Start: 962
• Page End: 975
• Publication Date: 2017-06-03
• Subjects: Scheduling -- total completion time -- two-agent problem -- parallel-machine problem -- maximum tardiness; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2016.1227615
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: Scheduling with two competing agents has become popular in recent years. Most of the research has focused on single-machine problems. This article considers a parallel-machine problem, the objective of which is to minimize the total completion time of jobs from the first agent given that the maximum tardiness of jobs from the second agent cannot exceed an upper bound. The NP-hardness of this problem is also examined. A genetic algorithm equipped with local search is proposed to search for the near-optimal solution. Computational experiments are conducted to evaluate the proposed genetic algorithm.