Optimal Manufacturing Scheduling for Dependent Details Processing
The increasing competitiveness in manufacturing
industry is forcing manufacturers to seek effective processing
schedules. The paper presents an optimization manufacture
scheduling approach for dependent details processing with given
processing sequences and times on multiple machines. By defining
decision variables as start and end moments of details processing it is
possible to use straightforward variables restrictions to satisfy
different technological requirements and to formulate easy to
understand and solve optimization tasks for multiple numbers of
details and machines. A case study example is solved for seven base
moldings for CNC metalworking machines processed on five
different machines with given processing order among details and
machines and known processing time-s duration. As a result of linear
optimization task solution the optimal manufacturing schedule
minimizing the overall processing time is obtained. The
manufacturing schedule defines the moments of moldings delivery
thus minimizing storage costs and provides mounting due-time
satisfaction. The proposed optimization approach is based on real
manufacturing plant problem. Different processing schedules variants
for different technological restrictions were defined and implemented
in the practice of Bulgarian company RAIS Ltd. The proposed
approach could be generalized for other job shop scheduling
problems for different applications.
[1] M. Pinedo, Scheduling: Theory, Algorithms and Systems. Prentice Hall,
2001.
[2] D. Chen, P. B. Luh, L. S. Thakur and J. Moreno Jr., "Optimization-based
manufacturing scheduling with multiple resources, setup requirements,
and transfer lots", IIE Transactions, 35, 2003, pp. 973-985.
[3] S. J. Mason, P. Qu, E. Kutanoglu, J. W. Fowler, "The single machine
multiple orders per job scheduling problem", Available:
http://ie.fulton.asu.edu/files/shared/workingpapers/MOJ_Paper.pdf
[4] M. S. Akturk, J. B. Ghosh, E. D. Gunes, "Scheduling With Tool
Changes to Minimize Total Completion Time: A Study of Heuristics and
Their Performance", Naval Research Logistics, 50(1), 2003, pp. 15-30.
[5] S. C. Kim and P. M. Bobrowski, Impact of sequence-dependent setup
time on job shop scheduling performance. International Journal of
Production Research, 32(7), 1994, 1503-1520.
[6] I. M. Ovacik, and R. Uzsoy, "Rolling horizon algorithm for a
singlemachine dynamic scheduling problem with sequence-dependent
setup times", International Journal of Production Research", 32(6), 1994,
pp. 1243-1263.
[7] H. L. Young, K. Bhaskaran, and M. Pinedo, "A heuristic to minimize the
total weighted tardiness with sequence-dependent setups". IIE
Transactions, 29(1), 1997, pp. 45-52.
[8] J. Wang, P. B. Luh, X. Zhao and J. Wang, "An Optimization-Based
Algorithm for Job Shop Scheduling", Sadhana, vol. 22, 1997, pp. 241-
256.
[9] P. Baptiste; C. L. Pape, "Disjunctive constraints for manufacturing
scheduling: principles and extensions", International Journal of
Computer Integrated Manufacturing, 9(4), 1996, pp. 306-310.
[10] J. H. Blackstone, D. T. Phillips and G. L. Hogg, "A State-of-the-art
Survey of Dispatching Rules for Manufacturing Job Shop Operations,"
Int. J. Prod. Res., vol. 20, 1982, pp. 27-45.
[11] T. E. Morton and D. W. Pentico, Heuristic Scheduling Systems with
Applications to Production Systems and Project Management. Wiley,
New York, 1993
[12] S. Horn, G. Weigert, E. Beier, "Heuristic optimization strategies for
scheduling of manufacturing processes", Electronics Technology, ISSE
'06 29th International Spring Seminar on, 2006, 422-427.
[13] J. Adams, E. Balas and D. Zawack, "The Shifting Bottleneck Procedure
for Job Shop Scheduling," Management Science, 34(3), 1988, pp. 391-
401.
[14] Lindo Systems Inc., http://www.lindo.com.
[1] M. Pinedo, Scheduling: Theory, Algorithms and Systems. Prentice Hall,
2001.
[2] D. Chen, P. B. Luh, L. S. Thakur and J. Moreno Jr., "Optimization-based
manufacturing scheduling with multiple resources, setup requirements,
and transfer lots", IIE Transactions, 35, 2003, pp. 973-985.
[3] S. J. Mason, P. Qu, E. Kutanoglu, J. W. Fowler, "The single machine
multiple orders per job scheduling problem", Available:
http://ie.fulton.asu.edu/files/shared/workingpapers/MOJ_Paper.pdf
[4] M. S. Akturk, J. B. Ghosh, E. D. Gunes, "Scheduling With Tool
Changes to Minimize Total Completion Time: A Study of Heuristics and
Their Performance", Naval Research Logistics, 50(1), 2003, pp. 15-30.
[5] S. C. Kim and P. M. Bobrowski, Impact of sequence-dependent setup
time on job shop scheduling performance. International Journal of
Production Research, 32(7), 1994, 1503-1520.
[6] I. M. Ovacik, and R. Uzsoy, "Rolling horizon algorithm for a
singlemachine dynamic scheduling problem with sequence-dependent
setup times", International Journal of Production Research", 32(6), 1994,
pp. 1243-1263.
[7] H. L. Young, K. Bhaskaran, and M. Pinedo, "A heuristic to minimize the
total weighted tardiness with sequence-dependent setups". IIE
Transactions, 29(1), 1997, pp. 45-52.
[8] J. Wang, P. B. Luh, X. Zhao and J. Wang, "An Optimization-Based
Algorithm for Job Shop Scheduling", Sadhana, vol. 22, 1997, pp. 241-
256.
[9] P. Baptiste; C. L. Pape, "Disjunctive constraints for manufacturing
scheduling: principles and extensions", International Journal of
Computer Integrated Manufacturing, 9(4), 1996, pp. 306-310.
[10] J. H. Blackstone, D. T. Phillips and G. L. Hogg, "A State-of-the-art
Survey of Dispatching Rules for Manufacturing Job Shop Operations,"
Int. J. Prod. Res., vol. 20, 1982, pp. 27-45.
[11] T. E. Morton and D. W. Pentico, Heuristic Scheduling Systems with
Applications to Production Systems and Project Management. Wiley,
New York, 1993
[12] S. Horn, G. Weigert, E. Beier, "Heuristic optimization strategies for
scheduling of manufacturing processes", Electronics Technology, ISSE
'06 29th International Spring Seminar on, 2006, 422-427.
[13] J. Adams, E. Balas and D. Zawack, "The Shifting Bottleneck Procedure
for Job Shop Scheduling," Management Science, 34(3), 1988, pp. 391-
401.
[14] Lindo Systems Inc., http://www.lindo.com.
@article{"International Journal of Mechanical, Industrial and Aerospace Sciences:49981", author = "Ivan C. Mustakerov and Daniela I. Borissova", title = "Optimal Manufacturing Scheduling for Dependent Details Processing", abstract = "The increasing competitiveness in manufacturing
industry is forcing manufacturers to seek effective processing
schedules. The paper presents an optimization manufacture
scheduling approach for dependent details processing with given
processing sequences and times on multiple machines. By defining
decision variables as start and end moments of details processing it is
possible to use straightforward variables restrictions to satisfy
different technological requirements and to formulate easy to
understand and solve optimization tasks for multiple numbers of
details and machines. A case study example is solved for seven base
moldings for CNC metalworking machines processed on five
different machines with given processing order among details and
machines and known processing time-s duration. As a result of linear
optimization task solution the optimal manufacturing schedule
minimizing the overall processing time is obtained. The
manufacturing schedule defines the moments of moldings delivery
thus minimizing storage costs and provides mounting due-time
satisfaction. The proposed optimization approach is based on real
manufacturing plant problem. Different processing schedules variants
for different technological restrictions were defined and implemented
in the practice of Bulgarian company RAIS Ltd. The proposed
approach could be generalized for other job shop scheduling
problems for different applications.", keywords = "Optimal manufacturing scheduling, linear
programming, metalworking machines production, dependant details
processing.", volume = "2", number = "11", pages = "1194-5", }