arXiv (OAI Expanded)
open access
Flow Shop Scheduling with Stochastic Reentry
We study flow shop scheduling with stochastic reentry, where jobs must complete multiple passes through the entire shop, and the number of passes that a job requires for completion is drawn from a discrete probability distribution. The goal is to find policies that minimize performance measures in e
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
- Flow Shop Scheduling with Stochastic Reentry#785149
- Continuous auction models#1064189
- Stochastic cyclic scheduling problem in synchronous assembly and production lines#954859
- Dynamic priority rules for cyclic queues with limited service regime#239228
- Noncooperative Coordination via a Trading-based Auction#625465
Record · ID 783559
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