Template-Type: ReDIF-Article 1.0
Author-Name: Nilufa Yeasmin
Author-X-Name-First: Nilufa
Author-X-Name-Last: Yeasmin
Author-Name: Sultana Parveen
Author-X-Name-First: Sultana
Author-X-Name-Last: Parveen
Author-Name: Anjuman Ara
Author-X-Name-First: Anjuman
Author-X-Name-Last: Ara
Title: Developing a hybrid genetic algorithm in a vehicle routing problem with simultaneous delivery and pickup with time windows: optimising fuel consumption
Abstract:
The environmental deterioration due to fossil fuel burning is the significant issue in logistic industry. This issue motivates the transportation industry to improve distribution activities. The vehicle routing problem (VRP) is concerned with developing eco-distribution activities in the logistics industry. Therefore, this study considers the VRP with simultaneous delivery and pickup with time windows (VRPSDPTW), a variant of VRP and develops an environmental fuel optimisation model for VRPSDPTW to optimise the vehicle fuel consumption. This study proposes a hybrid genetic algorithm (HGA) to solve the developed fuel optimisation model and applies GA to examine the operational efficiency of HGA. Finally, this study executes the computational experiment of two algorithms to solve the developed model under two alternate issues, i.e., fuel-oriented and distance-oriented. We found that the developed model under the fuel-oriented module reduces better fuel consumption, and the HGA performs better than GA regarding fuel consumption. [Received: 29 August 2022; accepted: 16 February 2023]
Journal: European J. of Industrial Engineering
Pages: 537-556
Issue: 4
Volume: 18
Year: 2024
Keywords: fuel optimisation; VRPSDPTW; genetic algorithm; hybrid-genetic algorithm.
File-URL: http://www.inderscience.com/link.php?id=139321
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:4:p:537-556
Template-Type: ReDIF-Article 1.0
Author-Name: Kuo-Hao Chang
Author-X-Name-First: Kuo-Hao
Author-X-Name-Last: Chang
Author-Name: Robert Cuckler
Author-X-Name-First: Robert
Author-X-Name-Last: Cuckler
Title: Solving the stochastic machine assignment problem with a probability-based objective: problem formulation, solution method and practical applications
Abstract:
In this research, a variation of the assignment problem is formulated. Diverging from many studies which model the assignment problem in a deterministic setting, we consider a noisy and complex manufacturing process consisting of several workstations, each of which must be assigned a machine from a set of machine types which vary randomly according to processing time. The objective is to determine the optimal assignment solution which maximises the probability that a production task is completed within a prespecified completion time interval. To solve the proposed problem, we develop an efficient simulation optimisation method which incorporates a factor screening method into a nested partitions-based framework. A series of numerical experiments are conducted to test the efficiency of the proposed algorithm in comparison to competing ones. Compared to existing algorithms, the proposed solution methodology was able to find feasible machine assignment solutions which generated substantially higher probabilities of job completion. [Received: 29 September 2022; Accepted: 16 February 2023]
Journal: European J. of Industrial Engineering
Pages: 512-536
Issue: 4
Volume: 18
Year: 2024
Keywords: production management; production planning; simulation applications; simulation optimisation.
File-URL: http://www.inderscience.com/link.php?id=139323
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:4:p:512-536
Template-Type: ReDIF-Article 1.0
Author-Name: Yucong Wang
Author-X-Name-First: Yucong
Author-X-Name-Last: Wang
Author-Name: Ping Chen
Author-X-Name-First: Ping
Author-X-Name-Last: Chen
Title: An adaptive large neighbourhood search for multi-depot electric vehicle routing problem with time windows
Abstract:
The multi-depot electric vehicle routing problem with time windows (MDEVRPTW) is an extension of the electric vehicle routing problem with time windows (EVRPTW). Due to the driving range limit, the EVs need to recharge at some charging stations en route. In the MDEVRPTW, the EVs depart from different depots, visit the assigned customers for delivery, and finally return to the depot where they leave. The EVs could recharge at any depot or public charging station whenever necessary. This problem is formulated as a mixed-integer linear programming model, and an adaptive large neighbourhood search algorithm is proposed for solving it. In the proposed approach, both general and problem-specific destroy and repair operators are applied to improve solution quality. Numerical results show that the proposed approach can obtain high-quality solutions within less computing time and an elite version of the proposed ALNS could perform better than the complete version. [Received: 20 August 2021; Accepted: 25 April 2023]
Journal: European J. of Industrial Engineering
Pages: 606-636
Issue: 4
Volume: 18
Year: 2024
Keywords: electric vehicle routing problem; multi-depot; time windows; charging station; adaptive large neighbourhood search.
File-URL: http://www.inderscience.com/link.php?id=139327
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:4:p:606-636
Template-Type: ReDIF-Article 1.0
Author-Name: Meng Xue
Author-X-Name-First: Meng
Author-X-Name-Last: Xue
Author-Name: Di Wu
Author-X-Name-First: Di
Author-X-Name-Last: Wu
Author-Name: Haiqing Hu
Author-X-Name-First: Haiqing
Author-X-Name-Last: Hu
Title: Pricing and financing strategies of dual channel closed-loop supply chain considering capital-constrained manufacturer
Abstract:
With the rise of the 'internet + recycling' model, the manufacturer actively constructs a dual channel closed-loop supply chain model and faces serious capital constraints, and the manufacturer's financing strategy is particularly important. Based on this, this paper uses Stackelberg theory to construct a dual channel closed-loop supply chain game model composed of the manufacturer and the retailer. Furthermore, in view of the fact that the manufacturer has capital constraints, the optimal financing and pricing strategies of supply chain enterprises are studied in two financing models: bank loan and retailer financing. Finally, using case study to verify the model results, it is found that the retailer financing can bring higher economic profit and recovery rate. In the retailer financing mode, when interest rate is low, the raising interest rate will 'harm others and itself', while when interest rate is high, the raising interest rate will 'benefit others and harm itself'. [Received: 6 June 2022, Accepted: 4 January 2023]
Journal: European J. of Industrial Engineering
Pages: 275-301
Issue: 2
Volume: 18
Year: 2024
Keywords: capital-constrained; dual channel closed-loop supply chain; financing strategy; pricing strategy.
File-URL: http://www.inderscience.com/link.php?id=137035
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:2:p:275-301
Template-Type: ReDIF-Article 1.0
Author-Name: Maher A.N. Agi
Author-X-Name-First: Maher A.N.
Author-X-Name-Last: Agi
Author-Name: Xinghao Yan
Author-X-Name-First: Xinghao
Author-X-Name-Last: Yan
Author-Name: Öncü Hazir
Author-X-Name-First: Öncü
Author-X-Name-Last: Hazir
Title: Piling and discounting perishable products: optimal replenishment and discounting policy for perishable products
Abstract:
Retail stores often display large quantities of perishable products that they sell at full price over a given period and then at a discount until the end of the inventory cycle. We investigate this common practice by considering a product which is subject to continuous decay through time. The demand is a function of both the price of the product and the inventory level. The retailer may discount the product once during the cycle. Closed-form expressions were provided for the maximum discounting time and cycle time. The conditions under which an optimal discount policy exists were established. The results provide insights to decision-makers on how to design a markdown policy for perishable products. [Received: 9 November 2021; Accepted: 31 December 2022]
Journal: European J. of Industrial Engineering
Pages: 225-241
Issue: 2
Volume: 18
Year: 2024
Keywords: inventory management; perishable product; discount; markdown policy; inventory-level-dependent-demand.
File-URL: http://www.inderscience.com/link.php?id=137038
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:2:p:225-241
Template-Type: ReDIF-Article 1.0
Author-Name: Xiao Fu
Author-X-Name-First: Xiao
Author-X-Name-Last: Fu
Author-Name: Qikai Wang
Author-X-Name-First: Qikai
Author-X-Name-Last: Wang
Author-Name: Jie Li
Author-X-Name-First: Jie
Author-X-Name-Last: Li
Author-Name: Yan Liu
Author-X-Name-First: Yan
Author-X-Name-Last: Liu
Author-Name: Guanghua Han
Author-X-Name-First: Guanghua
Author-X-Name-Last: Han
Title: Trust-based two-stage order strategy of e-commerce platforms with information asymmetry
Abstract:
This paper explores the trust-based strategic decisions of manufacturers and e-commerce platforms. The analysis shows that the trust update model effectively supplies chain partners' behaviour. In the case of maximising the profit of the supply chain, the manufacturer tends to recommend a higher order quantity, but due to the existence of a trust update mechanism in the e-commerce platform, the final order quantity tends to approach the actual market demand. In the case of maximising trust, if the manufacturer blindly caters to the e-commerce platform, it deviates from the actual market demand forecast and ultimately results in losses. [Received: 27 July 2022; Accepted: 31 December 2022]
Journal: European J. of Industrial Engineering
Pages: 242-274
Issue: 2
Volume: 18
Year: 2024
Keywords: manufacturer; e-commerce platform; trust; price discount; forecast accuracy.
File-URL: http://www.inderscience.com/link.php?id=137040
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:2:p:242-274
Template-Type: ReDIF-Article 1.0
Author-Name: Elham Kouchaki Tajani
Author-X-Name-First: Elham Kouchaki
Author-X-Name-Last: Tajani
Author-Name: Armin Ghane Kanafi
Author-X-Name-First: Armin Ghane
Author-X-Name-Last: Kanafi
Author-Name: Maryam Daneshmand-Mehr
Author-X-Name-First: Maryam
Author-X-Name-Last: Daneshmand-Mehr
Author-Name: Ali-Asghar Hosseinzadeh
Author-X-Name-First: Ali-Asghar
Author-X-Name-Last: Hosseinzadeh
Title: Designing the agile green sustainable multi-channel closed-loop supply chain with dependent demand to price and greenness under epistemic uncertainty
Abstract:
The increasing pressure and intensity of world competition in business environments, which is ever-changing, has doubled the necessity of proper reactions by industrial manufacturing organisations and companies. Therefore, this paper proposes a novel design of a closed-loop supply chain with multiple forms of product distribution and collection that aim to maximise profit and social responsibility while minimising delays in delivery and environmental pollution. The proposed model uses two indices, local employment and the number of jobs created, to show the performance of the function of social responsibility. Further, by mentioning pricing and greenness levels for the products in the paper, we formulate customer demands dependent on the price and greenness of the products. Also, RFID technology is considered for every vehicle to reduce time lags during transportation. Besides, the modelling is performed according to a possibilistic mean-absolute deviation approach due to the uncertain nature of some parameters. Eventually, the augmented ε-constraint method is utilised to solve and its validation. The results revealed that the proposed model could provide efficient decisions that can be a suitable tool for managers and experts, and it can have extensive application, particularly from a strategic perspective. [Received: 9 October 2022; Accepted: 6 April 2023]
Journal: European J. of Industrial Engineering
Pages: 557-605
Issue: 4
Volume: 18
Year: 2024
Keywords: multi-channel; pricing; RFID; possibilistic programming.
File-URL: http://www.inderscience.com/link.php?id=139348
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:4:p:557-605
Template-Type: ReDIF-Article 1.0
Author-Name: Mazaher Ziaei
Author-X-Name-First: Mazaher
Author-X-Name-Last: Ziaei
Author-Name: Saeedeh Ketabi
Author-X-Name-First: Saeedeh
Author-X-Name-Last: Ketabi
Author-Name: Mahsa Ghandehari
Author-X-Name-First: Mahsa
Author-X-Name-Last: Ghandehari
Title: Integrative decision on new product development in configurable product family
Abstract:
Intensified competition leads companies to integrate decision-making on design, supply, and marketing policies for the new product development (NPD). This integration is more substantial for the manufacturers of configurable product families (CPF) such as cars. This study aims to develop a profit-maximisation model to concurrently optimise all main variables of configuration selection, components' supply policy, price, modules' warranty length, and launch time for NPD in CPF. The proposed model is a mixed-integer nonlinear program and is solved through an adapted differential evolution (DE) algorithm. Different numerical cases extracted from one automobile company are studied, and sensitivity analysis on the main parameters is performed. The results approve the significant effects of integrative decision-making based on new variables on the profit. Due to the diversity of the decision variables, the model can be applied in a wide range of situations. Furthermore, considering more realistic assumptions helps to achieve more practical solutions and applicable results. [Received: 10 February 2021, Accepted: 30 December 2022]
Journal: European J. of Industrial Engineering
Pages: 191-224
Issue: 2
Volume: 18
Year: 2024
Keywords: configurable product family; modules' warranty length; launch time; mixed-integer nonlinear programming; differential evolution; DE; algorithm.
File-URL: http://www.inderscience.com/link.php?id=137050
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:2:p:191-224
Template-Type: ReDIF-Article 1.0
Author-Name: Yujing Jiang
Author-X-Name-First: Yujing
Author-X-Name-Last: Jiang
Author-Name: Zhe Zhang
Author-X-Name-First: Zhe
Author-X-Name-Last: Zhang
Author-Name: Xue Gong
Author-X-Name-First: Xue
Author-X-Name-Last: Gong
Author-Name: Yong Yin
Author-X-Name-First: Yong
Author-X-Name-Last: Yin
Title: An exact solution method for seru scheduling problems with multiple rate-modifying activities and learning effect
Abstract:
This study investigates two <i>seru</i> scheduling problems in a <i>seru</i> production system (SPS) with multiple rate-modifying activities and DeJong's learning effect to minimise the total completion time and the total waiting time. Upon reformulating two <i>seru</i> scheduling problems to assignment problems, the calculation time is confirmed; these two <i>seru</i> scheduling problems can be solved in polynomial time if the job allocation vector is given in advance. Then, a general exact solution method is proposed to obtain the optimal schedule. Computational experiments and sensitivity analysis on learning effect are also designed to test the performance of proposed exact solution method. The results indicate that the frequency of rate-modifying activity is not the more the better, nor the less the better in improving the production efficiency, a balance between modifying rate and modifying times should also be considered in practical SPS production. The proposed exact solution method can provide the optimal solution in reasonably implementing rate-modifying activity strategies and scheduling jobs to reach the shortest total completion time or job waiting time. This study will instructively help SPS shorten production cycle, improve productivity and order responsiveness to some extent. [Received: 28 December 2021; Accepted: 28 December 2022]
Journal: European J. of Industrial Engineering
Pages: 469-511
Issue: 4
Volume: 18
Year: 2024
Keywords: seru scheduling; rotating seru; exact solution method; assignment problem; rate-modifying; learning effect.
File-URL: http://www.inderscience.com/link.php?id=139354
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:4:p:469-511
Template-Type: ReDIF-Article 1.0
Author-Name: Yeu-Shiang Huang
Author-X-Name-First: Yeu-Shiang
Author-X-Name-Last: Huang
Author-Name: Chih-Chiang Fang
Author-X-Name-First: Chih-Chiang
Author-X-Name-Last: Fang
Author-Name: Yi-Hsiang Tsao
Author-X-Name-First: Yi-Hsiang
Author-X-Name-Last: Tsao
Title: A study on pricing and recycling strategies for retailers with consideration of selling new and refurbished products
Abstract:
Used products can be recycled for remanufacturing, but refurbished products may still compete with new products in a market since some price-sensitive consumers may be attracted by a low price. Therefore, firms should make price decisions for new and refurbished products with caution. This study investigates a retailer's pricing and recycling strategies for two types of consumers: quality-oriented consumers and price-sensitive consumers. The work examines internal and external competition between new and refurbished products with the consideration of consumer heterogeneity. A Stackelberg game theoretic model will be considered in the study, in which the manufacturer is a leader, who determines the official price and wholesale price first, and the retailer is a follower, who then accordingly develops optimal pricing strategies considering the two recycling policies. The analytical results show that retailers would rather recycle products on their own than outsource recycling if they were more capable of remanufacturing. [Received: 24 June 2022; Accepted: 10 May 2023]
Journal: European J. of Industrial Engineering
Pages: 791-816
Issue: 6
Volume: 18
Year: 2024
Keywords: pricing; remanufacturing; consumer heterogeneity; game theory.
File-URL: http://www.inderscience.com/link.php?id=141720
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:6:p:791-816
Template-Type: ReDIF-Article 1.0
Author-Name: Robson Flávio Castro
Author-X-Name-First: Robson Flávio
Author-X-Name-Last: Castro
Author-Name: Roberto Fernandes Tavares Neto
Author-X-Name-First: Roberto Fernandes Tavares
Author-X-Name-Last: Neto
Author-Name: Moacir Godinho Filho
Author-X-Name-First: Moacir Godinho
Author-X-Name-Last: Filho
Title: Evaluating dispatching rules for make-to-availability under simplified drum-buffer-rope: a computational experiment
Abstract:
This research evaluates the impact of some dispatching rules (DR) on the performance of make-to-availability (MTA) under the simplified drum-buffer-rope (S-DBR) system. S-DBR/MTA seeks to ensure the availability of finished products to meet demand, so production needs to replenish inventory quickly. The DR has an important influence on the replenishment speed, which dictates the performance of such systems. We evaluate four rules found in the literature (FIFO, AT, SPT, and SRPT), two of the S-DBR/MTA (PSP and PSP1), and six rules combining the two groups (PSP-AT, PSP-SPT, PSP - PSP1-AT, PSP1-SPT, and PSP1-SRPT) using a computational experiment. We use the following measures to evaluate the performance of such rules: service level, average inventory in the system, mean flow time, and stock rate per service level percentage. The PSP1-SPT rule gets better results than others, increasing the S-DBR/MTA performance. [Received: 17 August 2022; Accepted: 4 June 2023]
Journal: European J. of Industrial Engineering
Pages: 841-859
Issue: 6
Volume: 18
Year: 2024
Keywords: make-to-availability; MTA; simplified drum-buffer-rope; S-DBR; theory of constraint; dispatching rule; DR; flow-shop; scheduling; work-in-process; WIP; finished goods inventory; FGI.
File-URL: http://www.inderscience.com/link.php?id=141723
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:6:p:841-859
Template-Type: ReDIF-Article 1.0
Author-Name: Zahra Hadadi
Author-X-Name-First: Zahra
Author-X-Name-Last: Hadadi
Author-Name: Mohammad Reza Gholamian
Author-X-Name-First: Mohammad Reza
Author-X-Name-Last: Gholamian
Author-Name: Maryam Noroozi
Author-X-Name-First: Maryam
Author-X-Name-Last: Noroozi
Title: The sale services, bundling, and jointly advertising strategies under profit sharing contract in closed-loop competitive supply chain
Abstract:
In this research, a two-level dual-channel CLSC and the coordination model has been achieved through combination of revenue sharing contract with a cost-sharing contract. In addition, recycling the waste used products is nowadays vital for all SCs and also advertising, to improve public information and introduce the products, is a factor that is worth investing jointly in. At result in this research, SC in three scenarios (decentralised, centralised, and coordinated) has been studied considering the Stackelberg game and using the Lagrangian approach and KKT conditions to achieve optimal decisions. Sensitivity analysis shows that sale service and bundling improve the total profit of SC and increase the number of sales. Bundling and sale services strategies helped SC not to be destroyed and not to be ineffective in the market. Also, analysis shows that investing in the advertisement is always beneficial, and joint advertising makes efficient collaboration in a competitive situation. [Received: 9 June 2021; Accepted: 1 August 2022]
Journal: European J. of Industrial Engineering
Pages: 157-190
Issue: 2
Volume: 18
Year: 2024
Keywords: coordination; bundling; recycling; sale services; jointly advertisement; stackelberg game.
File-URL: http://www.inderscience.com/link.php?id=137116
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:2:p:157-190
Template-Type: ReDIF-Article 1.0
Author-Name: Nazli Karataş Aygün
Author-X-Name-First: Nazli Karataş
Author-X-Name-Last: Aygün
Author-Name: Önder Bulut
Author-X-Name-First: Önder
Author-X-Name-Last: Bulut
Title: Hotel overbooking, capacity rationing and cooperation with third-parties: a two-period optimisation model
Abstract:
We propose a two-period optimisation model for a hotel revenue management (RM) problem where overbooking, capacity rationing and cooperation with third-party websites are simultaneously considered. In a Stackelberg game structure, the hotel first sets the price, and overbooking and rationing levels, and as the followers, third-parties decide their effort levels by a Nash game. The proposed model is solved using a genetic algorithm. An extensive numerical study is performed to investigate the effects of multiple night stays, hotel effort level, and hotel capacity on the decisions and the hotel profit. It is shown that the value of capacity rationing increases with multiple night stays and the expected profit of the third-parties is decreasing with the hotel effort level but the relation between the hotel effort level and profit is not monotone. As the hotel capacity is expanded, the effort level of the third-parties and the hotel profit increase. [Received: 1 December 2021; Accepted: 26 May 2023]
Journal: European J. of Industrial Engineering
Pages: 817-840
Issue: 6
Volume: 18
Year: 2024
Keywords: pricing; overbooking; third-party websites; multiple night stays; multiple customer classes; two-period optimisation model.
File-URL: http://www.inderscience.com/link.php?id=141730
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:6:p:817-840
Template-Type: ReDIF-Article 1.0
Author-Name: Hercules Tadeu Asato Dantas
Author-X-Name-First: Hercules Tadeu Asato
Author-X-Name-Last: Dantas
Author-Name: Roberto Fernandes Tavares Neto
Author-X-Name-First: Roberto Fernandes Tavares
Author-X-Name-Last: Neto
Author-Name: Juliana Keiko Sagawa
Author-X-Name-First: Juliana Keiko
Author-X-Name-Last: Sagawa
Title: The influence of shelf life on the integrated production scheduling and vehicle routing optimisation for perishable products
Abstract:
Prior studies on integrating production and distribution optimisation highlight the benefits of such an approach. However, no studies regarding standardised metrics for categorising shelf life lengths in different scenarios were found. Moreover, the current literature does not address the change of behaviour on solving strategies accordingly to different shelf life profiles. To address these gaps, this research proposes the normalised shelf life metric to classify long and short shelf life products. Additionally, we present a simplified optimisation formulation for the integrated production scheduling and vehicle routing problem. By evaluating three solution methods (MILP model, genetic algorithm, and logic-based Benders decomposition model), our findings reveal that shelf life significantly affects solution performance. These results emphasise the need for research focused on solution methods tailored specifically for short shelf life products. [Received: 26 July 2022; Accepted: 7 June 2023]
Journal: European J. of Industrial Engineering
Pages: 860-884
Issue: 6
Volume: 18
Year: 2024
Keywords: shelf life; production-distribution integration; perishable products; genetic algorithm.
File-URL: http://www.inderscience.com/link.php?id=141732
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:6:p:860-884
Template-Type: ReDIF-Article 1.0
Author-Name: Sunil B. Bhoi
Author-X-Name-First: Sunil B.
Author-X-Name-Last: Bhoi
Author-Name: Jayesh M. Dhodiya
Author-X-Name-First: Jayesh M.
Author-X-Name-Last: Dhodiya
Title: Multi-objective university rescheduling problem by fuzzy programming technique
Abstract:
This study presents multi-objective university rescheduling assignment problem (MOURAP), when some faculty members have been left the institute due to unavoidable circumstances, i.e., disruptions. This presented model executed in two phases. The first phase discusses and formulates the university course rescheduling problem and allocates unassigned courses to available faculty members based on the preferences for course of the faculty members, administrators and the indirect students preferences computed on faculty feedback and student result analysis. In the second phase, faculty members and courses are assigned to time in pairs, based on the faculty member's preferences. The prime aim of rescheduling is to minimise the course allocation change from former and latter to faculty members and time slots allocations change from initial and new schedule to faculty members and students. To test the strength of the presented model, this study demonstrated the model with two numerical examples on hypothetical data. With hypothetical numerical data, the model has been executed and has generated a new schedule by fuzzy programming technique with linear and exponential membership functions. This technique always produced non-dominated/compromise solutions. Results are obtained using LINGO19.0 software. [Received: 14 January 2022; Accepted: 9 July 2023]
Journal: European J. of Industrial Engineering
Pages: 885-909
Issue: 6
Volume: 18
Year: 2024
Keywords: university scheduling; rescheduling; 0-1 integer programming; fuzzy programming technique.
File-URL: http://www.inderscience.com/link.php?id=141736
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:6:p:885-909
Template-Type: ReDIF-Article 1.0
Author-Name: Fakhar Mustafa
Author-X-Name-First: Fakhar
Author-X-Name-Last: Mustafa
Author-Name: Rehan Ahmad Khan Sherwani
Author-X-Name-First: Rehan Ahmad Khan
Author-X-Name-Last: Sherwani
Author-Name: Muhammad Ali Raza
Author-X-Name-First: Muhammad Ali
Author-X-Name-Last: Raza
Title: Designing a cumulative sum control chart using generalised Conway-Maxwell-Poisson distribution for monitoring the count data
Abstract:
This study proposes a multipurpose cumulative-sum control chart based on the generalised Conway-Maxwell Poisson (GCOMP) distribution and names it the GCUSUM control chart. The proposed control chart monitors dispersed count data considering tail behaviour. Further, the proposed chart can also monitor zero-inflated count data. The proposed chart's in-control and out-of-control performance analyses have been conducted using different run-length (RL) criteria. A comparative study has been presented to show the effectiveness of the proposed GCUSUM chart over established charts for monitoring distinctive features of the count data. It has been observed that the proposed control chart is efficient in monitoring the under- and over- dispersion in the count data while considering the tail behaviour. The GCUSUM chart also monitors the zero-inflated count data without utilising the zero-inflation property. Numerical and real-life examples also validate the effectiveness of the proposed control chart. [Received: 24 July 2022; Accepted: 25 April 2023]
Journal: European J. of Industrial Engineering
Pages: 637-668
Issue: 5
Volume: 18
Year: 2024
Keywords: control chart; SPC; under-dispersion; over-dispersion; zero-inflation; tail behaviour.
File-URL: http://www.inderscience.com/link.php?id=140739
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:5:p:637-668
Template-Type: ReDIF-Article 1.0
Author-Name: Nahla Chabbah Sekma
Author-X-Name-First: Nahla Chabbah
Author-X-Name-Last: Sekma
Author-Name: Hatem Hadda
Author-X-Name-First: Hatem
Author-X-Name-Last: Hadda
Title: A hierarchical approach to schedule the two-machine flow shop problem with flexible periodic synchronised maintenance
Abstract:
This paper tackles the makespan minimisation for the well-known two-machine flow shop problem with flexible periodic maintenance activities on both machines. The maintenance starting dates are to be decided along with the job's sequence. We adopt a hierarchical approach in which we first decide the job's sequence and then the maintenance starting dates. We identify a dominance rule and a polynomial case, and construct an enhancement procedure. We develop and test several variants of Tabu search and simulated annealing metaheuristics. We also propose an adaptation of the well-known NEH heuristic. The experimental study shows the superiority of one of the variants of simulated annealing and the efficiency of the dominance rule. [Received: 15 July 2022; Accepted: 8 May 2023]
Journal: European J. of Industrial Engineering
Pages: 669-690
Issue: 5
Volume: 18
Year: 2024
Keywords: flow shop scheduling; flexible maintenance; Tabu search; simulated annealing.
File-URL: http://www.inderscience.com/link.php?id=140743
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:5:p:669-690
Template-Type: ReDIF-Article 1.0
Author-Name: Ayşe Çelik
Author-X-Name-First: Ayşe
Author-X-Name-Last: Çelik
Author-Name: Serkan Kaya
Author-X-Name-First: Serkan
Author-X-Name-Last: Kaya
Title: The solution of bi-criteria flow shop scheduling problem through mathematical modelling and its application in a shoe factory
Abstract:
This paper addresses a problem occurring in a real-life shoe manufacturing factory consisting of 28 machines. Due to a large number of orders, frequent and long delays in the delivery of the products to customers occur, which costs the factory a significant amount. The problem is formulated as a flow shop scheduling (FSS) problem and a 0-1 integer goal programming model is developed. Computational experiments indicate that problems with up to 50 jobs can be solved within a reasonable time by the developed model. A comparison of the results with the actual case in the factory revealed that, on the average, an improvement of 72.0% in total tardiness (TT) was achieved while an improvement of 3.9% was achieved in the maximum completion time. This helped to save the factory significantly. [Received: 30 January 2023; Accepted: 1 June 2023]
Journal: European J. of Industrial Engineering
Pages: 772-790
Issue: 5
Volume: 18
Year: 2024
Keywords: flow shop scheduling; FSS; 0-1 integer goal programming model; shoe manufacturing; makespan; total tardiness; TT.
File-URL: http://www.inderscience.com/link.php?id=140751
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:5:p:772-790
Template-Type: ReDIF-Article 1.0
Author-Name: Mehmet Erdem Coskun
Author-X-Name-First: Mehmet Erdem
Author-X-Name-Last: Coskun
Author-Name: Elkafi Hassini
Author-X-Name-First: Elkafi
Author-X-Name-Last: Hassini
Title: Penalty and threshold optimisation of the retailer - vendor return contracts for contract re-negotiation in retail reverse supply chains
Abstract:
In this paper, we consider a decentralised reverse supply chain constituting of multiple vendors and an independent retailer. The vendors offer the retailer return contracts with a multi-layered penalty structure deal. We focus on the strategic decision of developing optimal vendor re-negotiation contract parameters for the retailer. We model the problem as a mixed integer nonlinear program (MINLP) where the retailer decides on the vendor penalty fees and return thresholds simultaneously. We propose an efficient solution approach based on decomposing by decoupling the decision on penalty fees and return thresholds. The resulting problems are linear and we used them to provide rules for re-negotiation tactics for the retailer. We find that the retailer can save up to 7% from re-negotiation their contract terms. [Received: 16 June 2022; Accepted: 26 February 2023]
Journal: European J. of Industrial Engineering
Pages: 303-333
Issue: 3
Volume: 18
Year: 2024
Keywords: retail; reverse supply chain; decentralised decision making; coordination; vendor contracts; buyback contracts; return contracts; contract terms; product returns; retail returns; returns management; multi-layered penalty structure; piece-wise linear; optimisation; rule-of-thumb.
File-URL: http://www.inderscience.com/link.php?id=138195
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:3:p:303-333
Template-Type: ReDIF-Article 1.0
Author-Name: Cassiano da Silva Tavares
Author-X-Name-First: Cassiano da Silva
Author-X-Name-Last: Tavares
Author-Name: Pedro Munari
Author-X-Name-First: Pedro
Author-X-Name-Last: Munari
Author-Name: Moacir Godinho Filho
Author-X-Name-First: Moacir Godinho
Author-X-Name-Last: Filho
Title: Robust supplier selection under uncertain costs and delivery delay times
Abstract:
We address the supplier selection problem under uncertainty, motivated by the current economic situation of global trade. The intense search among organisations for responsiveness in meeting market demands has directed efforts toward supply chain optimisation. Consequently, the decision regarding the best supplier choice has become vital for the success of organisations, requiring a high level of accuracy and assertiveness under complex and uncertain environments. To support decision-making in global sourcing environments, we propose a robust optimisation model that incorporates cost and time uncertainties that commonly arise in the context of worldwide raw materials supply. The model includes raw materials inventory management, preventing stockouts and violations of physical storage constraints, while considering deviations of the uncertain parameters. We analyse the behaviour of the proposed model using 324,000 scenarios generated by Monte Carlo simulations. The results show that the proposed model increases the level of robustness without significantly increasing the value of the objective function when uncertain costs and times attain their worst-case scenarios (highest deviation). On average, the objective function values increased only 3.58% in the worst case, considering 20 products, 40 periods, 60 suppliers, and an uncertainty level of 50%. [Received: 1 June 2022; Accepted: 10 May 2023]
Journal: European J. of Industrial Engineering
Pages: 691-727
Issue: 5
Volume: 18
Year: 2024
Keywords: supplier selection; uncertainty; inventory; VUCA; robust optimisation.
File-URL: http://www.inderscience.com/link.php?id=140757
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:5:p:691-727
Template-Type: ReDIF-Article 1.0
Author-Name: Changjun Wang
Author-X-Name-First: Changjun
Author-X-Name-Last: Wang
Author-Name: Mao Mao
Author-X-Name-First: Mao
Author-X-Name-Last: Mao
Title: Reliable global supply chain network design under supply disruptions
Abstract:
This paper studies a reliable global supply chain (GSC) design subject to uncertain supply disruptions with underlying correlation. A two-stage distributionally robust model is developed, where the joint disruption distributions are captured by an ambiguous set under a set of known marginal disruption probabilities. The proactive strategies and recourse decisions are optimised in an integrated way, the former considering the selection of suppliers, plants, and product design solutions, while the latter including multi-source procurement. We uncover the relationship between the closed-form worst-case joint distribution and the marginal disruption probabilities by proving the supermodularity of the recourse model. Therefore, the proposed min-max-min model can be equivalently reformulated as a stochastic program. Finally, an experimental study is performed. Our approach not only saves lots of costly efforts in enhancing the visibility of GSC disruptions, but also provides a promising alternative for addressing GSC design in a complex and uncertain setting. [Received: 16 August 2022; Accepted: 3 March 2023]
Journal: European J. of Industrial Engineering
Pages: 334-364
Issue: 3
Volume: 18
Year: 2024
Keywords: global supply chain network; supply disruption; reliability; two-stage distributionally robust; supermodularity.
File-URL: http://www.inderscience.com/link.php?id=138198
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:3:p:334-364
Template-Type: ReDIF-Article 1.0
Author-Name: Gilles Galichet
Author-X-Name-First: Gilles
Author-X-Name-Last: Galichet
Author-Name: Roberta Costa Affonso
Author-X-Name-First: Roberta Costa
Author-X-Name-Last: Affonso
Author-Name: Vincent Cheutet
Author-X-Name-First: Vincent
Author-X-Name-Last: Cheutet
Title: Process-oriented maturity framework for lean manufacturing with health-at-work and performance management objectives
Abstract:
Lean manufacturing is recognised as an approach that improves companies' performance through the elimination of non-value-added activities. However, not all companies implement this approach since there is no standard method for doing so, and some authors have even identified it as a source of stress or occupational illnesses. In light of this, how can an action plan, for its implementation, be defined while guaranteeing the synergy between industrial performance and health at work? Maturity frameworks are tools that identify a company's level of capability regarding the studied parameters, and so can serve as a guide in their organisational transformation. In this article we propose a process-oriented maturity framework for lean manufacturing transformation that considers health at work and the company's managerial and operational performance. The framework is illustrated through a company's evolution over the course of a five-year project, and is then discussed. [Submitted: 14 June 2021; Accepted: 19 September 2022]
Journal: European J. of Industrial Engineering
Pages: 28-74
Issue: 1
Volume: 18
Year: 2024
Keywords: health at work; industrial performance; maturity; organisational transformation; capability; lean manufacturing.
File-URL: http://www.inderscience.com/link.php?id=135385
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:1:p:28-74
Template-Type: ReDIF-Article 1.0
Author-Name: Lu Chen
Author-X-Name-First: Lu
Author-X-Name-Last: Chen
Author-Name: Yi Xia
Author-X-Name-First: Yi
Author-X-Name-Last: Xia
Author-Name: Jiajia Zhu
Author-X-Name-First: Jiajia
Author-X-Name-Last: Zhu
Author-Name: Junyi Li
Author-X-Name-First: Junyi
Author-X-Name-Last: Li
Title: Service variety strategies for healthcare systems under capacity limitations
Abstract:
Some hospitals provide paid medical services in addition to basic medical services. Although paid medical services can provide a better experience for patients who are highly sensitive to delays, they cause a capacity reduction in basic medical services. We develop a model incorporating product line design and queuing models to determine the service capacity allocation for a healthcare system. Patients are categorised into two segments according to their sensitivities to waiting time. We derive the optimal capacity allocations under two strategies (providing both paid and basic medical services and providing only the basic one) and compare them. Results show that the hospital should provide only the basic medical service even if high-sensitive patients are extremely sensitive to waiting time. Under certain conditions, a hospital providing differentiated medical services should decrease capacity allocation to the paid service even if high-sensitive patients are extremely sensitive to waiting time. [Received: 13 April 2022; Accepted: 22 September 2022]
Journal: European J. of Industrial Engineering
Pages: 75-99
Issue: 1
Volume: 18
Year: 2024
Keywords: healthcare system; capacity limitation; product line design; queuing model.
File-URL: http://www.inderscience.com/link.php?id=135386
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:1:p:75-99
Template-Type: ReDIF-Article 1.0
Author-Name: Zeynep Uruk
Author-X-Name-First: Zeynep
Author-X-Name-Last: Uruk
Author-Name: Ayten Yılmaz Yalçıner
Author-X-Name-First: Ayten Yılmaz
Author-X-Name-Last: Yalçıner
Title: Two-machine flowshop scheduling with fuzzy processing times and flexible operations
Abstract:
This paper considers a two-machine flowshop scheduling problem with fuzzy processing times and flexible operations to minimise makespan. The jobs have three operations, one of which is a flexible operation that can be processed on one of the machines. The flexible operation should be assigned to one of the machines. Moreover, the processing times on the machines are not fixed but fuzzy processing times which are assumed to have triangular possibility distributions. Firstly, a possibilistic mathematical model is proposed with fuzzy processing times and then it is converted to an auxiliary crisp model using the weighted average defuzzification method. For the large cases where the exact algorithm may not be efficient, a heuristic algorithm is proposed. [Received: 24 May 2022; Accepted: 18 October 2022]
Journal: European J. of Industrial Engineering
Pages: 100-119
Issue: 1
Volume: 18
Year: 2024
Keywords: scheduling; flowshop; makespan; fuzzy processing times; flexible operations.
File-URL: http://www.inderscience.com/link.php?id=135387
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:1:p:100-119
Template-Type: ReDIF-Article 1.0
Author-Name: N. Sivarami Reddy
Author-X-Name-First: N. Sivarami
Author-X-Name-Last: Reddy
Author-Name: D.V. Ramamurthy
Author-X-Name-First: D.V.
Author-X-Name-Last: Ramamurthy
Author-Name: K. Prahlada Rao
Author-X-Name-First: K. Prahlada
Author-X-Name-Last: Rao
Author-Name: M. Padma Lalitha
Author-X-Name-First: M. Padma
Author-X-Name-Last: Lalitha
Title: Pragmatic simultaneous scheduling of machines, AGVs, tool transporter and tools in a multi machine FMS using flower pollination algorithm
Abstract:
This paper deals with machines, automated guided vehicles (AGVs), tool transporter (TT) and tools simultaneous scheduling in multi-machine flexible manufacturing system considering parts and tools transfer times for makespan minimisation. Only one copy of every tool type is made available due to economic restrictions and the tools are stored in central tool magazine that shares with and serves for several machines. TT and AGVs carry tools and jobs between machines. This simultaneous scheduling problem is highly complex in nature as it involves allocating tools, AGVs and associated trip operations including the dead heading and loaded trip times of both AGVs and TT to job-operations, job operations sequencing on machines. This paper presents nonlinear mixed integer programming formulation to model this problem and flower pollination algorithm (FPA) is employed to solve it. The results have been tabulated, analysed and compared. An industrial problem in manufacturing company is used for verification. [Received: 18 October 2020; Accepted: 26 May 2023]
Journal: European J. of Industrial Engineering
Pages: 728-771
Issue: 5
Volume: 18
Year: 2024
Keywords: flexible manufacturing systems; automated guided vehicles; AGVs; scheduling of jobs; TT and tools; optimisation techniques; flower pollination algorithm; FPA; makespan.
File-URL: http://www.inderscience.com/link.php?id=140763
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:5:p:728-771
Template-Type: ReDIF-Article 1.0
Author-Name: Bruno Jensen Virginio da Silva
Author-X-Name-First: Bruno Jensen Virginio da
Author-X-Name-Last: Silva
Author-Name: Reinaldo Morabito
Author-X-Name-First: Reinaldo
Author-X-Name-Last: Morabito
Title: Operations research applied to aerospace manufacturing and assembly: a survey
Abstract:
This paper presents an overview of operations research approaches applied to aerospace manufacturing and assembly. A survey was carried out in the main literature databases and 70 related works were found, revealing a notable growth in the number of papers in the 2010s. For the purposes of this study, aerospace industrial operations were classified into three main stages, namely manufacturing, structural and final assembly, and the papers, methods and results of each stage are presented and analysed, synthesising the main applications and techniques used. Finally, a conceptual diagram of this review is presented and a synthesis of opportunities is provided for future research in this industry. [Received: 31 January 2021; Accepted: 19 September 2022]
Journal: European J. of Industrial Engineering
Pages: 1-27
Issue: 1
Volume: 18
Year: 2024
Keywords: aerospace manufacturing and assembly; survey; operations research; aerospace industry; Industry 4.0.
File-URL: http://www.inderscience.com/link.php?id=135388
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:1:p:1-27
Template-Type: ReDIF-Article 1.0
Author-Name: Hokey Min
Author-X-Name-First: Hokey
Author-X-Name-Last: Min
Author-Name: Wen-Bin Yu
Author-X-Name-First: Wen-Bin
Author-X-Name-Last: Yu
Title: A multiple agent-based system for the intelligent demand planning of new products
Abstract:
New product development (NPD) is pivotal in the firm's innovation and organic growth. Despite its strategic importance to the firm's success, it poses many managerial challenges for the effective launch of new products due to the inherent difficulty in new product demand planning. Such difficulty stems from an absence of historical sales data, shortened product life cycles, and a rapid shift in today's consumer behaviours. To deal with those demand planning challenges, this paper aims to propose a multiple agent-based system (ABS) that can overcome the shortcomings of traditional demand forecasting tools and improve forecasting accuracy significantly through the inclusion of meaningful information available from both internal and external data sources. The proposed ABS incorporates causal information obtained from four different types of agents: the coordination agent, the task agent, the data collection agent, and the interface agent. Through a series of simulation experiments, we found that the ABS improved forecasting accuracy over the traditional forecasting methods in demand planning situations where only a limited amount of historical data is available in the early introductory stages of NPD. [Received: 11 August 2022; Accepted: 24 March 2023]
Journal: European J. of Industrial Engineering
Pages: 410-432
Issue: 3
Volume: 18
Year: 2024
Keywords: new product development; NPD; demand planning; agent-based system; ABS; simulation; business intelligence; predictive analytics.
File-URL: http://www.inderscience.com/link.php?id=138206
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:3:p:410-432
Template-Type: ReDIF-Article 1.0
Author-Name: Dipanjali Ghosh
Author-X-Name-First: Dipanjali
Author-X-Name-Last: Ghosh
Author-Name: Pinki Majumder
Author-X-Name-First: Pinki
Author-X-Name-Last: Majumder
Author-Name: Uttam Kumar Bera
Author-X-Name-First: Uttam Kumar
Author-X-Name-Last: Bera
Title: A fuzzy economic order quantity model on manufacturer-retailer considering delay in payments: a non-cooperative game theoretical approach
Abstract:
This study briefly explains the economic order quantity (EOQ) model under the fuzzy environment where a two-player non-zero-sum non-cooperative game is considered between manufacturer and retailer. Policies like trade credit are implemented and can be thought of as one type of 0% financing. Players chose to support the optimality conditions of Nash equilibrium. The main findings of the work are that under fuzzy environment, a mathematical model over profit summarisation concept has been constructed to minimise the cost of both players with the help of game theoretical approach. Different approaches have also been performed for comparative study to find out the befitting solution to the problem. The results indicate some important parameters in the present model which highly influence the optimal solution. Nonlinear optimisation technique-generalised reduced gradient (LINGO-13.0) is used to solve the problem and epitomised with some numerical data. [Received: 11 May 2022; Accepted: 9 November 2022]
Journal: European J. of Industrial Engineering
Pages: 120-156
Issue: 1
Volume: 18
Year: 2024
Keywords: supply chain management; SCM; Nash equilibrium; FEOQ; delay in payments; α-cut of hexagonal fuzzy number.
File-URL: http://www.inderscience.com/link.php?id=135391
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:1:p:120-156
Template-Type: ReDIF-Article 1.0
Author-Name: Haifa Nouira
Author-X-Name-First: Haifa
Author-X-Name-Last: Nouira
Author-Name: Adnen El-Amraoui
Author-X-Name-First: Adnen
Author-X-Name-Last: El-Amraoui
Author-Name: Sondes Hammami
Author-X-Name-First: Sondes
Author-X-Name-Last: Hammami
Author-Name: Gilles Goncalves
Author-X-Name-First: Gilles
Author-X-Name-Last: Goncalves
Author-Name: Hanen Bouchriha
Author-X-Name-First: Hanen
Author-X-Name-Last: Bouchriha
Title: A GVNS-based approach for periodic consumables delivery to home hemodialysis patients: a case study
Abstract:
The use of home hemodialysis (HHD) has the potential to lower healthcare costs while improving quality-adjusted survival and quality of patient's life. Nevertheless, the number of patients on this modality of dialysis remains low due to several barriers among which the problem of storage capacity. In fact, patients have a limited storage capacity in their homes, so they cannot store the required consumables (i.e., commodities) for long-term treatment sessions. Therefore, to promote HD use by dialysis patients, healthcare systems should offer flexible service that satisfies the patient's need in term of delivery frequency. Getting inspired by the periodic vehicle routing problem (PVRP), we develop here a mathematical formulation of the considered problem, and we propose a new approach based on the general variable neighbourhood search metaheuristic (GVNS) to solve it, due to its NP-hardness. To illustrate the effectiveness of the proposed approach, several tests have been performed. [Received: 9 August 2022; Accepted: 23 March 2023]
Journal: European J. of Industrial Engineering
Pages: 365-409
Issue: 3
Volume: 18
Year: 2024
Keywords: home dialysis care; periodic VRP; GVNS metaheuristic; visit frequency choice; cluster-first route-second heuristic approach.
File-URL: http://www.inderscience.com/link.php?id=138215
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:3:p:365-409
Template-Type: ReDIF-Article 1.0
Author-Name: Saba Aghighi
Author-X-Name-First: Saba
Author-X-Name-Last: Aghighi
Author-Name: Esmaeil Mehdizadeh
Author-X-Name-First: Esmaeil
Author-X-Name-Last: Mehdizadeh
Author-Name: Seyed Taghi Akhavan Niaki
Author-X-Name-First: Seyed Taghi Akhavan
Author-X-Name-Last: Niaki
Author-Name: Amir Abbas Najafi
Author-X-Name-First: Amir Abbas
Author-X-Name-Last: Najafi
Title: A bi-objective MILP model for an open-shop scheduling problem with reverse flows and sequence-dependent setup times
Abstract:
In this research, the scheduling problem of open-shop scheduling problem (OSSP) with sequence-dependent setup time (SDST) is investigated considering the reverse flow (assemble/disassemble flow on the same machines). The problem is formulated as a bi-objective mixed-integer linear programming (MILP) model. It involves reverse flows to minimise the completion time (C<SUB align="right"><SMALL>max</SMALL></SUB>) and total tardiness. Since the OSSP is an NP-hard problem, a vibration damping-based multi-objective optimisation algorithm (MOVDO) is employed to solve large test problems in a reasonable runtime. Analysing the results of this algorithm was compared to an Epsilon-constrained method, which produced similar results in small problem sizes. Additionally, this algorithm is compared to other multi-objective algorithms, such as MOACO, MO-Cuckoo search, and NSGA-II, in terms of its performance. Based on the performance of these algorithms, we show that the proposed MOVDO algorithm performs better than the other algorithms to solve this problem. Eventually, a case study is investigated to validate the mathematical model and demonstrate the application. Comparing the proposed model to the results in the real world, the proposed model shows an improvement. [Received: 3 August 2021; Accepted: 2 April 2023]
Journal: European J. of Industrial Engineering
Pages: 433-468
Issue: 3
Volume: 18
Year: 2024
Keywords: open-shop scheduling problem; OSSP; reverse flows; sequence-dependent setup times; SDST; vibration damping-based optimisation algorithm; MOVDO.
File-URL: http://www.inderscience.com/link.php?id=138222
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:eujine:v:18:y:2024:i:3:p:433-468