Ranking Of Sustainability Criteria For Industrial Symbiosis Applications Based On Anp

ALAKAS, Haci Mehmet/0000-0002-9874-7588WOS:000599463700004Enterprises have started to establish partnerships both to use their internal resources efficiently and to increase their environmental performance. Partnerships and interoperability of enterprises with different processes enable them to benefit more from their benefits. Moving towards the local and regional economy, these partnerships that increase environmental and own resources have created industrial symbiosis practices. Industrial ecology fields are established in these applications. Both environmental and economic gains can be achieved through the efficient use of resources by enterprises and the minimization of wastes. For the sustainability of these partnerships to be established by enterprises, they need to analyze the measures they take internally. In this study, the concept of industrial symbiosis and the criteria that are effective for the sustainability of these industrial symbiosis are evaluated. Analytical network process method is used. Thus, the industrial symbiosis infrastructures to be established by enterprises have been enabled to move strategically

Balancing stochastic type-II assembly lines: chance-constrained mixed integer and constraint programming models

ALAKAS, Haci Mehmet/0000-0002-9874-7588; PINARBASI, MEHMET/0000-0003-3424-2967WOS:000516920100001In the literature, line balancing is mostly investigated in deterministic environments. But production systems inevitably contain stochastic situations. In this study, the stochastic type-II assembly line balancing problem (ALBP) is considered. Firstly, a chance-constrained nonlinear mixed integer programming (MIP) formulation is developed from the well-known deterministic form. Then, a new linearized stochastic model is proposed by using some transformation approaches to reduce model complexity, and the model is solved. Finally, constraint programming (CP) models for deterministic ALBPs, nonlinear chance-constrained stochastic ALBPs and linearized chance-constrained stochastic ALBPs are developed, respectively. Problems from the literature are utilized to test the effectiveness of the proposed models and the results are compared with a bidirectional heuristic algorithm. The numerical results show that the CP models are more effective and successful for solving the stochastic ALBP. Some managerial implications are also suggested for industrial environments that consistently face ALBPs

Balancing stochastic type-II assembly lines: chance-constrained mixed integer and constraint programming models

ALAKAS, Haci Mehmet/0000-0002-9874-7588; PINARBASI, MEHMET/0000-0003-3424-2967WOS: 000516920100001In the literature, line balancing is mostly investigated in deterministic environments. But production systems inevitably contain stochastic situations. In this study, the stochastic type-II assembly line balancing problem (ALBP) is considered. Firstly, a chance-constrained nonlinear mixed integer programming (MIP) formulation is developed from the well-known deterministic form. Then, a new linearized stochastic model is proposed by using some transformation approaches to reduce model complexity, and the model is solved. Finally, constraint programming (CP) models for deterministic ALBPs, nonlinear chance-constrained stochastic ALBPs and linearized chance-constrained stochastic ALBPs are developed, respectively. Problems from the literature are utilized to test the effectiveness of the proposed models and the results are compared with a bidirectional heuristic algorithm. The numerical results show that the CP models are more effective and successful for solving the stochastic ALBP. Some managerial implications are also suggested for industrial environments that consistently face ALBPs

Problem Specific Variable Selection Rules for Constraint Programming: A Type II Mixed Model Assembly Line Balancing Problem Case

ALAKAS, Haci Mehmet/0000-0002-9874-7588WOS:000516911500001ABSRACT The main idea of constraint programming (CP) is to determine a solution (or solutions) of a problem assigning values to decision variables satisfying all constraints. Two sub processes, an enumeration strategy and a consistency, run under the constraint programming main algorithm. The enumeration strategy which is managing the order of variables and values to build a search tree and possible solutions is crucial process in CP. In this study problem-based specific variable selection rules are studied on a mixed model assembly line balancing problem. The 18 variable selection rules are generated in three main categories by considering the problem input parameters. These rules are tested with benchmark problems in the literature and experimental results are compared with the results of mathematical model and standard CP algorithm. Also, benchmark problems are run with two CP rules to compare experimental results. In conclusion, experimental results are shown that the outperform rules are listed and also their specifications are defined to guide to researchers who solve optimization problems with CP

A constraint programming approach to type-2 assembly line balancing problem with assignment restrictions

PINARBASI, MEHMET/0000-0003-3424-2967WOS: 000490968600005Purpose Main constraints for an assembly line balancing problem (ALBP) are cycle time/number of stations and task precedence relations. However, due to the technological and organizational limitations, several other restrictions can be encountered in real production systems. These restrictions are called as assignment restrictions and can be task assignment, station, resource and distance limitations. The purpose of the study is to evaluate the effects of these restrictions on ALBP using constraint programming (CP) model. Design/methodology/approach A novel CP model is proposed and compared to mixed-integer programming (MIP) as a benchmark. The objective is to minimize the cycle time for a given number of stations. The authors also provide explicit anthology of the assignment restriction effects on line efficiency, the solution quality and the computation time. Findings The proposed approach is verified with the literature test instances and a real-life problem from a furniture manufacturing company. Computational experiments show that, despite the fact that additional assignment restrictions are problematic in mathematical solutions, CP is a versatile exact solution alternative in modelling and the solution quality. Practical implications - Assembly line is a popular manufacturing system in the making of standardized high volume products. The problem of assembly line balancing is a crucial challenge in these settings and consists of assigning tasks to the stations by optimizing one or more objectives. Type-2 AR-ALBP is a specific case with the objective function of minimizing the cycle time for a given number of stations. It further assumes assignment restrictions that can be confronted due to the technological limitations or the strategic decisions of the company management. This is especially encountered in rebalancing lines. Originality/value Several solution approaches such as mathematical modelling, heuristic and meta-heuristic are proposed to solve the ALBP in the literature. In this study, a new approach has been presented using CP. Efficient models are developed for Type-2 ALBP with several assignment restrictions. Previous studies have not considered the problem to the presented extent. Furthermore, to the best of the authors' knowledge, the paper is the first study that solves ALBP with assignment restrictions using CP

Constraint programming model for resource-constrained assembly line balancing problem

13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) -- JUL 29-31, 2017 -- Guilin, PEOPLES R CHINAWOS: 000530043200044The literature studies assume that resources used to be perform the tasks are certain and homogenous in any assembly line. However, tasks may need to be processed by general resource requirements in real life. These general resources could be classified by usage of resources such as simple or multiple, alternative and concurrent. The problem which is related to assignment of the task to any workstation and assignment of resources needed by the task simultaneously is defined as resource-constrained assembly line balancing problems (RCALBPs). In this study, a multiobjective model with minimization of cycle time and resource usage for a given number of stations is modeled to solve the RCALBP for the first time. Alternative and general resource types for tasks and using more than two resource type requirements are also considered. A constraint programming model is developed and solved to find the optimal solutions of these problems. The proposed models are tested with sample scenarios to show the effectiveness of the model.IEEE, IEEE Circuits & Syst Soc, Guilin Univ Elect Technol, Hunan Univ, Guilin Univ Technol, Guilin Univ Aerosp Techno

Collection of recyclable wastes within the scope of the Zero Waste project: heterogeneous multi-vehicle routing case in Kirikkale

ALAKAS, Haci Mehmet/0000-0002-9874-7588WOS:000551807600003PubMed: 32638156There is an increase in the amount of resource use due to the rise in population, urbanization, and industrialization. Also, the amount of waste increases due to an increase in consumption and resource use. Countries are developing new policies depending on both decreasing resources and environmental problems caused by waste. The "Zero Waste" project was launched to recycle waste and to reduce environmental pollution in Turkey. The project aims to separate recyclable waste at its source and recycle them. One of the problems encountered in the implementation of the project is collecting the waste from temporary storage areas. In this study, the problem of transportation of wastes from temporary warehouses to the main warehouse was discussed in Kirikkale/Turkey. A three-step solution approach has been proposed to the solution of the problem. In the first stage, the amounts of waste generated at the addresses to collect were estimated. In the second stage, the addresses to be visited are classified with an approach based on Pareto analysis according to the calculated waste amounts. According to this classification, it is planned which addresses will be visited on which day of the week. At the last stage, the problem is modeled as a heterogeneous multi-vehicle routing problem, which also takes into account the daily working hours and vehicle capacity constraints. According to the result of the mathematical model, the number of vehicles needed for waste collection, the types of vehicles, and the routes of the vehicles were found. Considering the implementation stages of the Zero Waste project, three different case studies are handled for Kirikkale. These case studies have been solved by considering different waste rates. According to the results, the waste collection plan was made economically by visiting fewer spots in a week

Shift Scheduling with the Goal Programming Method: A Case Study in the Glass Industry

Eren, Tamer/0000-0001-5282-3138WOS: 000475299100077Nowadays, resource utilization and management are very important for businesses. They try to make a profit by providing high levels of efficiency from available sources. Their labor force is one of these sources. Therefore, scheduling based on personnel satisfaction has become an important problem in recent years. In this study, a case study was carried out in a glass factory in Ankara which has 7 department and 80 personnel. The aim of the study is to provide better service by distributing personnel to shifts in a fair and balanced manner. Assignment points are different for the departments where the personnel will work. Every personnel member is assigned to the department as best as possible. A goal programming method was used, and the results were better than those obtained using other methods

Surgical Operation Scheduling with Goal Programming and Constraint Programming: A Case Study

Eren, Tamer/0000-0001-5282-3138WOS: 000464369500002The achievement of health organizations' goals is critically important for profitability. For this purpose, their resources, materials, and equipment should be efficiently used in the services they provide. A hospital has sensitive and expensive equipment, and the use of its equipment and resources needs to be balanced. The utilization of these resources should be considered in its operating rooms, as it shares both expense expenditure and revenue generation. This study's primary aim is the effective and balanced use of equipment and resources in hospital operating rooms. In this context, datasets from a state hospital were used via the goal programming and constraint programming methods. According to the wishes of hospital managers, three scenarios were separately modeled in both methods. According to the obtained results, schedules were compared and analyzed according to the current situation. The hospital-planning approach was positively affected, and goals such as minimization cost, staff and patient satisfaction, prevention over time, and less use were achieved.Scientific Research Program (BAP) of Kirikkale UniversityKirikkale University [2017/027]This research was funded by Scientific Research Program (BAP) of Kirikkale University as project of 2017/027