74 results for "Shih-Wei Lin"
Showing 1–20 · 0.47 seconds · RSS
-
Journal Article Full text
Maximizing cohesion and separation for detecting protein functional modules in protein-protein interaction networks.
…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
-
Journal Article
Single machine scheduling problems with sequence-dependent setup times and precedence delays
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…
-
Journal Article
Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms
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…
-
Journal Article
Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan
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…
-
Journal Article Full text
Applying the Simulated Annealing Algorithm to the Set Orienteering Problem with Mandatory Visits
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…
-
Journal Article
Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop
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…
-
Journal Article
Incorporating a backward-forward stochastic particle tracking model into a hydraulic modeling framework to identify probable sedimentation sources during typhoons
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…
-
Journal Article
Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints
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…
-
Journal Article
Fuzzy Multi-Choice Goal Programming and Artificial Bee Colony Algorithm for Triangular and Trapezoidal Membership Functions
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…
-
Journal Article
Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
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…
-
Journal Article
Location-Routing Problem With Demand Range
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…
-
Journal Article Full text
Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
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…
-
Journal Article
Technical Note on (Q,r,L) Inventory Model with Defective Items
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.
-
Journal Article
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach
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…
-
Journal Article
Single Machine Job Sequencing With a Restricted Common Due Window
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)…
-
Journal Article
Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems
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…
-
Journal Article
A five-year longitudinal study of the relation between end-stage kidney disease as the outcomes
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…
-
Journal Article
Decreasing the System Testing Makespan in a Computer Manufacturing Company
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…
-
Journal Article Full text
Solving Aggregate Production Planning Problems: An Extended TOPSIS Approach
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…