Pages that link to "Item:Q1038325"
From MaRDI portal
The following pages link to The one-dimensional cutting stock problem with due dates (Q1038325):
Displaying 19 items.
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- Two-dimensional cutting stock problem with sequence dependent setup times (Q1681356) (← links)
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing (Q1742194) (← links)
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152) (← links)
- Enumerating \(K\) best paths in length order in DAGs (Q1926859) (← links)
- Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods (Q1979194) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- Number of bins and maximum lateness minimization in two-dimensional bin packing (Q2029951) (← links)
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders (Q2307325) (← links)
- Two dimensional guillotine cutting stock and scheduling problem in printing industry (Q2676408) (← links)
- Heuristic algorithms based on column generation for an online product shipping problem (Q6065593) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
- A reinforcement learning approach to the stochastic cutting stock problem (Q6114929) (← links)