Interval type-2 fuzzy modelling and stochastic search for real-world inventory management

Real-world systems present a variety of challenges to the modeller, not least of which is the problem of uncertainty inherent in their operation. In this research, an interval type-2 fuzzy model is applied to a real-world problem, the goal being to discover a suitable optimisation configuration to enable a search for an inventory plan using the model. To this end, a series of simulated annealing configurations and the interval type-2 fuzzy model were used to search for appropriate inventory plans for a large-scale real-world problem. A further set of tests were conducted in which the performance of the interval type-2 fuzzy model was compared with a corresponding type-1 fuzzy model. In these tests the results were inconclusive, though, as will be discussed there are many ways in which type-2 fuzzy logic can be exploited to demonstrate its advantages over a type-1 approach. To conclude, in this research we have shown that a combination of interval type-2 fuzzy logic and simulated annealing is a logical choice for inventory management modelling and inventory plan search, and propose that the benefits that a type-2 model offers, can make it preferable to a corresponding type-1 system

Solving Project Scheduling Problems by Minimum Cut Computations

In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable problems in operations research, and has therefore become a popular playground for the latest optimization techniques, including virtually all local search paradigms. We show that a somewhat more classical mathematical programming approach leads to both competitive feasible solutions and strong lower bounds, within reasonable computation times. The basic ingredients of our approach are the Lagrangian relaxation of a time-indexed integer programming formulation and relaxation-based list scheduling, enriched with a useful idea from recent approximation algorithms for machine scheduling problems. The efficiency of the algorithm results from the insight that the relaxed problem can be solved by computing a minimum cut in an appropriately defined directed graph. Our computational study covers different types of resource-constrained project scheduling problems, based on several notoriously hard test sets, including practical problem instances from chemical production planning.Project Scheduling, Resource Constraints, Linear Programming Relaxation, Lagrangian Relaxation, Minimum Cut