A5067216728- Scheduling and Optimization Algorithms
- Supply Chain and Inventory Management
- Advanced Manufacturing and Logistics Optimization
- Stochastic processes and financial applications
- Assembly Line Balancing Optimization
- Manufacturing Process and Optimization
- Risk and Portfolio Optimization
- Flexible and Reconfigurable Manufacturing Systems
- Mathematical Approximation and Integration
- Insurance, Mortality, Demography, Risk Management
- Optimization and Packing Problems
- Advanced Control Systems Optimization
- Economic theories and models
- Real-Time Systems Scheduling
- Optimization and Search Problems
- Management, Economics, and Public Policy
- Optimization and Mathematical Programming
- Sustainable Supply Chain Management
- Vehicle Routing Optimization Methods
- Consumer Market Behavior and Pricing
- Bayesian Modeling and Causal Inference
- Capital Investment and Risk Analysis
- Urban and Freight Transport Logistics
- Forecasting Techniques and Applications
- Complex Systems and Time Series Analysis
Polytechnic University of Turin
2007-2024
University of Turin
1999
We consider a stochastic version of the classical multi-item Capacitated Lot-Sizing Problem (CLSP). Demand uncertainty is explicitly modeled through scenario tree, resulting in multi-stage mixed-integer programming model with recourse. propose plant-location-based formulation and heuristic solution approach based on fix-and-relax strategy. report computational experiments to assess not only viability heuristic, but also advantage (if any) respect considerably simpler deterministic expected...
Abstract The job shop scheduling literature deals with problems characterized by a fixed linear process plan for each job: it is assumed that the planning problem has been solved before scheduling, and no flexibility in considered. Our aim here to propose solution approach joint selection problem, taking both operations cost makespan into account within multi-objective framework. Due complexity of two-phase hierarchical method proposed. In first phase, relaxed version solved, yielding an...
In this paper, we deal with the just-in-time job shop scheduling problem sequence-dependent setup times and release dates. Given a set of jobs characterized by due dates, goal is to execute them minimizing weighted sum their earliness, tardiness, flow time (i.e., difference between completion start each job). We develop new destroy repair operators exploiting structure problem, use within reduced variable neighborhood search matheuristic. Computational experiments carried out on several sets...
Some experiments on the integration of algorithmic techniques with knowledge-based ones are discussed. Two case studies presented: an FMS cell and a press shop. It was found that procedures developed for production scheduling resulted in limiting ability to cope complexity real manufacturing world. The problem, seen as constraint satisfaction can be approached rule-based techniques. Nevertheless, valuable their efficiency deal aggregated data. This is fundamental efficient implementation...
Retail inventory management of perishable items, like fresh food, is a relevant and complex problem. It in the light trends towards reduction food waste, because potential cross-sales interaction with other item categories. complex, multiple sources uncertainty supply, demand, quality, complicating factors seasonality within week, FIFO/LIFO consumer behavior, substitutions between possibly stockout. Similar items may be vertically differentiated due to intrinsic which also related age, or...
Preface. 1. Supply chain management. 1.1 What do we mean by logistics? 1.1.1 Plan of the chapter. 1.2 Structure production/distribution networks. 1.3 Competition factors, cost drivers, and strategy. 1.3.1 factors. 1.3.2 Cost drivers. 1.3.3 Strategy. 1.4 The role inventories. 1.4.1 A classical model: Economic Order Quantity. 1.4.2 Cycle vs. capacity-induced stock. 1.5 Dealing with uncertainty. 1.5.1 Setting safety stocks. 1.5.2 two-stage decision process: Production planning in an...
We consider here the application of trivial LP-based rounding heuristics to capacitated lot-sizing problem (CLSP). The motivation behind use is that their extension cope with complicating features (to be expected, for example, when dealing a master production scheduling within MRP system) generally easier than alternative approaches such as lagrangian relaxation. It well known strong model formulations, like Plant Location Formulation (PLF) or Shortest Path (SPF), are needed obtain good...