#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2005

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Saowanee Lertworasirikul, Peerayuth Charnsethikul, Shu-Cherng Fang
- Computers & Industrial Engineering
- 2011

- Sirirat Muenvanichakul, Peerayuth Charnsethikul
- 2007

This paper presents an algorithm combining dynamic programming (DP), benders decomposition and metaheuristics for solving a dynamic facility layout problem. The problem is proposed as an extended model of quadratic assignment problem (QAP) called the dynamic quadratic assignment problem (DQAP). Solving for an optimal solution is extremely diff icult since… (More)

In this paper, a squared-Euclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking… (More)

Problem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is… (More)

- Seekharin Sukto, Peerayuth Charnsethikul, Peerayuth Charnsethikul

This paper presents an optimization based heuristic for minimizing makespan on scheduling of n job-groups with qi as the number of identical jobs, pi as the processing time, sui as the setup time required and ddi as the due date, in job-group i through a set of m identical parallel machines. This heuristic, referred as LSCCG, is based on LS (ListScheduling)… (More)

- Chanin Srisuwannapa, Peerayuth Charnsethikul, Daniel Solow
- 2005

A coordinate transformation is proposed to improve the efficiency of the simplex algorithm for solving linear programming problems, and is based on a geometric explanation of phase I to then create a coordinate system whose origin is geometrically close to the optimal solution. Computer simulations on randomly generated and real-world problems are used to e… (More)

This study proposes an algorithm capable of working in parallel for solving large and sparse linear equations under given right hand side (RHS) ranges. A comparative study to the direct linear programming method is reported theoretically, computationally and discussed. Moreover, the approach can be adapted for the system under domain decompositions… (More)

- Somsakaya Thammaniwit, Peerayuth Charnsethikul
- 2013

A R T I C L E I N F O A B S T RA C T Article history: Received 23 August 2012 Received in revised form 19 December 2012 Accepted 16 January 2013 Available online 24 January 2013

- Parthana Parthanadee, Jirachai Buddhakulsomsiri, Peerayuth Charnsethikul
- Computers & Industrial Engineering
- 2012