Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Wei-Chang Yeh
Information about the author Wei-Chang Yeh will soon be added to the site.
Found
10 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Uniform parallel‐machine scheduling to minimize makespan with position‐based learning curves
2012
Scheduling with learning effects has become a popular topic in the past decade;...
Simplified swarm optimization in disassembly sequencing problems with learning effects
2012
In classical disassembly sequencing problems (DSPs), the disassembly time of each item...
A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability
2008
The weighted multicommodity multistate unreliable network (WMMUN) is a novel network...
An improved algorithm for searching all minimal cuts in modified networks
2008
A modified network is an updated network after inserting a branch string (a special...
A new approach to evaluate reliability of multistate networks under the cost constraint
2005
A multistate network is a system composed of multistate components. The network...
A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan and total flowtime
2004
This paper addresses the three-machine flowshop scheduling problem with a bicriteria...
Multistate network reliability evaluation under the maintenance cost constraint
2004
Many real-world systems (such as electric power, transportation, etc.) are multistate...
Search for all d-Mincuts of a limited-flow network
2002
In this presentation, we developed an intuitive algorithm based on some simple...
Search for minimal cuts in modified networks
2001
In this paper, first we develop an intuitive algorithm using the shortest path based...
A new branch-and-bound approach for the n/2/flowshop/αF + βCmax flowshop scheduling problem
1999
In this study, a special situation involving a computationally difficult flowshop...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers