Search results

The aim of this research is to discuss the benefits of U-shaped layout for production cell operating in variable takt time. Different experiments were conducted using benchmarks to highlight the performance gap between a linear cell and a U-Cell.

The implementation of the production cell, either in a U-shaped or in a straight line layout, is optimized through linear programming based on the number of operators. The two corresponding programs, in Mosel language, use the same approach to not introduce bias in the comparison of results. The study used the authors’ own datasets and other well-known academic benchmarks.

A comparison was conducted between the obtained takt times, with equivalent operating conditions, in both U-Cell and linear cell. A significant increase of the production rate was observed. This increase has often exceeded 10 per cent, reaching 32 per cent. All the experiments show that, with the same number of operators, a cell in a U-shaped layout is always at least as efficient, in terms of attainable production rates, than an equivalent linear cell. Ninety-six per cent of the studied cases give an improvement of production rate. Moreover, the dispersion of the U-Cell results is weaker, which suggests that the U-shaped layout gives better performances in more robust manner.

Results were obtained through a study of various academic benchmarks. The results must be validated on industrial situations.

This paper will be very useful for researchers and practitioners to understand lean implementations and their derived benefits. This paper will allow them to evaluate and analyze the expected benefits of the implementation of the production cell in the U-shaped layout (operating in variable takt time).

U-Cells constitute an appropriate solution for a layout of any kind of production cells with a variable structure (variability of the number of operators, of the organization of the cell, of the takt time […]). When facing a significant variation in the demand, the response consists of adjusting the number of operators assigned to the cell. This study jointly addresses the problem of the U-shaped layout and the operation in variable takt time.

When making sourcing decisions, both cost optimization and customer demand fulfillment are equally important for firm competitiveness. The purpose of this paper is to develop a stochastic search technique, hybrid genetic algorithm (HGA), for cost-optimized decision making in wholesaler inventory management in a supply chain network of wholesalers, retailers and suppliers.

This study develops a HGA by using a mixture of greedy-based and randomly generated solutions in the initial population and a local search method (hill climbing) applied to individuals selected for performing crossover before crossover is implemented and to the best individual in the population at the end of HGA as well as gene slice and integration.

The application of the proposed HGA is illustrated by considering multiple scenarios and comparing with the other commonly adopted methods of standard genetic algorithm, simulated annealing and tabu search. The simulation results demonstrate the capability of the proposed approach in producing more effective solutions.

The pragmatic importance of this method is for the inventory management of wholesaler operations and this can be scalable to address real contexts with multiple wholesalers and multiple suppliers with variable lead times.

The proposed stochastic-based search techniques have the capability in producing good-quality optimal or suboptimal solutions for large-scale problems within a reasonable time using ordinary computing resources available in firms.

This chapter presents the survey of selected linear and mixed integer programming multi-objective portfolio optimization. The definitions of selected percentile risk measures are presented. Some contrasts and similarities of the different types of portfolio formulations are drawn out. The survey of multi-criteria methods devoted to portfolio optimization such as weighting approach, lexicographic approach, and reference point method is also presented. This survey presents the nature of the multi-objective portfolio problems focuses on a compromise between the construction of objectives, constraints, and decision variables in a portfolio and the problem complexity of the implemented mathematical models. There is always a trade-off between computational time and the size of an input data, as well as the type of mathematical programming formulation with linear and/or mixed integer variables.

The use of three non‐linear mathematical programming techniques for the optimization of structural design problems is discussed. The methods — sequential linear programming, the feasible direction method and the sequential unconstrained minimization technique — are applied to a portal frame problem to enable a study of their convergence efficiency to be studied. These methods are used for both the sizing of the structural members and determining the optimum roof pitch. The sequential linear programming method is shown to be particularly efficient for application to structural design problems. Some comments on the development of computer software for structural optimization are also given.

The paper introduces a resource-based linear programming model for resource optimization in small innovative enterprises (SIE).

The model is grounded on resource-based view on the firm and dynamic capabilities approach. Linear programming technique is used to provide the actual framework to the resource-based model.

The paper introduces a new resource-based linear programming model for resource optimization in small innovative enterprises. The conceptual model is grounded on resource-based view (RBV) and dynamic capabilities strategy. The RVB of firm and firm strategy is based on the concept of economic rent. Linear programming technique is used to provide the actual framework to the resource-based model. In developing the versatility concept, study suggests a distinct sight regarding resource fungibility. Study classifies resources into multipliable, rentable and expendable resources to increases adequacy of the model. The developed model includes both tangible and intangible assets such as human capital. The survival rate of SIE in the early stages of life cycle is very low due to the competition among SIEs. In this regard, the greatest advancement of the developed resource-based linear programming model is its simplicity and versatility which is much desirable for the SIE especially in their initial stages of the life cycle. Kelliher and Reinl (2009) argued that micro firms have unique advantage over bigger firms in following term: rate of learning or redeployment of strategy in micro firms is faster than the rate of change in their environment. One very significant feature of the developed resource-based linear programming model is that mathematically the proposed model could easily be transformed into mixed integer or stochastic linear programming models to meet the time variant requirement of small firms especially when it expands its operation.

The survival rate of SIE in the early stages of life cycle is very low due to the competition among SIEs. In this regard, the greatest advancement of the developed resource-based linear programming model is its simplicity and versatility which is much desirable for the SIE especially in their initial stages of the life cycle. Kelliher and Reinl (2009) argued that micro firms have unique advantage over bigger firms in following term: rate of learning or redeployment of strategy in micro firms is faster than the rate of change in their environment. One very significant feature of the developed resource-based linear programming model is that mathematically the proposed model could easily be transformed into mixed integer or stochastic linear programming models to meet the time variant requirement of small firms especially when it expands its operation.

One very significant contribution of the present study is that the study develops a new resource-based model for SIE especially for the SIE in the initial stages of the life cycle, to gain competitive advantages. Furthermore, the present study contributes to the existing literature in strategy at least in three senses as mentioned below: 1. further addition of SIE research based on the RBV and dynamic capabilities in the strategy literature 2. in developing the versatility concept, the study suggests a distinct sight regarding resource fungibility and it classifies resources into three categories as follows: multipliable, rentable and expendable resources to increases adequacy of the model. 3. Finally, the study introduces a new resource-based linear programming model for SIE resources allocation. To the best of author’s knowledge, no such similar model is introduced by any previous studies for small firm. The greatest advancement of the developed resource-based linear programming model is its simplicity and versatility.

The purpose of this paper is to survey and express the advantages and disadvantages of the existing approaches for solving grey linear programming in decision-making problems.

After presenting the concepts of grey systems and grey numbers, this paper surveys existing approaches for solving grey linear programming problems and applications. Also, methods and approaches for solving grey linear programming are classified, and its advantages and disadvantages are expressed.

The progress of grey programming has been expressed from past to present. The main methods for solving the grey linear programming problem can be categorized as Best-Worst model, Confidence degree, Whitening parameters, Prediction model, Positioned solution, Genetic algorithm, Covered solution, Multi-objective, Simplex and dual theory methods. This survey investigates the developments of various solving grey programming methods and its applications.

Different methods for solving grey linear programming problems are presented, where each of them has disadvantages and advantages in providing results of grey linear programming problems. This study attempted to review papers published during 35 years (1985–2020) about grey linear programming solving and applications. The review also helps clarify the important advantages, disadvantages and distinctions between different approaches and algorithms such as weakness of solving linear programming with grey numbers in constraints, inappropriate results with the lower bound is greater than upper bound, out of feasible region solutions and so on.

This paper gives a bibliographical review of the finite element and boundary element parallel processing techniques from the theoretical and application points of view. Topics include: theory – domain decomposition/partitioning, load balancing, parallel solvers/algorithms, parallel mesh generation, adaptive methods, and visualization/graphics; applications – structural mechanics problems, dynamic problems, material/geometrical non‐linear problems, contact problems, fracture mechanics, field problems, coupled problems, sensitivity and optimization, and other problems; hardware and software environments – hardware environments, programming techniques, and software development and presentations. The bibliography at the end of this paper contains 850 references to papers, conference proceedings and theses/dissertations dealing with presented subjects that were published between 1996 and 2002.

Introduction Operations research, i.e. the application of scientific methodology to operational problems in the search for improved understanding and control, can be said to have started with the application of mathematical tools to military problems of supply bombing and strategy, during the Second World War. Post‐war these tools were applied to business problems, particularly production scheduling, inventory control and physical distribution because of the acute shortages of goods and the numerical aspects of these problems.

Distribution network design (DND) has become an important strategic decision for supply chain managers with increasing competitive nature of the industry nowadays. The purpose of this paper is to propose a web-based decision support system (DSS) for fuzzy distribution network optimization. For this purpose, a web-based DSS using fuzzy linear programming model is proposed to solve DND problem under uncertainty and a framework is created to optimize a distribution network.

In this study, the fuzziness in distribution network optimization is addressed. Fuzzy linear programming is used in a DSS to consider the uncertain and imprecise data. A web-based DSS architecture is presented. Furthermore, as an application, distribution network optimization is conducted for a company in the ceramics industry.

By using this DSS, the optimal transshipment amounts in the distribution network and the required facility and distribution centers can be determined for different fuzziness levels. In fact, for different uncertainty levels of input parameters, the planner can understand the range of optimum network planning costs. Based on the results of this study, planners will be able to decide how to develop the distribution network under uncertain demand.

Reviewing previous research in the related literature revealed that there are no studies presenting a web-based DSS using fuzzy linear programming model to solve this type of problems under uncertainty.