Home > Research > Publications & Outputs > Variable neighborhood search for the workload b...

Research

Electronic data

  • \\LANCS\homes\23\msambw\My Documents\ILSforWBP

    Rights statement: The final, definitive version of this article has been published in the Journal, Computers and Operations Research, 52 (Part B), 2014, © ELSEVIER.

    Submitted manuscript, 372 KB, PDF document

Links

Text available via DOI:

Keywords

View graph of relations

Variable neighborhood search for the workload balancing problem in service enterprises

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Variable neighborhood search for the workload balancing problem in service enterprises. / Nguyen, Thi; Wright, Mike.
In: Computers and Operations Research, Vol. 52, No. Part B, 12.2014, p. 282-290.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Nguyen, T & Wright, M 2014, 'Variable neighborhood search for the workload balancing problem in service enterprises', Computers and Operations Research, vol. 52, no. Part B, pp. 282-290. https://doi.org/10.1016/j.cor.2013.07.027

APA

Nguyen, T., & Wright, M. (2014). Variable neighborhood search for the workload balancing problem in service enterprises. Computers and Operations Research, 52(Part B), 282-290. https://doi.org/10.1016/j.cor.2013.07.027

Vancouver

Nguyen T, Wright M. Variable neighborhood search for the workload balancing problem in service enterprises. Computers and Operations Research. 2014 Dec;52(Part B):282-290. Epub 2013 Aug 6. doi: 10.1016/j.cor.2013.07.027

Author

Nguyen, Thi ; Wright, Mike. / Variable neighborhood search for the workload balancing problem in service enterprises. In: Computers and Operations Research. 2014 ; Vol. 52, No. Part B. pp. 282-290.

Bibtex

@article{3b08ade323fd470d9e746ba5b308801d,
title = "Variable neighborhood search for the workload balancing problem in service enterprises",
abstract = "In this paper, we consider a major telecommunication service company facing seasonal demand and time-varying capacity. A uniform lead-time, which is the maximum time span a customer has to wait before receiving the required service, is quoted to all customers. We present quadratic integer programming model for the problem of scheduling jobs to meet the promised lead-time with objective of workload balancing across time. Since in practice, solving such a problem to optimality can be very dicult, two variants of a variable neighborhood search heuristic are proposed. Extensive computational testsshow that our approaches are able to provide high quality solutions efficiently.",
keywords = "Scheduling, Quadratic integer programming, Variable neighborhood search, Meta-heuristic, Capacity management",
author = "Thi Nguyen and Mike Wright",
note = "The final, definitive version of this article has been published in the Journal, Computers and Operations Research, 52 (Part B), 2014, {\textcopyright} ELSEVIER.",
year = "2014",
month = dec,
doi = "10.1016/j.cor.2013.07.027",
language = "English",
volume = "52",
pages = "282--290",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "Part B",

}

RIS

TY - JOUR

T1 - Variable neighborhood search for the workload balancing problem in service enterprises

AU - Nguyen, Thi

AU - Wright, Mike

N1 - The final, definitive version of this article has been published in the Journal, Computers and Operations Research, 52 (Part B), 2014, © ELSEVIER.

PY - 2014/12

Y1 - 2014/12

N2 - In this paper, we consider a major telecommunication service company facing seasonal demand and time-varying capacity. A uniform lead-time, which is the maximum time span a customer has to wait before receiving the required service, is quoted to all customers. We present quadratic integer programming model for the problem of scheduling jobs to meet the promised lead-time with objective of workload balancing across time. Since in practice, solving such a problem to optimality can be very dicult, two variants of a variable neighborhood search heuristic are proposed. Extensive computational testsshow that our approaches are able to provide high quality solutions efficiently.

AB - In this paper, we consider a major telecommunication service company facing seasonal demand and time-varying capacity. A uniform lead-time, which is the maximum time span a customer has to wait before receiving the required service, is quoted to all customers. We present quadratic integer programming model for the problem of scheduling jobs to meet the promised lead-time with objective of workload balancing across time. Since in practice, solving such a problem to optimality can be very dicult, two variants of a variable neighborhood search heuristic are proposed. Extensive computational testsshow that our approaches are able to provide high quality solutions efficiently.

KW - Scheduling

KW - Quadratic integer programming

KW - Variable neighborhood search

KW - Meta-heuristic

KW - Capacity management

U2 - 10.1016/j.cor.2013.07.027

DO - 10.1016/j.cor.2013.07.027

M3 - Journal article

VL - 52

SP - 282

EP - 290

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - Part B

ER -