Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

  • S.I.: PATAT 2018
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider a sequencing problem with time windows, in which a subset of a given set of jobs shall be scheduled. A scheduled job has to execute without preemption and during this time, the job needs both a common resource for a part of the execution as well as a secondary resource for the whole execution time. The common resource is shared by all jobs while a secondary resource is shared only by a subset of the jobs. Each job has one or more time windows and due to these, it is not possible to schedule all jobs. Instead, each job is associated with a prize and the task is to select a subset of jobs which yields a feasible schedule with a maximum sum of prizes. First, we argue that the problem is NP-hard. Then, we present an exact A* algorithm and derive different upper bounds for the total prize; these bounds are based on constraint and Lagrangian relaxations of a linear programming relaxation of a multidimensional knapsack problem. For comparison, a compact mixed integer programming (MIP) model and a constraint programming model are also presented. An extensive experimental evaluation on three types of problem instances shows that the A* algorithm outperforms the other approaches and is able to solve small to medium size instances with up to about 40 jobs to proven optimality. In cases where A* does not prove that an optimal solution is found, the obtained upper bounds are stronger than those of the MIP model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. https://www.minizinc.org.

  2. http://www.gurobi.com.

  3. https://www.ac.tuwien.ac.at/research/problem-instances.

References

  • Allahverdi, A. (2016). A survey of scheduling problems with no-wait in process. European Journal of Operational Research, 255(3), 665–686.

    Article  Google Scholar 

  • Blikstad, M., Karlsson, E., Lööw, T., & Rönnberg, E. (2018). An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system. Optimization and Engineering, 19(4), 977–1004.

    Article  Google Scholar 

  • Gilmore, P. C., & Gomory, R. E. (1964). Sequencing a one-state variable machine: A solvable case of the traveling salesman problem. Operations Research, 12(5), 655–679.

    Article  Google Scholar 

  • Gunawan, A., Lau, H. C., & Vansteenwegen, P. (2016). Orienteering problem: A survey of recent variants, solution approaches and applications. European Journal of Operational Research, 255(2), 315–332.

    Article  Google Scholar 

  • Hansen, E. A., & Zhou, R. (2007). Anytime heuristic search. Journal of Artificial Intelligence Research, 28, 267–297.

    Article  Google Scholar 

  • Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100–107.

    Article  Google Scholar 

  • Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207, 1–14.

    Article  Google Scholar 

  • Horn, M., Maschler, J., Raidl, G., & Rönnberg, E. (2018a). A*-based construction of decision diagrams for a prize-collecting scheduling problem. Tech. Rep. AC-TR-18-011, Algorithms and Complexity Group, TU Wien.

  • Horn, M., Raidl, G., & Blum C. (2017). Job sequencing with one common and multiple secondary resources: A problem motivated from particle therapy for cancer treatment. In The third international conference on machine learning, optimization and big data, MOD 2017 (Vol. 10710, pp 506–518). Springer, LNCS.

  • Horn, M., Raidl, G. R., & Rönnberg, E. (2018b). An $\text{A}^*$ algorithm for solving a prize-collecting sequencing problem with one common and multiple secondary resources and time windows. In PATAT 2018: proceedings of the 12th international conference of the practice and theory of automated timetabling, Vienna, Austria, (pp. 235–256).

  • Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer.

    Book  Google Scholar 

  • Likhachev, M., Gordon, G. J., & Thrun, S. (2004). ARA*: Anytime A* with provable bounds on sub-optimality. In Advances in neural information processing systems 16: proceedings of the 2003 conference (NIPS-03) (pp. 767–774). MIT Press.

  • Maschler, J., Hackl, T., Riedler, M., & Raidl, G. R. (2017). An enhanced iterated greedy metaheuristic for the particle therapy patient scheduling problem. In Proceedings of the 12th metaheuristics international conference (pp. 465–474).

  • Maschler, J., & Raidl, G. R. (2018). Multivalued decision diagrams for a prize-collecting sequencing problem. In: PATAT 2018: Proceedings of the 12th international conference of the practice and theory of automated timetabling, Vienna, Austria (pp. 375–397).

  • Maschler, J., Riedler, M., & Raidl, G. R. (2018). Particle therapy patient scheduling: Time estimation for scheduling sets of treatments. In R. Moreno-Díaz, F. Pichler, & A. Quesada-Arencibia (Eds.) Computer aided systems theory—EUROCAST 2017, Part I (Vol. 10671, pp. 364–372). Springer, LNCS.

  • Maschler, J., Riedler, M., Stock, M., & Raidl, G. R. (2016). Particle therapy patient scheduling: First heuristic approaches. In PATAT 2016: Proceedings of the 11th international conference of the practice and theory of automated timetabling, Udine, Italy (pp. 223–244).

  • Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. Interscience series in discrete mathematics and optimization. Hoboken: Wiley.

    Google Scholar 

  • Rios, L. H. O., & Chaimowicz, L. (2010). A survey and classification of A* based best-first heuristic search algorithms (pp. 253–262). Berlin: Springer.

  • Röck, H. (1984). The three-machine no-wait flow shop is NP-complete. Journal of the ACM, 31(2), 336–345.

    Article  Google Scholar 

  • Vadlamudi, S. G., Aine, S., & Chakrabarti, P. P. (2016). Anytime pack search. Natural Computing, 15(3), 395–414.

    Article  Google Scholar 

  • Van der Veen, J. A. A., Wöginger, G. J., & Zhang, S. (1998). Sequencing jobs that require common resources on a single machine: A solvable case of the TSP. Mathematical Programming, 82(1–2), 235–254.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthias Horn.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This project is partially funded by the Doctoral Program “Vienna Graduate School on Computational Optimization”, Austrian Science Foundation (FWF) Project No. W1260-N35. The work of Elina Rönnberg is supported by the Center for Industrial Information Technology (CENIIT), Project-ID 16.05. We further thank Lukas Felician Krasel for his help in the implementation and testing.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Horn, M., Raidl, G.R. & Rönnberg, E. A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Ann Oper Res 302, 477–505 (2021). https://doi.org/10.1007/s10479-020-03550-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-020-03550-7

Keywords