Ghent University Academic Bibliography

Advanced

A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions

Veronique Sels UGent, Nele Gheysen UGent and Mario Vanhoucke UGent (2012) INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. 50(15). p.4255-4270
abstract
In this paper, a comparison and validation of various priority rules for the job shop scheduling problem under different objective functions is made. In a first computational experiment, 30 priority rules from the literature are used to schedule job shop problems under two flow time-related and three tardiness-related objectives. Based on this comparative study, the priority rules are extended to 13 combined scheduling rules in order to improve the performance of the currently best-known rules from the literature. Moreover, the best-performing priority rules on each of these five objective functions are combined into hybrid priority rules in order to be able to optimise various objectives at the same time. In a second part of the computational experiment, the robustness on the relative ranking of the performance quality is checked for the various priority rules when applied on larger problem instances, on the extension of multiple machines possibilities per job as well as on the introduction of sequence-dependent setup times. Moreover, the influence of dynamic arrivals of jobs has also been investigated to check the robustness on the relative ranking of the performance quality between static and dynamic job arrivals. The results of the computational experiments are presented and critical remarks and future research avenues are suggested.
Please use this url to cite or link to this publication:
author
organization
year
type
journalArticle (original)
publication status
published
subject
keyword
flexible job shop, SELECTION, MINIMIZE, HEURISTICS, TABU SEARCH, EFFICIENT DISPATCHING RULES, DEPENDENT SETUP TIMES, priority rules, job shop
journal title
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Int. J. Prod. Res.
volume
50
issue
15
pages
4255 - 4270
Web of Science type
Article
Web of Science id
000306976900019
JCR category
OPERATIONS RESEARCH & MANAGEMENT SCIENCE
JCR impact factor
1.46 (2012)
JCR rank
22/78 (2012)
JCR quartile
2 (2012)
ISSN
0020-7543
DOI
10.1080/00207543.2011.611539
language
English
UGent publication?
yes
classification
A1
copyright statement
I have transferred the copyright for this publication to the publisher
id
1896303
handle
http://hdl.handle.net/1854/LU-1896303
date created
2011-09-01 11:32:24
date last changed
2015-06-17 09:50:04
@article{1896303,
  abstract     = {In this paper, a comparison and validation of various priority rules for the job shop scheduling problem under different objective functions is made. In a first computational experiment, 30 priority rules from the literature are used to schedule job shop problems under two flow time-related and three tardiness-related objectives. Based on this comparative study, the priority rules are extended to 13 combined scheduling rules in order to improve the performance of the currently best-known rules from the literature. Moreover, the best-performing priority rules on each of these five objective functions are combined into hybrid priority rules in order to be able to optimise various objectives at the same time. In a second part of the computational experiment, the robustness on the relative ranking of the performance quality is checked for the various priority rules when applied on larger problem instances, on the extension of multiple machines possibilities per job as well as on the introduction of sequence-dependent setup times. Moreover, the influence of dynamic arrivals of jobs has also been investigated to check the robustness on the relative ranking of the performance quality between static and dynamic job arrivals. The results of the computational experiments are presented and critical remarks and future research avenues are suggested.},
  author       = {Sels, Veronique and Gheysen, Nele and Vanhoucke, Mario},
  issn         = {0020-7543},
  journal      = {INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH},
  keyword      = {flexible job shop,SELECTION,MINIMIZE,HEURISTICS,TABU SEARCH,EFFICIENT DISPATCHING RULES,DEPENDENT SETUP TIMES,priority rules,job shop},
  language     = {eng},
  number       = {15},
  pages        = {4255--4270},
  title        = {A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions},
  url          = {http://dx.doi.org/10.1080/00207543.2011.611539},
  volume       = {50},
  year         = {2012},
}

Chicago
Sels, Veronique, Nele Gheysen, and Mario Vanhoucke. 2012. “A Comparison of Priority Rules for the Job Shop Scheduling Problem Under Different Flow Time- and Tardiness-related Objective Functions.” International Journal of Production Research 50 (15): 4255–4270.
APA
Sels, V., Gheysen, N., & Vanhoucke, M. (2012). A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 50(15), 4255–4270.
Vancouver
1.
Sels V, Gheysen N, Vanhoucke M. A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. 2012;50(15):4255–70.
MLA
Sels, Veronique, Nele Gheysen, and Mario Vanhoucke. “A Comparison of Priority Rules for the Job Shop Scheduling Problem Under Different Flow Time- and Tardiness-related Objective Functions.” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 50.15 (2012): 4255–4270. Print.