Yao Ming-Jong

Ming-Jong Yao

Information about the author Ming-Jong Yao will soon be added to the site.
Found 12 papers in total
A new comparative scenario for supply chains using common replenishment epochs
2009
In this paper, we propose a new cooperative scenario for supply chains using common...
A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements
2007
In a supply chain, it is an important issue for logistic managers to offset the...
A mutually beneficial coordination mechanism for a one-supplier multi-retailers supply chain
2007
In this study, we investigate devising a mutually beneficial coordination mechanism...
Solving the economic lot scheduling problem with deteriorating items using genetic algorithms
2005
The focus of this study is to solve the Economic Lot Scheduling Problem (ELSP) with...
A new algorithm for one-warehouse multi-retailer systems under stationary nested policy
2006
This study aims at optimally coordinating inventory among all the partners in a supply...
On a replenishment coordination model in an integrated supply chain with one vendor and multiple buyers
2004
In this paper, we consider an integrated supply chain model in which one vendor...
The economic lot scheduling problem without capacity constraints
2005
This study presents a comprehensive analysis on the Economic Lot Scheduling Problem...
A global optimum search algorithm for the joint replenishment problem under power-of-two policy
2003
In this study, we perform theoretical analysis and derive a global optimum search...
The economic lot scheduling problem under power-of-two policy
2001
We present further analysis on the economic lot scheduling problem (ELSP) without...
The peak load minimization problem in cyclic production
2001
The objective of this study is to determine a production schedule for a set of jobs so...
Chance-constrained programming in activity networks: A critical evaluation
2001
We review the chance-constrained programming (CCP) model for event realization in...
Papers per page: