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

Zhang Yong Hu; Qiang Su; Jun Liu; Hai Xia Yang

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

Paper Titles

Filtered Beam Search Based Flexible Job Shop Scheduling Problem with Transportation Time
p.2440

A Symbolic OBDD-Based Algorithm for Assembly Sequence Planning
p.2444

An Improved Genetic Algorithm for Multi-Objective Flexible Job-Shop Scheduling Problem
p.2449

Optimization of Printed Circuit Board Assignment and Component Allocation in Assembly Line
p.2455

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

An Optimization Approach for Semiconductor Wafer Fabrication Scheduling Problem
p.2465

Modeling and Simulation of Re-Entrant Semiconductor Wafer Fabrication Lines with PM Using GSPN
p.2469

Improved Adaptive Genetic Algorithms for Job Shop Scheduling Problems
p.2473

A New NURBS Tool Path Generation Algorithm for Precise Sculptured Surface Machining
p.2477

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 97-101Study on the Scheduling Problem of Powder Painting...

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

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 97-101)

Pages:

2459-2464

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.97-101.2459

Citation:

Cite this paper

Online since:

March 2010

Authors:

Zhang Yong Hu, Qiang Su, Jun Liu, Hai Xia Yang

Keywords:

Optimisation Algorithm, Production Capacity, Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] L. X. Tang, X. P. Wang. Int J Adv Manuf Technol, 2008, 35: 633-645.

Google Scholar

[2] L. X. Tang, X. P. Wang, and J. Y. Liu. IEEE transaction on automation science and engineering, 2008, 5: 544-549.

Google Scholar

[3] L. Tang, X. Wang. European Journal of Operational Research, 2009, 198: 715-725.

Google Scholar

[4] H. Okano, T. Morioka, K. Yoda, A heuristic solution for the continuous galvanizing line scheduling problem. Research Report RT-0478, 2002: IBM Tokyo Research Laboratory, 1623-14 Shimo-tsuruma, Yamato-shi, Kanagawa-ken 242-8502, Japan.

Google Scholar

[5] S. R. Gupta, J. S. Smith. European Journal of Operational Research, 2006, 175: 722-739.

Google Scholar

[6] M.G. Resende, C.C. Ribeiro. Chapter 8: Greedy randomized adaptive search procedures, in: F.W. Glover, G.A. Kochenberger (Eds. ). Handbook of Metaheuristics, International Series in Operations Research and Management Science, Kluwer Academic Publishers, 2002, 57.

DOI: 10.1007/0-306-48056-5_8

Google Scholar

[7] Débora P. Ronconi, Luís R.S. Omega, 2009, 37: 272 - 281.

Google Scholar