Search results

Due to the market trend of low-volume and high-variety, the manufacturing industry is paying close attention to improve the ability to hedge against variability. Therefore, in this paper the assembly line with limited resources is balanced in a robust way that has good performance under all possible scenarios. The proposed model allows decision makers to minimize a posteriori regret of the selected choice and hedge against the high cost caused by variability.

A generalized resource-constrained assembly line balancing problem (GRCALBP) with an interval data of task times is modeled and the objective is to find an assignment of tasks and resources to the workstations such that the maximum regret among all the possible scenarios is minimized. To properly solve the problem, the regret evaluation, an exact solution method and an enhanced meta-heuristic algorithm, Whale Optimization Algorithm, are proposed and analyzed. A problem-specific coding scheme and search mechanisms are incorporated.

Theory analysis and computational experiments are conducted to evaluated the proposed methods and their superiority. Satisfactory results show that the constraint generation technique-based exact method can efficiently solve instances of moderate size to optimality, and the performance of WOA is enhanced due to the modified searching strategy.

For the first time a minmax regret model is considered in a resource-constrained assembly line balancing problem. The traditional Whale Optimization Algorithm is modified to overcome the inferior capability and applied in discrete and constrained assembly line balancing problems.

The purpose of this paper is to consider selected optimization problems with parameter uncertainty. A case is studied when uncertain parameters in functions undergoing the optimization belong to intervals of known bounds as well as the absolute regret based approach for coping with such an uncertainty is applied. The paper presents three different cases depending on properties of optimization problems and proposes which method can be used to solve corresponding problems.

The worst‐case absolute regret method is employed to manage interval uncertainty in functions to be optimized. To solve resulting uncertain optimization problems, optimal, approximate as well as heuristic solution algorithms have been elaborated for particular problems presented and described in the paper. The latter one is based on Scatter Search metaheuristics.

Solution algorithms for worst‐case absolute regret versions of the following optimization problems have been determined: resource allocation in a complex of independent operations and two task scheduling problems Q‖∑C_i and P‖C_max.

It is very difficult to generalize the results obtained and to use them for solving other optimization problems which correspond to real‐world applications. Such new cases require separate investigations.

The considered allocations as well as task scheduling problems have plenty of applications, for example in computer and manufacturing systems. Their versions with not precisely known parameters can be met commonly.

The investigations presented correspond to previous works on so‐called minimax regret problems and extend them for new optimization problems.

Assessing the performance of medical laboratories plays an important role in the quality of health services. However, because of imprecise data, reliable results from laboratory performance cannot be obtained easily. The purpose of this paper is to illustrate the use of interval network data envelopment analysis (INDEA) based on sustainable development indicators under uncertainty.

In this study, each medical diagnostic laboratory is considered as a decision-making unit (DMU) and an INDEA model is used for calculating the efficiency of each medical diagnostic laboratory under imprecise inputs and outputs. The proposed model helps provide managers with effective performance scores for deficiencies and business improvements. The proposed model with realistic efficiency scores can help administrators manage their deficiencies and ultimately improve their business.

The results indicate that uncertainty can lead to changes in performance scores, rankings and performance classifications. Therefore, the use of DEA models under certainty can be potentially misleading.

The contribution of this study provides useful insights into the use of INDEA as a modeling tool to aid managerial decision-making in assessing efficiency of medical diagnostic laboratories based on sustainable development indicators under uncertainty.

This paper considers the assembly line worker assignment and balancing problem of type-2 (ALWABP-2) with fuzzy task times. This problem is an extension of the (simple) SALBP-2 in which task times are worker-dependent and concurrently uncertain. Two criteria are simultaneously considered for minimization, namely, fuzzy cycle time and fuzzy smoothness index.

First, we show how fuzzy concepts can be used for managing uncertain task times. Then, we present a multiobjective genetic algorithm (MOGA) to solve the problem. MOGA is devoted to the search for Pareto-optimal solutions. For facilitating effective trade-off decision-making, two different MO approaches are implemented and tested within MOGA: a weighted-sum based approach and a Pareto-based approach.

Experiments over a set of fuzzified test problems show the effect of these approaches on the performance of MOGA while verifying its efficiency in terms of both solution and time quality.

To the author’s knowledge, no previous published work in the literature has studied the biobjective assembly line worker assignment and balancing problem of type-2 (ALWABP-2) with fuzzy task times.

Rabbit chase (RC) is used as one of the most effective techniques in manufacturing systems, as such systems have high level of adaptability and increased productivity in addition to providing uniform workload balancing and skill improving environment. In assembly systems, RC inspires the development of walking worker assembly line (WWAL). On the other hand, U-type assembly lines (UALs) may provide higher worker utilization, lower space requirement and more convenient internal logistics when compared to straight assembly lines. In this context, this study aims to improve assembly line performance by generating RC cycles on WWAL with respect to task assignment characteristics of UAL within reasonable walking distance and space requirement. Therefore, a novel line configuration, namely, segmented rabbit chase-oriented U-type assembly line (SRCUAL), emerges.

The mathematical programming approach treats SRCUAL balancing problem in a hierarchical manner to decrease computational burden. Firstly, segments are generated via the first linear programming model in the solution approach for balancing SRCUALs to minimize total number of workers. Then, stations are determined within each segment for forward and backward sections separately using two different pre-emptive goal programming models. Moreover, three heuristics are developed to provide solution quality with computational efficiency.

The proposed mathematical programming approach is applied to the light-emitting diode (LED) luminaire assembly section of a manufacturing company. The adaptation of SRCUAL decreased the number of workers by 15.4% and the space requirement by 17.7% for LED luminaire assembly system when compared to UAL. Moreover, satisfactory results for the proposed heuristics were obtained in terms of deviation from lower bound, especially for SRCUAL heuristics I and II. Moreover, the results indicate that the integration of RC not only decreased the number of workers in 40.28% (29 instances) of test problems in U-lines, but also yielded less number of buffer points (48.48%) with lower workload deviation (75%) among workers in terms of coefficient of variation.

This study provides convenience for capacity management (assessing capacity and adjusting capacity by changing the number of workers) for industrial SRCUAL applications. Meanwhile, SRCUAL applications give the opportunity to increase the capacity for a product or transfer the saved capacity to the assembly of other products. As it is possible to provide one-piece flow with equal workloads via walking workers, SRCUAL has the potential for quick realization of defects and better lead time performance.

To the best of the authors’ knowledge, forward–backward task assignments in U-type lines have not been adapted to WWALs. Moreover, as workers travel overall the line in WWALs, walking time increases drastically. Addressing this research gap and limitation, the main innovative aspect of this study can be considered as the proposal of a new line design (i.e. SRCUAL) which is sourced from the hybridization of UALs and WWAL as well as the segmentation of the line with RC cycles. The superiority of SRCUAL over WWAL and UAL was also discussed. Moreover, operating systematic for SRCUAL was devised. As for methodical aspect, this study is the first attempt to solve the balancing problem for SRCUAL design.

This paper aims to provide a promising memetic algorithm (MA) for an unrelated parallel machine scheduling problem with grey processing times by using a simple dispatching rule in the local search phase of the proposed MA.

This paper proposes a MA for an unrelated parallel machine scheduling problem where the objective is to minimize the sum of weighted completion times of jobs with uncertain processing times. In the optimal schedule of the problem’s single machine version with deterministic processing time, the machine has a sequence where jobs are ordered in their increasing order of weighted processing times. The author adapts this property to some of their local search mechanisms that are required to assure the local optimality of the solution generated by the proposed MA. To show the efficiency of the proposed algorithm, this study uses other local search methods in the MA within this experiment. The uncertainty of processing times is expressed with grey numbers.

Experimental study shows that the MA with the swap-based local search and the weighted shortest processing time (WSPT) dispatching rule outperforms other MA alternatives with swap-based and insertion-based local searches without that dispatching rule.

A promising and effective MA with the WSPT dispatching rule is designed and applied to unrelated parallel machine scheduling problems where the objective is to minimize the sum of the weighted completion times of jobs with grey processing time.

This paper addresses the trade-off between asset investment and food safety in the design of a food catering production plant. It analyses the relationship between the quality decay of cook-warm products, the logistics of the processes and the economic investment in production machines.

A weekly cook-warm production plan has been monitored on-field using temperature sensors to estimate the quality decay profile of each product. A multi-objective optimisation model is proposed to (1) minimise the number of resources necessary to perform cooking and packing operations or (2) to maximise the food quality of the products. A metaheuristic simulated annealing algorithm is introduced to solve the model and to identify the Pareto frontier of the problem.

The packaging buffers are identified as the bottleneck of the processes. The outcome of the algorithms highlights that a small investment to design bigger buffers results in a significant increase in the quality with a smaller food loss.

This study models the production tasks of a food catering facility to evaluate their criticality from a food safety perspective. It investigates the tradeoff between the investment cost of resources processing critical tasks and food safety of finished products.

The methodology applies to the design of cook-warm production. Catering companies use cook-warm production to serve school, hospitals and companies. For this reason, the application of this methodology leads to the improvement of the quality of daily meals for a large number of people.

The paper introduces a new multi-objective function (asset investment vs food quality) proposing an original metaheuristic to address this tradeoff in the food catering industry. Also, the methodology is applied and validated in the design of a new food production facility.

The purpose of this paper is to present an academic programme of pansystems research with a lot of new concepts, principles, methods. Universal consideration of philosophy‐mathematics‐technology is set forth with mega‐combination. The emphasis on the transfield internet‐like investigations is developed. Many theory‐methods of pansystems get further concise optimization.

The concrete contents of the paper include: historical megawave, philosophical stratagems, meta‐mathematics, meta‐methodology, technological realistic principles, unification and differentiation of encyclopedic branches, systems science, information theory, cybernetics, biosystems, generalized vitality, computer and IT, thinking science, logic, OR, AI, PR, DM, modernization of yinyang analysis combining dialectics, sociology, economics, meta‐relativity, generalized quantification and scale theory, general process of birth‐growth‐ageing‐disease‐death, the inheritance and development of 300 scholars' researches, etc.

All of the topics concerned with are reduced to the actualizations of PVOR – pansystems variational OR: V−d(xy)=^*0^*/PRR′P′/0^**, which is an integrated synthesis of 20‐PanStemCells of PanConcepts and PanMethod, and embodies a specific pansystems summarization for the core of the true and the good. Furthermore, the formula “Pansystems Researches=^*(PVOR/0^**/Pan54787721/Everything)+^*0^*=^*Pan–netlike connections of thoughts and methods” is expanded with concrete applications.

Provides information on pansystems research.