Volume 69, Issue 4 July-August Volume 69, Issue 3 May-June Volume 69, Issue 2 March-April Volume 69, Issue 1 January-February View PDF.
Go to Section. Home Operations Research Vol. Nadjib Brahimi. Najib M. Previous Back to Top. Figures References Related Information. Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories.
An integrated production and direct shipment problem in a mining industry. Trade-off between the costs and the fairness for a collaborative production planning problem in make-to-order manufacturing. Capacitated disassembly scheduling under stochastic yield and demand. Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds.
Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator. A coordinated location-inventory problem in closed-loop supply chain. Initial solution At the initialisation we consider that the B. It should be noted that the first t T t X improvement rule is used.
Therefore, an improving neighbour is immediately selected to replace the current solution. For each item i, for each period t, all possible exchange moves are performed.
This step will be repeated until no improvement. Moreover,Zit measures the distance The choice of changing the structure of one item and not two between the admissible and non admissible regions and guides distinct items is based on an extensive experimentation.
After finding the local optimum of the second local search procedure, we return to the first one. The algorithm will stop The objective function 14 minimizes the total cost induced when the local optimum of the second procedure is the same by the production plan that is production costs, inventory costs, one for the first procedure.
By comparing with large which leads to much computational times. AL1, we see that the evaluation of moves in AL2 is faster by The experiments have shown that the results of this algo- the reduction of the size of the problem in the mathematical rithm are dependent to the increased size of the problem and programming.
The initialization of this algorithm follows the the local search does not converge toward a local optimum in a same way as in the AL1. Our idea is to propose a new improvement procedure by Moreover, the quality of solution is very sensitive to the choice using the Variable Neighbourhood Search algorithm VNS of the starting point.
This algorithm consists of two main steps: IV. The first step leads to perform some moves to the current Based on the results of AL1, it is shown that the phase of solution. The local optima found will be subject to the shaking the resolution of the mathematical programming is relatively by applying random moves.
These steps will be repeated until slow. Therefore, we have proposed a decomposition scheme of reaching a given stopping criterion. For each item; after performing from the current region of the search space. So, once the best the move, we evaluate this move according to the single item solution is found in a large region, it is necessary to go quite LSP by considering the remaining items as fixed.
So, the multi- far to get better solutions. In our application, the neighbourhood structures used here Therefore, in each iteration, a new mathematical formulation are also the same used in AL. We select at random two items and, for each 14 selected item, we select two random periods, then we exchange Subject to the value of the associated cases. These instance problems are based on the data sets of Trigeiro et al.
The time between two than the opposite case 41 upper bounds in favour of AL1 successive orders TBO is 1, 2 and 4. The variation coefficient and in favour of AL2. This is proving the contribution of of the demand is set to 0. The average value of the decomposition scheme introduced in AL2 for improving setup times over all products is 11 and 43 capacity unit.
In the results. However, in some cases AL1 is better than AL2 total there are instances to be tested. In order to evaluate our results according to the competing Table 2 presents the number of feasible solutions provided approaches of the literature we use the following measure of by each approach of resolution.
AL2 are able to find feasible solutions i. In terms of global 0. It is shown that the proposed Table 1 shows the comparative study between the three algorithm outperforms the two compared approaches. In av- proposed approaches in our paper. In first order we compare erage, for all classes, the percentage gap between AL2 and the gap between the upper bound values provided by AL1 and MIPX is equal 1.
It can be seen that AL2 is better than is equal to 0. The number of better AL1 both in terms of average percentage deviations 0. Regarding the LR algorithm, we see that AL2 is better of better values of upper bounds.
When AL2 is better than in terms of average percentage deviations whereas the former AL1, we find that the number of better upper bounds is large is better in terms of number of improved upper bounds. Volume 69, Issue 2 March-April Volume 69, Issue 1 January-February View PDF.
Go to Section. Home Operations Research Vol. Gary D. Kipp Martin. Previous Back to Top. Figures References Related Information. Cited By Arc flow formulations based on dynamic programming: Theoretical foundations and applications. An exact solution approach for the inventory routing problem with time windows. Tao Wu. Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover.
A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times. Application of the surrogate gradient method for a multi-item single-machine dynamic lot size scheduling problem. Integrated lot-sizing and cutting stock problem applied to the mattress industry. Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection.
Optimization models for a lot sizing and scheduling problem on parallel production lines that share scarce resources. Resource Planning. Robust formulations for economic lot-sizing problem with remanufacturing. Dantzig-Wolfe decomposition for the facility location and production planning problem. Selvaprabu Nadarajah , Andre A. A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines.
Impact analysis of setup carryover and crossover on lot sizing problems. Parallel machine, capacitated lot-sizing and scheduling for the pipe-insulation industry. Worst case analysis of Relax and Fix heuristics for lot-sizing problems.
Model formulations for the capacitated lot-sizing problem with service-level constraints. A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure. Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials. Inventory control with flexible demand: Cyclic case with multiple batch supply and demand processes. Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification.
Lot-sizing and scheduling in flat-panel display manufacturing process. A comparison of mixed integer programming formulations of the capacitated lot-sizing problem. A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations. A variable neighborhood search heuristic for supply chain coordination using dynamic price discounts.
Classification and literature review of integrated lot-sizing and cutting stock problems. David Bergman , Andre A. Biomass feedstock supply chain design — a taxonomic review and a decomposition-based methodology. A theoretical and computational analysis of lot-sizing in remanufacturing with separate setups. A comparative analysis of mixed-integer linear formulations for the multi-family capacitated lot-sizing problem. A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand.
Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case. Formulations and branch-and-cut algorithms for multi-product multi-vehicle production routing problems with startup cost.
Partial objective inequalities for the multi-item capacitated lot-sizing problem. Adjustable Robust Optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty. Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints. An analysis of formulations for the capacitated lot sizing problem with setup crossover. Tactical production and distribution planning with dependency issues on the production process.
An MIP-based heuristic approach to determine production lot size for capacitated single-stage production processes with stochastic demand on parallel machines. Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds. Leonardo Lozano , J.
Cole Smith. Simultaneous lotsizing and scheduling problems: a classification and review of models. On production planning and scheduling in food processing industry:Modelling non-triangular setups andproduct decay. Miller , Tao Wu. Modeling and solving a one-supplier multi-vehicle production-inventory-distribution problem with clustered retailers.
Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items. A computational comparison of formulations for the economic lot-sizing with remanufacturing.
Effective network formulations for lot sizing with backlogging in two-level serial supply chains. Hybrid methods for lot sizing on parallel machines.
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. Capacitated lot-sizing problem with outsourcing.
The production routing problem: A review of formulations and solution algorithms. Multi-product valid inequalities for the discrete lot-sizing and scheduling problem. The economic lot-sizing problem with an emission capacity constraint. Primary pharmaceutical manufacturing scheduling problem. Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover.
An evaluation of semidefinite programming based approaches for discrete lot-sizing problems. Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines. Economic lot-sizing with remanufacturing: complexity and efficient formulations.
A genetic algorithm for the simultaneous lot sizing and scheduling problem in capacitated flow shop with complex setups and backlogging. A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing. A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem. A hybrid VNS approach for the short-term production planning and scheduling: A case study in the pulp and paper industry.
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders. Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms.
A heuristic approach to synchronize production and transportation planning in a mineral water industry. Formulations for dynamic lot sizing with service levels.
Multi-stage simultaneous lot-sizing and scheduling for flow line production. Lot Sizing Heuristics Performance. A computational analysis of lower bounds for big bucket production planning problems.
MIP formulations and heuristics for two-level production-transportation problems.
0コメント