Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/79025
Title: Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks
Authors: Wu, LX 
Wang, SA 
Keywords: Scheduling
Parallel machine
Multi-processor tasks
Branch and bound
Tabu search
Issue Date: 2018
Publisher: Elsevier
Source: International journal of production economics, July 2018, v. 201, p. 26-40 How to cite?
Journal: International journal of production economics 
Abstract: This paper studies a special parallel machine scheduling problem where some tasks require more than one machine to process, known as the Parallel Machine Scheduling Problem with Multi-processor Tasks. Two mathematical models and several theoretical properties are proposed for the studied problem. To solve this problem, this paper develops an exact branch and bound algorithm and a heuristic tabu search algorithm. A series of numerical experiments are conducted to test the performance of these solution methods. The computational results show that the solution methods are effective and efficient in solving the problem with different sizes.
URI: http://hdl.handle.net/10397/79025
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2018.04.013
Appears in Collections:Journal/Magazine Article

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

Page view(s)

5
Citations as of Dec 3, 2018

Google ScholarTM

Check

Altmetric


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