Pages that link to "Item:Q1011298"
From MaRDI portal
The following pages link to Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298):
Displaying 6 items.
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- A lower bound for the job insertion problem. (Q1811122) (← links)
- Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
- Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
- Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351) (← links)