Study on the Scheduling Problem of Powder Painting Production - A Case Study

Abstract:

Article Preview

A large-scale powder-painting scheduling problem is explored. The purpose is to find out the optimal sequence of a number of batches that dynamically arrive from upstream processes within a given scheduling horizon. The objective is to enhance the production efficiency and decrease the production cost as well. To solve this problem, a mixed integer nonlinear programming (MINLP) model is constructed and an algorithm called greedy randomized adaptive search procedure (GRASP) is designed. Case studies demonstrate that the proposed approach can improve the production performance significantly.

Info:

Periodical:

Advanced Materials Research (Volumes 97-101)

Edited by:

Zhengyi Jiang and Chunliang Zhang

Pages:

2459-2464

DOI:

10.4028/www.scientific.net/AMR.97-101.2459

Citation:

Z. Y. Hu et al., "Study on the Scheduling Problem of Powder Painting Production - A Case Study", Advanced Materials Research, Vols. 97-101, pp. 2459-2464, 2010

Online since:

March 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.