Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21279
Title: A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
Authors: Yin, Y
Wu, WH
Cheng, TCE 
Wu, CC
Wu, WH
Keywords: MBO algorithm
Scheduling
Two agents
Issue Date: 2015
Publisher: Elsevier
Source: Applied mathematical modelling, 2015, v. 39, no. 9, p. 2587-2601 How to cite?
Journal: Applied mathematical modelling 
Abstract: In this paper we consider two agents that compete on the use of a common processor. Each of the agents has a set of jobs that have to be processed on the same machine without preemption. Each of the agents wants to minimize an objective function that depends on the completion time of its own jobs. In addition, each job has different release dates. In the presence of unequal release dates, it is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. The objective is to find a schedule that performs well with respect to the objectives of both agents. To solve this difficulty problem, we construct a branch-and-bound solution scheme incorporating these bounds and some dominance rules for the optimal solution. In view of the advantage of combining local and global searches in the honey-bees optimization algorithm, we attempt to use a marriage in honey-bees optimization algorithm (MBO) to find near-optimal solutions. We conduct extensive computational experiments to evaluate the performance of the algorithms.
URI: http://hdl.handle.net/10397/21279
ISSN: 0307-904X
DOI: 10.1016/j.apm.2014.10.044
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Dec 1, 2017

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Dec 13, 2017

Page view(s)

71
Last Week
1
Last month
Checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.