The following pages link to Erwin Pesch (Q193684):
Displaying 50 items.
- New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem (Q2174935) (← links)
- On approximability of minimum color-spanning ball in high dimensions (Q2181229) (← links)
- Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas (Q2315629) (← links)
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines (Q2317137) (← links)
- A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
- Competitive location and pricing on networks with random utilities (Q2357929) (← links)
- Flight gate assignment and recovery strategies with stochastic arrival and departure times (Q2362237) (← links)
- Competitive location on a network (Q2367390) (← links)
- Throughput optimization in robotic cells (Q2373612) (← links)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
- Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
- New bounds and algorithms for the transshipment yard scheduling problem (Q2434300) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845) (← links)
- A unifying approach to splitting-off (Q2448935) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) (← links)
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs (Q2510197) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning (Q2672113) (← links)
- (Q2712360) (← links)
- Scheduling computer and manufacturing processes. (Q2735585) (← links)
- The Logic of Logistics (Q2851343) (← links)
- Competitive location under proportional choice: 1-suboptimal points on networks (Q2966342) (← links)
- A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints (Q3114652) (← links)
- (Q3368665) (← links)
- Minimal extensions of graphs to absolute retracts (Q3794219) (← links)
- Retracts of graphs (Q3994353) (← links)
- Fast Clustering Algorithms (Q4302716) (← links)
- (Q4380372) (← links)
- (Q4494435) (← links)
- An overview of revenue management and dynamic pricing models in hotel business (Q4579886) (← links)
- Multiproduct batching and scheduling with buffered rework: The case of a car paint shop (Q4632851) (← links)
- A note on scheduling container storage operations of two non‐passing stacking cranes (Q4638575) (← links)
- (Q4789912) (← links)
- Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
- Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work (Q5059192) (← links)
- Constraint Propagation Based Scheduling of Job Shops (Q5284222) (← links)
- Revenue Maximization on Parallel Machines (Q5392010) (← links)
- Disruption management in flight gate scheduling (Q5422016) (← links)
- Handbook on Scheduling (Q5754725) (← links)
- KI 2005: Advances in Artificial Intelligence (Q5897750) (← links)
- Products of absolute retracts (Q5903896) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Solving the open shop scheduling problem (Q5939272) (← links)
- Scheduling dedicated jobs with variative processing times (Q5963650) (← links)
- Fixed interval scheduling with third‐party machines (Q6065340) (← links)
- Cost minimizing planning of container inspection and repair in multiple facilities (Q6103189) (← links)
