Advanced search
1 file | 128.22 KB Add to list

Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabrics

Author
Organization
Abstract
This paper studies a complex variation of the parallel machine scheduling (PMS) problem, as encountered at a Belgian producer of knitted fabrics. The aim is to assign N J jobs to N M unrelated parallel machines, minimising a weighted combination of job lateness and tardiness. Jobs are assigned specific release, and due dates and changeover times are sequence dependent. Current literature is extended by including geographically dispersed production locations, which influence job due dates and objective function coefficients. Furthermore, the changeover interference due to limited availability of technicians is also studied in this paper. The scheduling problem is solved using a hybrid meta-heuristic, which combines elements from simulated annealing and genetic algorithms. This hybrid meta-heuristic is capable of solving real-scale scheduling problems of up to 750 jobs, 75 machines and 10 production locations within reasonable computation time. This hybrid scheduling procedure is extended with heuristic dispatching rules capable of reducing the impact of changeover interference by 23% on average compared to the random scenario, for the case where a single technician is expected to serve up to 12 machines.
Keywords
hybrid meta-heuristic, geographically dispersed production locations, changeover interference, case study, TIMES, parallel machine scheduling, COMMON SERVER, MAXIMUM LATENESS, HYBRID ALGORITHM, TARDINESS PENALTIES, INTERFERENCE PROBLEM, PRECEDENCE CONSTRAINTS, GENETIC ALGORITHM, KeyWords Plus:SEQUENCE-DEPENDENT SETUP, SINGLE-SERVER

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 128.22 KB

Citation

Please use this url to cite or link to this publication:

MLA
Kerkhove, Louis-Philippe, and Mario Vanhoucke. “Scheduling of Unrelated Parallel Machines with Limited Server Availability on Multiple Production Locations: a Case Study in Knitted Fabrics.” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 52.9 (2014): 2630–2653. Print.
APA
Kerkhove, Louis-Philippe, & Vanhoucke, M. (2014). Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabrics. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 52(9), 2630–2653.
Chicago author-date
Kerkhove, Louis-Philippe, and Mario Vanhoucke. 2014. “Scheduling of Unrelated Parallel Machines with Limited Server Availability on Multiple Production Locations: a Case Study in Knitted Fabrics.” International Journal of Production Research 52 (9): 2630–2653.
Chicago author-date (all authors)
Kerkhove, Louis-Philippe, and Mario Vanhoucke. 2014. “Scheduling of Unrelated Parallel Machines with Limited Server Availability on Multiple Production Locations: a Case Study in Knitted Fabrics.” International Journal of Production Research 52 (9): 2630–2653.
Vancouver
1.
Kerkhove L-P, Vanhoucke M. Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabrics. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. 2014;52(9):2630–53.
IEEE
[1]
L.-P. Kerkhove and M. Vanhoucke, “Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabrics,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol. 52, no. 9, pp. 2630–2653, 2014.
@article{5708913,
  abstract     = {This paper studies a complex variation of the parallel machine scheduling (PMS) problem, as encountered at a Belgian producer of knitted fabrics. The aim is to assign N J jobs to N M unrelated parallel machines, minimising a weighted combination of job lateness and tardiness. Jobs are assigned specific release, and due dates and changeover times are sequence dependent. Current literature is extended by including geographically dispersed production locations, which influence job due dates and objective function coefficients. Furthermore, the changeover interference due to limited availability of technicians is also studied in this paper. The scheduling problem is solved using a hybrid meta-heuristic, which combines elements from simulated annealing and genetic algorithms. This hybrid meta-heuristic is capable of solving real-scale scheduling problems of up to 750 jobs, 75 machines and 10 production locations within reasonable computation time. This hybrid scheduling procedure is extended with heuristic dispatching rules capable of reducing the impact of changeover interference by 23% on average compared to the random scenario, for the case where a single technician is expected to serve up to 12 machines.},
  author       = {Kerkhove, Louis-Philippe and Vanhoucke, Mario},
  issn         = {0020-7543},
  journal      = {INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH},
  keywords     = {hybrid meta-heuristic,geographically dispersed production locations,changeover interference,case study,TIMES,parallel machine scheduling,COMMON SERVER,MAXIMUM LATENESS,HYBRID ALGORITHM,TARDINESS PENALTIES,INTERFERENCE PROBLEM,PRECEDENCE CONSTRAINTS,GENETIC ALGORITHM,KeyWords Plus:SEQUENCE-DEPENDENT SETUP,SINGLE-SERVER},
  language     = {eng},
  number       = {9},
  pages        = {2630--2653},
  title        = {Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabrics},
  url          = {http://dx.doi.org/10.1080/00207543.2013.865855},
  volume       = {52},
  year         = {2014},
}

Altmetric
View in Altmetric
Web of Science
Times cited: