Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume 23, Issue 5, Pages 1949-1958Publisher
SPRINGER
DOI: 10.1007/s10845-011-0522-8
Keywords
Parallel machine scheduling; Hybrid optimization; Neighborhood search; Makespan minimization; Mixed-integer programming
Funding
- Cyprus Research Promotion Foundation [TEXNO/0603/08-NETEXNOPRO]
Ask authors/readers for more resources
The NP-hard problem of scheduling jobs on unrelated parallel machines, in the presence of machine-dependent and sequence-dependent setup times, with the objective of minimizing the makespan, is considered. A variable neighborhood descent search algorithm, hybridized with mathematical programming elements, is presented and its performance is evaluated on a large set of benchmark problem instances. The extensive computational experiments show that the proposed algorithm outperforms previously proposed methods in terms of solution quality as well as computation time.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available