Abstract
This paper addresses the cumulative scheduling problem with time-dependent total resource availability. In this problem, tasks are completed by accumulating enough amounts of resources. Our model is time-indexed due to the variation of the total resource availability. A Large neighborhood search (LNS) approach is developed. As an extension of our previous work, this paper contributes a new request removal method and an integration of a simulated annealing procedure to the LNS. Through the computational results, those modifications reduce the derived gap between the worst solutions and also the average derived gap.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Baptiste, P., Le Pape, C., Nuijten, W.: Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Ann. Oper. Res. 92, 305–333 (1999)
Ben-Ameur, W.: Computing the initial temperature of simulated annealing. Comput. Optim. Appl. 29(3), 369–385 (2004)
Godard, D., Laborie, P., Nuijten, W.: Randomized large neighborhood search for cumulative scheduling. In: ICAPS, vol. 5, pp. 81–89 (2005)
Munakata, T., Nakamura, Y.: Temperature control for simulated annealing. Phys. Rev. E 64(4), 046127 (2001)
Nattaf, M., Artigues, C., Lopez, P., Rivreau, D.: Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions. OR Spectr. 38(2), 459–492 (2016)
Nguyen, N.-Q., Yalaoui, F., Amodeo, L., Chehade, H., Toggenburger, P.: Solving a malleable jobs scheduling problem to minimize total weighted completion times by mixed integer linear programming models. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, T.-P. (eds.) ACIIDS 2016. LNCS (LNAI), vol. 9622, pp. 286–295. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49390-8_28
Nguyen, N.Q., Yalaoui, F., Amodeo, L., Chehade, H., Toggenburger, P.: Total completion time minimization for machine scheduling problem under time windows constraints with jobs linear processing rate function. Comput. Oper. Res. 90, 110–124 (2017)
Pacino, D., Van Hentenryck, P.: Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: International Joint Conference on Artificial Intelligence (2011)
Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, vol. 146, pp. 399–419. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_13
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49481-2_30
Acknowledgments
This research has been supported by ANRT (Association Nationale de la Recherche et de la Technologie, France).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Nguyen, NQ., Yalaoui, F., Amodeo, L., Chehade, H. (2018). A Large Neighborhood Search Heuristic for the Cumulative Scheduling Problem with Time-Dependent Resource Availability. In: Nguyen, N., Hoang, D., Hong, TP., Pham, H., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2018. Lecture Notes in Computer Science(), vol 10752. Springer, Cham. https://doi.org/10.1007/978-3-319-75420-8_66
Download citation
DOI: https://doi.org/10.1007/978-3-319-75420-8_66
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-75419-2
Online ISBN: 978-3-319-75420-8
eBook Packages: Computer ScienceComputer Science (R0)