Search results

The purpose of this paper is to attempt to realize a distribution network optimization in supply chain using grey systems theory for uncertain information.

There is much uncertain information in the distribution network optimization of supply chain, including fuzzy information, stochastic information and grey information, etc. Fuzzy information and stochastic information have been studied in supply chain, however grey information of the supply chain has not been covered. In the distribution problem of supply chain, grey demands are taken into account. Then, a mathematics model with grey demands has been constructed, and it can be transformed into a grey chance‐constrained programming model, grey simulation and a proposed hybrid particle swarm optimization are combined to resolve it. An example is also computed in the last part of the paper.

The results are convincing: not only that grey system theory can be used to deal with grey uncertain information about distribution of supply chain, but grey chance‐constrained programming, grey simulation and particle swarm optimization can be combined to resolve the grey model.

The method exposed in the paper can be used to deal with distribution problems with grey information in the supply chain, and network optimization results with a grey uncertain factor could be helpful for supply chain efficiency and practicability.

The paper succeeds in realising both a constructed model of the distribution of supply chain with grey demands and a solution algorithm of the grey mathematics model by using one of the newest developed theories: grey systems theory.

The purpose of this paper is to realize a location‐routing network optimization in reverse logistics (RL) using grey systems theory for uncertain information.

There is much uncertain information in network optimization and location‐routing problem (LRP) of RL, including fuzzy information, stochastic information and grey information, etc. Fuzzy information and stochastic information have been studied in logistics, however grey information of RL has not been covered. In the LRP of RL, grey recycling demands are taken into account. Then, a mathematics model with grey recycling demands has been constructed, and it can be transformed into grey chance‐constrained programming (GCCP) model, grey simulation and a proposed hybrid particle swarm optimization (PSO) are combined to resolve it. An example is also computed in the last part of the paper.

The results are convincing: not only that grey system theory can be used to deal with grey uncertain information about location‐routing problem of RL, but GCCP, grey simulation and PSO can be combined to resolve the grey model.

The method exposed in the paper can be used to deal with location‐routing problem with grey recycling information in RL, and network optimization result with grey uncertain factor could be helpful for logistics efficiency and practicability.

The paper succeeds in realising both a constructed model about location‐routing of RL with grey recycling demands and a solution algorithm about grey mathematics model by using one of the newest developed theories: grey systems theory.

The purpose of this paper is to propose a new casualty scheduling optimisation problem and to effectively treat casualties in the early stage of post-earthquake relief.

Different from previous studies, some new characteristics of this stage are considered, such as the grey uncertainty information of casualty numbers, the injury deterioration and the facility disruption scenarios. Considering these new characteristics, we propose a novel casualty scheduling optimisation model based on grey chance-constrained programming (GCCP). The model is formulated as a 0–1 mixed-integer nonlinear programming (MINP) model. An improved particle swarm optimisation (PSO) algorithm embedded in a grey simulation technique is proposed to solve the model.

A case study of the Lushan earthquake in China is given to verify the effectiveness of the model and algorithm. The results show that (1) considering the facility disruption in advance can improve the system reliability, (2) the grey simulation technology is more suitable for dealing with the grey uncertain information with a wider fluctuation than the equal-weight whitening method and (3) the authors' proposed PSO is superior to the genetic algorithm and immune algorithm.

The casualty scheduling problem in the emergency recovery stage of post-earthquake relief could be integrated with our study to further enhance the research value of this paper.

Considering the facility disruption in advance is beneficial to treat more patients. Considering the facility disruption in the design stage of the emergency logistics network can improve the reliability of the system.

(1) The authors propose a new casualty scheduling optimisation problem based on GCCP in the early stage of post-earthquake relief. The proposed problem considers many new characteristics in this stage. To the best of the authors' knowledge, the authors are the first to use the GCCP to study the casualty scheduling problem under the grey information. (2) A MINP model is established to formulate the proposed problem. (3) An improved integer-encoded particle swarm optimisation (PSO) algorithm embedded grey simulation technique is designed in this paper.

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 presents a mixed-integer programming model for a single machine earliness/tardiness scheduling problem where the objective is to minimize total earliness/tardiness duration when the uncertainty of parameters such as processing times and due date is coded with grey numbers.

Grey theory and grey numbers are used for illustrating the uncertainty of parameters in processing times and common due date, where the objective is to minimize the total earliness/tardiness duration. The paper proposes a 0–1 mathematical model for the problem and an effective heuristic method for the problem by using expected processing times for ordering jobs.

The uncertainty of the processing times and common due date are encoded with grey numbers and a position-dependent mixed-integer mathematical programming model is proposed for the problem in order to minimize total grey earliness/tardiness duration of jobs having grey processing times and a common due date. By using expected processing times for ranking grey processing times, V-shaped property of the problem and an efficient heuristic method for the problem are proposed. Solutions obtained from the heuristic method show that the heuristic is effective. The experimental study also reveals that while differences between upper and lower bounds of grey processing times decrease, the proposed heuristic's performance decreases.

The grey theory and grey numbers have been rarely used as machine scheduling problems. Therefore, this study provides an important contribution to the literature.

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.

purpose of this paper is providing a solution for flexible flow shop scheduling problem with uncertain processing time in aeronautical composite lay-up workshop.

A flexible flow scheduling model and algorithm with interval grey processing time is established. First, according to actual needs of composite laminate shop scheduling process, interval grey number is used to represent uncertain processing time, and interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart, and other methods are further applied. Then a flexible flow shop scheduling model with interval grey processing time (G-FFSP) is established, and an artificial bee colony algorithm based on an adaptive neighbourhood search strategy is designed to solve the model. Finally, six examples are generated for simulation scheduling, and the efficiency and performance of the model and algorithm are evaluated by comparing the results.

Results show that flexible flow shop scheduling model and algorithm with interval grey processing time can provide an optimal solution for composite lay-up shop scheduling problems and other similar flow shop scheduling problems.

Uncertain processing time is common in flexible workshop manufacturing, and manual scheduling greatly restricts the production efficiency of workshop. In this paper, combined with grey system theory, an intelligent algorithm is used to solve flexible flow shop scheduling problem to promote intelligent and efficient production of enterprises.

This paper applies and perfects interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart and other methods. A flexible flow shop scheduling model with interval grey processing time is established, and an artificial bee colony algorithm with an adaptive domain search strategy is designed. It provides a comprehensive solution for flexible flow shop scheduling with uncertain processing time.

The purpose of this study is to develop a holistic optimization model for an integrated sustainable fleet planning and closed-loop supply chain (CLSC) network design problem under uncertainty.

A novel mixed-integer programming model that is able to consider interactions between vehicle fleet planning and CLSC network design problems is first developed. Uncertainties of the product demand and return fractions of the end-of-life products are handled by a chance-constrained stochastic program. Several Pareto optimal solutions are generated for the conflicting sustainability objectives via compromise and fuzzy goal programming (FGP) approaches.

The proposed model is tested on a real-life lead/acid battery recovery system. By using the proposed model, sustainable fleet plans that provide a smaller fleet size, fewer empty vehicle repositions, minimal CO₂ emissions, maximal vehicle safety ratings and minimal injury/illness incidence rate of transport accidents are generated. Furthermore, an environmentally and socially conscious CLSC network with maximal job creation in the less developed regions, minimal lost days resulting from the work's damages during manufacturing/recycling operations and maximal collection/recovery of end-of-life products is also designed.

Unlike the classical network design models, vehicle fleet planning decisions such as fleet sizing/composition, fleet assignment, vehicle inventory control, empty repositioning, etc. are also considered while designing a sustainable CLSC network. In addition to sustainability indicators in the network design, sustainability factors in fleet management are also handled. To the best of the authors' knowledge, there is no similar paper in the literature that proposes such a holistic optimization model for integrated sustainable fleet planning and CLSC network design.

The purpose of this paper is to extend an approach to solve linear programming problems with grey data and variables, based on a developed multi‐objective programming approach.

The proposed approach to generally solve the grey linear programming problems is based on the notion of order relation between interval grey numbers. This notion is applied to cascade the grey objective function to a bi‐objective problem based on the objective function of the original problem. The same approach is taken to transform grey constraints to a set of corresponding linear constraints. Finally, the obtained multi‐objective model can be solved by any existing methods in the literature.

One of the shortcomings of previous approaches to solve grey linear programming problems was that they required the grey coefficients of objective function to be both side negative or positive. The approach proposed here does not have such a requirement and guarantees the feasibility of solutions.

A different approach is developed in the paper that can be used to solve grey linear programming problems in general form. The method relaxes the limitation of existing approaches.

The purpose of this study is to propose a novel super-efficiency DEA model to appraise the relative efficiency of DMUs with zero data and stochastic data. Our model can work with both variable returns to scale (VRS) and constant returns to scale (CRS).

This study proposes a new stochastic super-efficiency DEA (SSDEA) model to assess the performance of airlines with stochastic and zero inputs and outputs.

This paper proposes a new analysis and contribution to the knowledge of efficiency assessment with stochastic super-efficiency DEA model by (1) using input saving and output surplus index for efficient DMUs to get the optimal solution; (2) obtaining efficiency scores from the proposed model that are equivalent to original stochastic super-efficiency model when feasible solutions exist. A case study is given to illustrate the applicability of our proposed model. Also, poor performance reasons are identified to improve the performance of inefficient airlines.

For the first time, a new SSDEA model for ranking DMUs is proposed. The introduced model produces a feasible solution when dealing with zero input or output. This paper applies the input saving and output surplus concept to rectify the infeasibility problem in the stochastic DEA model.