A heuristic hybrid framework for vector job scheduling
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...
Main Authors: | Amaldass Nareyus I Lawrance, Lucas Cormac, Mladenovic Nenad |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2017-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600013A.pdf |
Similar Items
-
Variable neighbourhood search for financial derivative problem
by: Lawrance Amaldass Nareyus I, et al.
Published: (2019-01-01) -
Solution Merging in Matheuristics for Resource Constrained Job Scheduling
by: Dhananjay Thiruvady, et al.
Published: (2020-10-01) -
Variable Neighborhood Search Algorithms for an Integrated Manufacturing and Batch Delivery Scheduling Minimizing Total Tardiness
by: Cheol Min Joo, et al.
Published: (2019-11-01) -
Modeling and scheduling no-idle hybrid flow shop problems
by: Mehdi Yazdani, et al.
Published: (2016-12-01) -
A hybrid meta-heuristic algorithm for dual resource constrained flexible job shop scheduling problem
by: Reza Tavakkoli-Moghaddam, et al.
Published: (2015-01-01)