arXiv (All)
open access
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
In this work, we study the task of scheduling jobs on a single machine with sequence dependent family setup times under the goal of minimizing the makespan, that is, the completion time of the last job in the schedule. This notoriously NP-hard problem is highly relevant in practical productions and
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
- Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times#920171
- Single-Machine Scheduling with Interval Predictions and Costly Preemption#1109494
- Affinity Tailor: Dynamic Locality-Aware Scheduling at Scale#155402
- Test or Run? Scheduling Jobs of Unknown Length#818947
- Test or Run? Scheduling Jobs of Unknown Length#808955
Record · ID 924402
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