HAL (France)
open access
A new heuristic algorithm for resource-constrained operating room scheduling problem: A case study
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Study of Graph Coloring Heuristics And its Application to a Time Tabling Problem In a Registration and Scheduling System#298652
- Robust scheduling with stochastic processing times in flexible job-shops#1166361
- A heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container#231624
- Integration of transportation constraints in the flexible job-shop scheduling problem#922894
- 2 U.S.C. § 2004 — Assignment of rooms in House Office Building#557904
Record · ID 145023
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive