arXiv (OAI Expanded)
open access
Novel Iterative Construction Methods for the Blocking Job Shop Scheduling Problem
The Blocking Job-Shop Scheduling Problem (BJSSP) arises in modern and complex manufacturing, production, logistics, and service where no intermediate storage is allowed between consecutive operations. This creates a significant challenge for meta-heuristics due to the low ratio of feasible to explor
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
- Sound Constructive Refinement from Production Envelopes to Executable Manufacturing Schedules#1116176
- Formulating Multistage Cutting Stock Problems as QUBO#1083546
- Assessment of a heuristic algorithm for scheduling Theater Security Cooperation naval missions#633678
- Algorithmic Simulation for Optimization in Combinatorial Mathematics Using Heuristic Techniques#250532
- Graph Homomorphisms and Universal Algebra#1109003
Record · ID 1110405
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