Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art

A taxonomy of line balancing problems and their solutionapproaches

Cell formation in group technology: review, evaluation and directions for future research

Automated guided vehicle systems, state-of-the-art control algorithms and techniques

In this paper, the disassembly line balancing problem, which involves determining a line design in which used products are completely disassembled to obtain useable components in a cost-effective manner, is studied. Because of the growing demand for a cleaner environment, this problem has become an important issue in reverse manufacturing. In this study, two exact formulations are developed that utilize an AND/OR Graph (AOG) as the main input to ensure the feasibility of the precedence relations among the tasks. It is also shown that traditional task precedence diagrams can be derived from the AOG of a given product structure. This procedure leads to considerably better solutions of the traditional assembly line balancing problems; it may alter the approach taken by previous researchers in this area.

/pdf/two-exact-formulations-for-disassembly-line-balancing-45sfhvpnkg.pdf

Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph

As product and material recovery has gained importance, disassembly volumes have increased, justifying construction of disassembly lines similar to assembly lines. Recent research on disassembly lines has focused on complete disassembly. Unlike assembly, the current industry practice involves partial disassembly with profit-maximization or cost-minimization objectives. Another difference between assembly and disassembly is that disassembly involves additional precedence relations among tasks due to processing alternatives or physical restrictions. In this study, we define and solve the profit-oriented partial disassembly-line balancing problem. We first characterize different types of precedence relations in disassembly and propose a new representation scheme that encompasses all these types. We then develop the first mixed integer programming formulation for the partial disassembly-line balancing problem, which simultaneously determines (1) the parts whose demand is to be fulfilled to generate revenue, (...

/pdf/profit-oriented-disassembly-line-balancing-4boyii0ld4.pdf

Profit-oriented disassembly-line balancing

The permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related to production efficiency have been considered simultaneously. However, studies that consider energy consumption and environmental impacts are very rare in a multi-objective setting. In this work, we studied two contradictory objectives, namely, total flowtime and total energy consumption (TEC) in a green permutation flowshop environment, in which the machines can be operated at varying speed levels corresponding to different energy consumption values. A bi-objective mixed-integer programming model formulation was developed for the problem using a speed-scaling framework. To address the conflicting objectives of minimizing TEC and total flowtime, the augmented epsilon-constraint approach was employed to obtain Pareto-optimal solutions. We obtained near approximations for the Pareto-optimal frontiers of small-scale problems using a very small epsilon level. Furthermore, the mathematical model was run with a time limit to find sets of non-dominated solutions for large instances. As the problem was NP-hard, two effective multi-objective iterated greedy algorithms and a multi-objective variable block insertion heuristic were also proposed for the problem as well as a novel construction heuristic for initial solution generation. The performance of the developed heuristic algorithms was assessed on well-known benchmark problems in terms of various quality measures. Initially, the performance of the algorithms was evaluated on small-scale instances using Pareto-optimal solutions. Then, it was shown that the developed algorithms are tremendously effective for solving large instances in comparison to time-limited model.

An energy-efficient permutation flowshop scheduling problem

This paper analyses and evaluates six of the promising cell formation techniques by comparing and contrasting them in relation to the scores of efficiency indices of the exceptional elements and inner-cell densities, work-load balance, and under-utilizations in different scenarios. Accordingly, all six are more or less altered with proper extensions to realize a broader capability. Effectiveness of the suggested efficiency measures in the evaluation is also illustrated. Each technique seems to have a favourite operating area of its own considering a variety of factors.

/pdf/a-comparative-study-of-cell-formation-in-cellular-3hepvwz6hz.pdf

A comparative study of cell formation in cellular manufacturing systems

An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption

In this study, we present a new formulation for the air defense problem of warships in a naval task group and propose a solution method. We define the missile allocation problem (MAP) as the optimal allocation of a set of surface-to-air missiles (SAMs) of a naval task group to a set of attacking air targets. MAP is a new treatment of an emerging problem fostered by the rapid increase in the capabilities of anti-ship missiles (ASMs), the different levels of air defense capabilities of the warships against the ASM threat, and new technology that enables a fully coordinated and collective defense. In addition to allocating SAMs to ASMs, MAP also schedules launching of SAM rounds according to shoot-look-shoot engagement policy or its variations, considering multiple SAM systems and ASM types. MAP can be used for air defense planning under a given scenario. As thorough scenario analysis would require repetitive use of MAP, we propose efficient heuristic procedures for solving the problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011

Levent Kandiller

Papers

Profit-oriented disassembly-line balancing

An energy-efficient permutation flowshop scheduling problem

A comparative study of cell formation in cellular manufacturing systems

An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption

Anti‐ship missile defense for a naval task group