Repositorio UNAB
metadata only
A constraint programming-based lower bounding procedure for the job shop scheduling problem
Indexación: Scopus
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
- 21 U.S.C. § 379d-3 — Streamlined hiring authority#577270
- DP18976: The Price of Unpredictability: Scheduling Demands, Gender and Selection in the Gig Economy#1175274
- Minimizing the makespan in job shop scheduling under conflict graph constraints#927027
- 22 U.S.C. § 4115 — Unfair labor practices#578658
- 5.4. Workforce planning systems#15276
Record · ID 1347856
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