The following pages link to Lars Mönch (Q256690):
Displayed 30 items.
- Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems (Q256691) (← links)
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
- Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective (Q502425) (← links)
- Integrated heuristics for scheduling multiple order jobs in a complex job shop (Q538004) (← links)
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint (Q850651) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
- Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines (Q1634065) (← links)
- Multiobjective scheduling of jobs with incompatible families on parallel batch machines (Q1742612) (← links)
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines (Q1743651) (← links)
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints (Q1754159) (← links)
- A clearing function based bid-price approach to integrated order acceptance and release decisions (Q1754318) (← links)
- Heuristic approaches for master planning in semiconductor manufacturing (Q1761996) (← links)
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549) (← links)
- On the numerical solution of the direct scattering problem for an open sound-hard arc (Q1919961) (← links)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- (Q4346759) (← links)
- On the inverse acoustic scattering problem by an open arc: the sound-hard case (Q4363875) (← links)
- On the numerical solution of a hypersingular integral equation for elastic scattering from a planar crack (Q4522187) (← links)
- Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date (Q4634328) (← links)
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness (Q4670270) (← links)
- (Q4789906) (← links)
- A Newton method for solving the inverse scattering problem for a sound-hard obstacle (Q4880929) (← links)
- (Q5301737) (← links)
- (Q5479458) (← links)