Pages that link to "Item:Q2901053"
From MaRDI portal
The following pages link to Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints (Q2901053):
Displaying 28 items.
- A tabu search algorithm for application placement in computer clustering (Q337070) (← links)
- Efficient symmetry breaking formulations for the job grouping problem (Q340336) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Mathematical programming-based approaches for multi-facility Glass container production planning (Q342464) (← links)
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
- A matheuristic for parallel machine scheduling with tool replacements (Q2030722) (← links)
- Operations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with \textit{strokes} (Q2052979) (← links)
- Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor (Q2116934) (← links)
- Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job (Q2185530) (← links)
- Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- Parallel machine scheduling with tool loading (Q2290906) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources (Q2997890) (← links)
- Order Allocation for Stock Cutting in the Paper Industry (Q3635095) (← links)
- A Matheuristic for the Multivehicle Inventory Routing Problem (Q4599309) (← links)
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
- Vessel Service Planning in Seaports (Q5106352) (← links)
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
- The consistent production routing problem (Q6064169) (← links)
- Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen (Q6068710) (← links)
- Exploiting symmetry for the job sequencing and tool switching problem (Q6565440) (← links)
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)
