arXiv (All)
open access
An Exact Combinatorial Branch-and-Bound Algorithm for the Job Sequencing and Tool Switching Problem
The Job Sequencing and Tool Switching Problem (SSP) is a well-known combinatorial optimization problem arising in the context of flexible manufacturing. Since the seminal work of Tang and Denardo (1988), the SSP has received significant attention in the literature, leading to the development of nume
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
- Trends in Algorithmic Solution Methods for Scheduling Problems#626966
- Learning-guided iterated local search for the minmax multiple traveling salesman problem#231627
- Scheduling Jobs Under a Variable Number of Processors#284187
- OptiAgent: End-to-End Optimization Modeling via Multi-Agent Iterative Refinement#343506
- A Configurable Heuristic for the MLCS Problem#1062490
Record · ID 925577
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