Authors: Lawrance, Nareyus
Lucas, Cormac
Mladenović, Nenad 
Title: A heuristic hybrid framework for vector job scheduling
Journal: Yugoslav Journal of Operations Research
Volume: 27
Issue: 1
First page: 31
Last page: 45
Issue Date: 1-Jan-2017
Rank: M51
ISSN: 0354-0243
DOI: 10.2298/YJOR150416013A
We examine the first phase of a known NP-hard 2-stage assembly problem. It consists of sequencing a set of jobs having multiple components to be processed. Each job has to be worked on independently on a specific machine. We consider these jobs to form a vector of tasks. Our objective is to schedule jobs on the particular machines in order to minimize the completion time before the second stage starts. We first develop a new mathematical programming formulation of the problem and test it on a small problem instance using an integer programming solver. Then, we develop a heuristic algorithm based on Ant Colony Optimization and Variable Neighborhood Search metaheuristics in order to minimize the total completion time. The performance of our implementation appears to be efficient and effective.
Keywords: Ant colony optimization | Integer programming | Scheduling | Variable neighborhood search
Publisher: Faculty of Organizational Sciences, University of Belgrade
Project: RSF grant 14-41-00039

Show full item record


checked on Jun 21, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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