Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Serol Bulkan"'
Publikováno v:
Systems, Vol 12, Iss 7, p 260 (2024)
Efficient inventory management, including optimal safety-stock levels, is crucial for operational continuity and cost-effectiveness in various industries. This study seeks the optimal inventory management strategy to minimize costs and determine idea
Externí odkaz:
https://doaj.org/article/fbd2eddd66444633be096ce491fed94a
Publikováno v:
Systems, Vol 11, Iss 5, p 259 (2023)
The challenging idea of using drones in last-mile delivery systems of logistics addresses a new routing problem referred to as the traveling salesman problem with drone (TSP-D). TSP-D aims to construct a route to deliver parcels to a set of customers
Externí odkaz:
https://doaj.org/article/88b7dd528b5948db947e0c2355f0131c
Publikováno v:
Tehnički Vjesnik, Vol 28, Iss 3, Pp 786-795 (2021)
This study seeks to integrate Random Key Genetic Algorithm (RKGA) and Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) to compute makespan and solve the Flow Shop Scheduling Problem (FSSP). FSSP is considered as a Multi Crit
Externí odkaz:
https://doaj.org/article/c3ff8a71deae4add9305046b4524b666
Autor:
Mehmet Erdem, Serol Bulkan
Publikováno v:
South African Journal of Industrial Engineering, Vol 28, Iss 4, Pp 133-149 (2017)
The purpose of this study is to introduce a two-stage solution approach for a large-scale home healthcare routeing and scheduling problem (HHCRSP). In the first part of the two-stage solution approach, a cluster-assign algorithm is employed, based on
Externí odkaz:
https://doaj.org/article/5fa2a77bf9184ee78f1a66c047ba996e
Autor:
Baris Egemen Ozkan, Serol Bulkan
Publikováno v:
Systems Engineering. 25:224-241
The purpose of this study is to provide program managers and systems engineers with a novel algorithm in determining the design refresh time (DRT) of sustainment-dominated systems due to COTS obsolescence. Most of the research done so far has focused
Publikováno v:
Processes
Volume 11
Issue 2
Pages: 454
Volume 11
Issue 2
Pages: 454
In this paper, the no-wait flow shop problem with earliness and tardiness objectives is considered. The problem is proven to be NP-hard. Recent no-wait flow shop problem studies focused on familiar objectives, such as makespan, total flow time, and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81c4f284aeaac8d7f5820a2d26cbaa07
https://hdl.handle.net/11424/287434
https://hdl.handle.net/11424/287434
Publikováno v:
Havacılık ve Uzay Teknolojileri Dergisi, Vol 8, Iss 2, Pp 15-23 (2015)
Inventory control helps to manage or locate materials and any information through the processes in the company. The aim of the inventory management in the companies is to optimize inventory control. Especially, for the manufacturing companies, invent
Externí odkaz:
https://doaj.org/article/544b1f92568e49009dd9ba92f99ffd7e
Publikováno v:
Journal of Combinatorial Optimization. 43:785-817
Multiprocessor open shop makes a generalization to classical open shop by allowing parallel machines for the same task. Scheduling of this shop environment to minimize the makespan is a strongly NP-Hard problem. Despite its wide application areas in
Publikováno v:
Operational Research. 21:875-900
In this study, a new coordinated scheduling problem is proposed for the multi-stage supply chain network. A multi-product and multi-period supply chain structure has been developed, including a factory, warehouses, and customers. Furthermore, the fle
Publikováno v:
Journal of Combinatorial Optimization. 40:547-569
Multi-processor open shop (MPOS) is a combination of the classical open shop and parallel shop environments. Although there exist wide application areas of this shop environment in both production and service facilities, the research in the field is