Paper Info
Title
Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
Abstract
This paper investigates a competitive two-agent parallel-batching scheduling problem with aging effect on parallel machines. The objective is to minimize the makespan of agent A with the constraint that the makespan of agent B is no more than a given threshold. Some key structural properties are first identified in two different cases, and based on these structural properties a novel decision tree of scheduling rules is constructed and a heuristic algorithm is designed. Then, an effective hybrid BF-VNS algorithm combining Bacterial Foraging (BF) with variable neighborhood search (VNS) is developed to tackle the studied problem. Computational experiments are conducted to evaluate the performance of the proposed hybrid algorithm and some other well-known algorithms. The experimental results indicate that the hybrid BF-VNS algorithm performs quite better than the compared algorithms.
Year
DOI
Venue
2020
10.1007/s10479-019-03160-y
Annals of Operations Research
Keywords
DocType
Volume
Scheduling, Two-agent, Parallel-batching, Aging effect, Bacterial Foraging, Variable neighborhood search
Journal
294
Issue
ISSN
Citations 
1
1572-9338
2
PageRank 
References 
Authors
0.63
36
5
Name
Order
Citations
PageRank
Jun Pei120226.56
Jinling Wei220.63
Baoyu Liao362.37
Xin-Bao Liu425426.14
P. M. Pardalos526945.19