Biblio Discovery — Demo Discovery Service

74 results for "Shih-Wei Lin"

Showing 1–20 · 0.47 seconds · RSS

  1. Journal Article Full text

    Maximizing cohesion and separation for detecting protein functional modules in protein-protein interaction networks.

    Kuo-Ching Ying; Shih-Wei Lin

    PLoS ONE, Vol. 15 No. 10 · 2020 · English · DOAJ Scopus

    …this study proposed a very effective and efficient model based on the Lin-Kernighan-Helsgaun algorithm for detecting PFMs in PPINs. To demonstrate the effectiveness and efficiency of the proposed model, computational experiments are performed using three different categories of species datasets…

    Also available at: PLOS

  2. Journal Article

    Single machine scheduling problems with sequence-dependent setup times and precedence delays

    Shih-Wei Lin; Kuo-Ching Ying

    Scientific Reports, Vol. 12 No. 1 · 2022 · English · DOAJ Scopus

    Abstract Sequence-dependent setup times and precedence delays occur frequently in various production environments. This study investigates the single machine scheduling problem with setup times and precedence delays that occur in an amplifier assembly company. This study proposes a novel…

  3. Journal Article

    Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms

    Kuo-Ching Ying; Shih-Wei Lin

    IEEE Access, Vol. 5 · 2017 · English · DOAJ Scopus

    This paper studies the distributed blocking flow shop scheduling problem (DBFSP) using metaheuristics. A mixed integer programming model for solving the problem is proposed, and then three versions of the hybrid iterated greedy algorithm (HIG1, HIG2, and HIG3) are developed, combining the…

  4. Journal Article

    Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan

    Shih-Wei Lin; Kuo-Ching Ying

    IEEE Access, Vol. 5 · 2017 · English · DOAJ Scopus

    This paper examines the uniform parallel-machine scheduling problem in which the objective aims to minimize the total resource consumption (TRC) with a bounded makespan. A matheuristic is proposed to deal with this strongly NP-hard problem. The performance of the proposed matheuristic is compared…

  5. Journal Article Full text

    Applying the Simulated Annealing Algorithm to the Set Orienteering Problem with Mandatory Visits

    Shih-Wei Lin; Sirui Guo; Wen-Jie Wu

    Mathematics, Vol. 12 No. 19 · 2024 · English · DOAJ Scopus

    This study addresses the set orienteering problem with mandatory visits (SOPMV), a variant of the team orienteering problem (SOP). In SOPMV, certain critical sets must be visited. The study began by formulating the mathematical model for SOPMV. To tackle the challenge of obtaining a feasible route…

  6. Journal Article

    Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop

    Shih-Wei Lin; Chung-Cheng Lu; Kuo-Ching Ying

    IEEE Access, Vol. 6 · 2018 · English · DOAJ Scopus

    This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of makespan and total weighted tardiness. The performance of the proposed CTIG algorithm is evaluated by comparing its…

  7. Journal Article

    Incorporating a backward-forward stochastic particle tracking model into a hydraulic modeling framework to identify probable sedimentation sources during typhoons

    Christina W. Tsai; Wen-Jia Liu; Shih-Wei Lin

    Journal of Hydrology: Regional Studies, Vol. 52 · 2024 · English · DOAJ Scopus

    Study region: Shih-men Reservoir, Taiwan Study focus: The primary purpose of this research is to integrate the novel backward-forward stochastic particle tracking model (BF-SPTM) into a three-dimensional sediment transport model for the Shih-men Reservoir. This integration aims to simulate the…

  8. Journal Article

    Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints

    Kuo-Ching Ying; Chung-Cheng Lu; Shih-Wei Lin

    IEEE Access, Vol. 6 · 2018 · English · DOAJ Scopus

    The no-wait flowshop scheduling problem with hard due date constraints is critical to operations in many industries, such as plastic, chemical, and pharmaceutical manufacturing. However, to date, there is a lack of effective optimization algorithms for this NP-hard problem. This paper develops a…

  9. Journal Article

    Fuzzy Multi-Choice Goal Programming and Artificial Bee Colony Algorithm for Triangular and Trapezoidal Membership Functions

    Ching-Ter Chang; Wen-Jie Wu; Shih-Wei Lin

    IEEE Access, Vol. 9 · 2021 · English · DOAJ Scopus

    Multi-choice goal programming (MCGP) has been widely used to find satisfying solutions for multiple criteria/objective decision problems in which the target value of “the more, the better,” or “the less, the better” can easily be obtained. This paper proposes two new models for representing the…

  10. Journal Article

    Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

    Shih-Wei Lin; Kuo-Ching Ying; Shu-Yen Wan

    The Scientific World Journal, Vol. 2014 · 2014 · English · DOAJ Scopus

    Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth…

  11. Journal Article

    Location-Routing Problem With Demand Range

    Vincent F. Yu; Panca Jodiawan; Yi-Hsuan Ho et al.

    IEEE Access, Vol. 7 · 2019 · English · DOAJ Scopus

    This research proposes a new variant of the location-routing problem (LRP) called LRP with Demand Range (LRPDR) by allowing flexibility in the delivery quantity. The goal of the LRPDR is to minimize the objective value calculated by the total cost minus the extra revenue. The total cost consists of…

  12. Journal Article Full text

    Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic

    Vincent F. Yu; Shih-Wei Lin; Panca Jodiawan et al.

    Mathematics, Vol. 11 No. 20 · 2023 · English · DOAJ Scopus

    This study investigates the flying sidekick traveling salesman problem (FSTSP), in which a truck and an unmanned aerial vehicle work together to make deliveries. This study develops a revised mixed-integer linear programming (MILP) model for the FSTSP. The revised MILP model performs better than…

  13. Journal Article

    Technical Note on (Q,r,L) Inventory Model with Defective Items

    Cheng-Tan Tung; Yu-Wen Wou; Shih-Wei Lin et al.

    Abstract and Applied Analysis, Vol. 2010 · 2010 · English · DOAJ Scopus

    Under a reasonable assumption, we derive an analytical approach that verifies uniqueness of the optimal solution for stochastic inventory models with defective items. Our approach implies a robust method to find the optimal solution.

  14. Journal Article

    Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach

    Chung-Cheng Lu; Shih-Wei Lin; Hui-Ju Chen et al.

    IEEE Access, Vol. 6 · 2018 · English · DOAJ Scopus

    This paper presents an optimization model for determining the optimal time-varying numbers of cashiers and pharmacists in a large hospital. The objective of this model is to minimize the weighted sum of the waiting cost incurred by patients and the operating costs incurred by the hospital. A…

  15. Journal Article

    Single Machine Job Sequencing With a Restricted Common Due Window

    Shih-Wei Lin; Kuo-Ching Ying; Wen-Jie Wu et al.

    IEEE Access, Vol. 7 · 2019 · English · DOAJ Scopus

    This article deals with the problem of sequencing $N$ jobs on a single machine with a restrictive common due window. The objective is to minimize the total weighted earliness-tardiness penalties, which conform to just-in-time (JIT) manufacturing. A novel backtracking simulated annealing (BSA)…

  16. Journal Article

    Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems

    Kuo-Ching Ying; Chen-Yang Cheng; Shih-Wei Lin et al.

    IEEE Access, Vol. 7 · 2019 · English · DOAJ Scopus

    This study evaluates various Mixed Integer Programming (MIP) formulations for solving single-machine and parallel-machine scheduling problems, with the objective of minimizing the total completion time and the makespan of jobs. Through extensive numerical study, the MIP formulation, which is…

  17. Journal Article

    A five-year longitudinal study of the relation between end-stage kidney disease as the outcomes

    Hsiu-Lan Li; Pei-Hui Tai; Yi-Ting Hwang et al.

    BMC Nephrology, Vol. 21 No. 1 · 2020 · English · DOAJ Scopus

    Abstract Background Patients with end-stage kidney disease (ESKD) are required to undergo consecutive time-based blood and biochemical tests to determine the progression of the disease according to changes in their blood and biochemical data. This study employed a random intercept model to…

  18. Journal Article

    Decreasing the System Testing Makespan in a Computer Manufacturing Company

    Shih-Wei Lin; Chien-Yi Huang; Kuo-Ching Ying et al.

    IEEE Access, Vol. 6 · 2018 · English · DOAJ Scopus

    This paper investigates the system testing scheduling problem (STSP), using one of the largest computer manufacturing companies in the world as a case study. A mixed integer linear programming (MILP) model and a restricted simulated annealing (RSA) heuristic which applies two rules to eliminate…

  19. Journal Article Full text

    Solving Aggregate Production Planning Problems: An Extended TOPSIS Approach

    Vincent F. Yu; Hsuan-Chih Kao; Fu-Yuan Chiang et al.

    Applied Sciences, Vol. 12 No. 14 · 2022 · English · DOAJ Scopus

    Aggregate production planning (APP) was developed for solving the problem of determining production, inventory, and workforce levels to meet fluctuating demand requirements over a planning horizon. In this work, multiple objectives were considered to determine the most effective means of satisfying…