Variable neighborhood search for the workload balancing problem in service enterprises

Nguyen, Thi and Wright, Mike (2014) Variable neighborhood search for the workload balancing problem in service enterprises. Computers and Operations Research, 52 (Part B). pp. 282-290. ISSN 0305-0548

Full text not available from this repository.

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 tests show that our approaches are able to provide high quality solutions efficiently.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Additional Information:
The final, definitive version of this article has been published in the Journal, Computers and Operations Research, 52 (Part B), 2014, © ELSEVIER.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
69685
Deposited By:
Deposited On:
16 Jun 2014 15:30
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Oct 2020 00:46