Study on the Scheduling Problem of Powder Painting Production - A Case Study
2010 ◽
Vol 97-101
◽
pp. 2459-2464
Keyword(s):
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.
2017 ◽
Vol 2648
(1)
◽
pp. 86-95
◽
1996 ◽
Vol 47
(12)
◽
pp. 1433-1442
◽
2012 ◽
Vol 2012
◽
pp. 1-18
◽
2013 ◽
Vol 1
(8)
◽
pp. 1003-1014
◽
Keyword(s):
2016 ◽
Vol 11
(4)
◽
pp. 194
◽