Pages that link to "Item:Q2456651"
From MaRDI portal
The following pages link to Lagrangian bounds for just-in-time job-shop scheduling (Q2456651):
Displaying 17 items.
- Temporal linear relaxation in IBM ILOG CP optimizer (Q309055) (← links)
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop (Q339585) (← links)
- Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots (Q420153) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Solving scheduling problems from high-level models (Q657573) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595) (← links)
- Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem (Q1718383) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems (Q1906070) (← links)
- A meta-heuristic to solve the just-in-time job-shop scheduling problem (Q2028835) (← links)
- Study of job shop scheduling problem (Q2705611) (← links)
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach (Q3569929) (← links)
- Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351) (← links)
- Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation (Q6110962) (← links)
- A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times (Q6568444) (← links)
