Pages that link to "Item:Q2331444"
From MaRDI portal
The following pages link to Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444):
Displaying 12 items.
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
- An efficient heuristic approach to the scheduling of jobs in a flowshop (Q1194720) (← links)
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem (Q1723298) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- A meta-heuristic to solve the just-in-time job-shop scheduling problem (Q2028835) (← links)
- Editorial. Special issue on algorithms for scheduling problems (Q2331616) (← links)
- A note on just-in-time scheduling on flow shop machines (Q2801107) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- (Q3023691) (← links)
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (Q6054756) (← links)