Pages that link to "Item:Q2307325"
From MaRDI portal
The following pages link to A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders (Q2307325):
Displaying 13 items.
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints (Q1979180) (← links)
- Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods (Q1979194) (← links)
- A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201) (← links)
- (Q4605690) (← links)
- (Q5398612) (← links)
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries (Q6048506) (← links)
- A reinforcement learning approach to the stochastic cutting stock problem (Q6114929) (← links)
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (Q6193912) (← links)
- Heuristics for flow shop rescheduling with mixed blocking constraints (Q6592920) (← links)
