Forward recursive scheme with improved marginal analysis heuristic for machine expansion scheduling in a new job shop

Authors:
Ming-Guan Huang;Pao-Long Chang;Ying-Chyi Chou
Affiliations:
Department of Finance and Banking, Shih Chien University, Taipei, Taiwan, ROC;Institute of Business and Management, National Chiao Tung University, Taiwan, ROC;Department of Business Administration, Tunghai University, Taiwan, ROC
Venue:
Computers and Industrial Engineering
Year:
2006

Citing 4
Cited 0

Optimal server allocation in a system of multi-server stations

Management Science
On server allocation in multiple center manufacturing systems

Operations Research
On the optimal allocation of servers and workloads in closed queueing networks

Operations Research
Dynamic Portfolio Selection of NPD Programs Using Marginal Returns

Management Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study attempts to develop a method of machine expansion scheduling which determines how many machines should be purchased and allocated to every workstation during each period within the prescheduled ramp-up planning horizon in a new job shop to meet expected performance targets and minimize investment in machinery. This study suggests using the forward recursive scheme associated with marginal analysis heuristic, which itself is characterized by inherent simplicity and broad applicability, to solve the intricate problems of machine expansion scheduling. Furthermore, this study improves the marginal analysis heuristic, meaning that the algorithm incorporates an additional refining procedure to increase the possibility of achieving a solution close to the real optimum. Finally, this study used production data from an actual semiconductor manufacturer as an example to illustrate the proposed analytic algorithm.