Modeling and solving the generalized test laboratory scheduling problem

DOI10.1007/978-3-031-95973-8_12MaRDI QIDQ6899325zbMATH OpenFDO

Authors Philipp Danzinger, Tobias Geibinger, Florian Mischek, Nysret Musliu

Publication date 14 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-95973-8_12

zbMATH Keywords

combinatorial optimizationconstraint programmingmodelingschedulingvery large neighborhood search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A local search framework for industrial test laboratory scheduling
• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• Local search approaches for the test laboratory scheduling problem with variable task grouping
• Scheduling with batching: A review
• The multi-mode resource-constrained multi-project scheduling problem, The MISTA 2013 challenge

This page was built for publication: Modeling and solving the generalized test laboratory scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899325)