Pages that link to "Item:Q2337385"
From MaRDI portal
The following pages link to A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (Q2337385):
Displaying 7 items.
- An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts (Q2140139) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem (Q2669708) (← links)
- An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems (Q6078600) (← links)
