IP Library › Granted Patent US 12,265,381
Granted Patent B1
US 12,265,381 · App. 17/479,021 · Granted Apr 1, 2025

Controlling operation of machine tools using combinatorial optimization problem solvers

Inventors: Michael L. George, Sr. (Dallas, TX); Michael George, Jr. (Dallas, TX)
Assignee: AI Technologies
G05B19/4188G05B2219/40336
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,265,381
App. No.
17/479,021
Granted
Apr 1, 2025
Kind
B1
Abstract

Methods, systems and apparatus, including computer programs encoded on computer storage medium, for processing parts using machine tool workstations. The machine tool workstations are grouped into multiple groups, where each group includes workstations of the same type. For each of the multiple groups, data representing parts to be processed by the type of workstations included in the group are transmitted to a combinatorial optimization problem solver. Data representing a sequence of ordered subsets of the multiple parts that produce a reduced setup time for the workstations in the group are received from the solver. An average delay time associated with the generated sequence of ordered subsets of the collection of parts is computed. If the average delay time is less than the predetermined threshold, parts are released according to the generated sequence of ordered subsets of the collection of parts to the group for processing.

Claims (40)

1. A method comprising:

grouping, by one or more computers that are in data communication with a collection of machine tool workstations that are used to process a plurality of parts, the plurality of machine tool workstations into multiple functional groups, wherein each functional group includes machine tool workstations of the same type;

for each of the multiple functional groups:

transmitting, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, and to a combinatorial optimization problem solver, data representing multiple parts to be processed by the type of workstations included in the functional group;

receiving, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, and from the combinatorial optimization problem solver, data representing a sequence of ordered subsets of the multiple parts that, when processed by the functional group, produces a reduced set up time for the workstations in the functional group;

computing, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, an average delay time associated with the generated sequence of ordered subsets of the multiple parts;

determining, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, whether the average delay time is less than a predetermined threshold;

in response to determining that the average delay time is less than the predetermined threshold, releasing, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, parts according to the generated sequence of ordered subsets of the multiple parts to machine tool workstations in the functional group for processing; and

processing, by the machine tool workstations in the functional group that are in data communication with the one or more computers, the released parts according to the generated sequence of ordered subsets of the multiple parts to generate processed parts.

2. A system comprising:

a collection of machine tool workstations used to process a plurality of parts;

one or more computers in data communication with the collection of machine tool workstations;

a computer-readable medium coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, cause the one or more computers to perform operations comprising:

grouping the collection of machine tool workstations into multiple functional groups, wherein each functional group includes workstations of the same type;

for each of the multiple functional groups:

transmitting, to a combinatorial optimization problem solver, data representing multiple parts to be processed by the type of workstations included in the functional group;

receiving, from the combinatorial optimization problem solver, data representing a sequence of ordered subsets of the multiple parts that, when processed by the functional group, produces a reduced set up time for the workstations in the functional group;

computing an average delay time associated with the generated sequence of ordered subsets of the multiple parts;

determining whether the average delay time is less than a predetermined threshold;

in response to determining that the average delay time is less than the predetermined threshold, releasing parts according to the generated sequence of ordered subsets of the multiple parts to the functional group for processing.

3. The system of claim 2 , wherein the plurality of machine tool workstations comprise one or more of (i) cutting tools, (ii) drilling machines, (iii) lathes, (iv) boring machines, or (v) grinding machines.

4. The system of claim 2 , wherein each workstation is associated with a set of performance parameters, the set comprising workstation setup time and part delivery time.

5. The system of claim 2 , wherein workstations of a same type comprise workstations with a common Kanban inventory.

6. The system of claim 2 , wherein each functional group is configured to receive a constrained number of days of work in progress per batch of parts, wherein the number of days depends on an average setup and machining time per part over each workstation in the functional group.

7. The system of claim 6 , wherein a number of the multiple functional groups is dependent on computational capabilities of the combinatorial optimization problem solver and properties of the plurality of machine tool workstations.

8. The system of claim 7 , wherein properties of the plurality of machine tool workstations comprise one or more of (i) location of machine tool workstation, (ii) an acceptable uninterrupted machine tool workstation runtime.

9. The system of claim 2 , wherein the combinatorial optimization problem solver is configured to solve travelling salesman problems.

10. The system of claim 2 , wherein the combinatorial optimization problem solver is configured to implement a cutting-plane method.

11. The system of claim 2 , wherein the method further comprises selecting, based on the data representing the multiple parts to be processed by the type of workstations included in the functional group, the combinatorial optimization problem solver from multiple available combinatorial optimization problem solvers and transmitting the data representing the multiple parts to be processed by the type of workstations included in the functional group to the selected combinatorial optimization problem solver.

12. The system of claim 2 , wherein the size of the ordered subsets is dependent on acceptable uninterrupted machine tool workstation runtimes.

13. The system of claim 2 , wherein releasing parts according to the generated sequence of ordered subsets of the multiple parts to the functional group for processing generates processed parts, and wherein the method further comprises routing one or more subsets of the processed parts to other functional groups for further processing.

14. The system of claim 2 , wherein determining the average delay time comprises applying Little's Law.

15. The system of claim 2 , wherein determining whether the average delay time is less than a predetermined threshold comprises:

computing a standard deviation of delay time;

adding a multiple of the computed standard deviation to the computed average delay time to generate an adjusted average delay time; and

determining whether the adjusted average delay time is less than the predetermined threshold.

16. The system of claim 2 , further comprising, in response to determining that the average delay time exceeds the predetermined threshold:

iteratively reducing the size of the ordered subsets in the generated sequence of ordered subsets until the average delay time is less than the predetermined threshold.

17. The system of claim 2 , wherein the subset size is equal to one, and wherein the method further comprises releasing a random sequence of parts to next available machine tool workstations.

18. One or more non-transitory computer-readable media storing instructions that, when executed by one or more computers that are in data communication with a collection of machine tools that are used to process a plurality of parts, cause the one or more computers that are in data communication with the collection of machine tools that are used to process the plurality of parts to perform operations comprising: grouping, by the one or more computers that are in data communication with a collection of machine tool workstations that are used to process a plurality of parts, the plurality of machine tool workstations into multiple functional groups, wherein each functional group includes machine tool workstations of the same type; for each of the multiple functional groups: transmitting, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, and to a combinatorial optimization problem solver, data representing multiple parts to be processed by the type of workstations included in the functional group; receiving, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, and from the combinatorial optimization problem solver, data representing a sequence of ordered subsets of the multiple parts that, when processed by the functional group, produces a reduced set up time for the workstations in the functional group; computing, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, an average delay time associated with the generated sequence of ordered subsets of the multiple parts; determining, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, whether the average delay time is less than a predetermined threshold; and in response to determining that the average delay time is less than the predetermined threshold, releasing, by the one or more computers that are in data communication with the collection of the machine tool workstations that are used to process the plurality of parts, parts according to the generated sequence of ordered subsets of the multiple parts to machine tool workstations in the functional group for processing.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 6, 2022
From: AI TECHNOLOGIES, INC.
To: ON-TIME.AI, INC.
Reel/Frame 059835/0718 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 20, 2021
From: GEORGE, MICHAEL L., SR.; GEORGE, MICHAEL, JR
To: AI TECHNOLOGIES
Reel/Frame 057527/0159 →
Continuity (2)
Continuation In Part 16686529 · Nov 18, 2019
Provisional Application 62768267 · Nov 16, 2018
References Cited (133)
US 3845286A · Aronstein et al. · 1974 [cited by applicant]
US 3891836A · Lee · 1975 [cited by applicant]
US 4058711A · Ondercin et al. · 1977 [cited by applicant]
US 4628434A · Tashiro et al. · 1986 [cited by applicant]
US 4644480A · Haruna et al. · 1987 [cited by applicant]
US 4729105A · Thompson et al. · 1988 [cited by applicant]
US 4796194A · Atherton · 1989 [cited by applicant]
US 4802094A · Nakamura et al. · 1989 [cited by applicant]
US 4896269A · Tong · 1990 [cited by applicant]
US 4975827A · Yonezawa · 1990 [cited by applicant]
US 5195041A · George et al. · 1993 [cited by applicant]
US 5216593A · Dietrich et al. · 1993 [cited by applicant]
US 5231567A · Matoba et al. · 1993 [cited by applicant]
US 5280425A · Hogge · 1994 [cited by applicant]
US 5351195A · Sherman · 1994 [cited by applicant]
US 5432887A · Khaw · 1995 [cited by applicant]
US 5495430A · Matsunari et al. · 1996 [cited by applicant]
US 5819232A · Shipman · 1998 [cited by applicant]
US 5838568A · Dickinson et al. · 1998 [cited by applicant]
US 6038540A · Krist et al. · 2000 [cited by applicant]
US 6272483B1 · Joslin · 2001 [cited by examiner]
US 6633791B1 · Lo et al. · 2003 [cited by applicant]
US 6725183B1 · Cawse · 2004 [cited by applicant]
US 6993492B2 · George et al. · 2006 [cited by applicant]
US 7127310B1 · Barto et al. · 2006 [cited by applicant]
US 7415421B2 · Tu et al. · 2008 [cited by applicant]
US 7489990B2 · Fehr et al. · 2009 [cited by applicant]
US 7657451B2 · Dubois et al. · 2010 [cited by applicant]
US 8069122B2 · George · 2011 [cited by applicant]
US 8229691B2 · Behm et al. · 2012 [cited by applicant]
US 10054929B1 · George · 2018 [cited by examiner]
US 11366457B1 · George, Sr. et al. · 2022 [cited by applicant]
US 11456212B2 · Clark et al. · 2022 [cited by applicant]
US 11853043B1 · George, Sr. et al. · 2023 [cited by applicant]
US 20020026257A1 · Newmark · 2002 [cited by applicant]
US 20020198629A1 · Ellis · 2002 [cited by applicant]
US 20030014225A1 · De Vicente · 2003 [cited by applicant]
US 20030033040A1 · Billings · 2003 [cited by applicant]
US 20030204278A1 · Grasshoff et al. · 2003 [cited by applicant]
US 20030216819A1 · Yasuda · 2003 [cited by applicant]
US 20040153187A1 · Knight · 2004 [cited by examiner]
US 20040158338A1 · Mammoser et al. · 2004 [cited by applicant]
US 20040181498A1 · Kothare et al. · 2004 [cited by applicant]
US 20040186605A1 · Wu · 2004 [cited by examiner]
US 20040260592A1 · George · 2004 [cited by examiner]
US 20050154625A1 · Chua et al. · 2005 [cited by applicant]
US 20050177260A1 · Schweizerhof et al. · 2005 [cited by applicant]
US 20050209941A1 · Hsu et al. · 2005 [cited by applicant]
US 20050222867A1 · Underwood et al. · 2005 [cited by applicant]
US 20050234579A1 · Asmundsson · 2005 [cited by examiner]
US 20050262977A1 · Wilkerson · 2005 [cited by examiner]
US 20050273305A1 · Thalhammer-Reyero · 2005 [cited by applicant]
US 20060031048A1 · Gilpin et al. · 2006 [cited by applicant]
US 20060100890A1 · Macy et al. · 2006 [cited by applicant]
US 20060106477A1 · Miyashita · 2006 [cited by applicant]
US 20060136282A1 · Furin et al. · 2006 [cited by applicant]
US 20060136461A1 · Lee et al. · 2006 [cited by applicant]
US 20060242005A1 · Rodrigue et al. · 2006 [cited by applicant]
US 20060259163A1 · Hsiung et al. · 2006 [cited by applicant]
US 20070100486A1 · Burda et al. · 2007 [cited by applicant]
US 20070116215A1 · George et al. · 2007 [cited by applicant]
US 20080015871A1 · Eder · 2008 [cited by applicant]
US 20080235067A1 · George · 2008 [cited by applicant]
US 20090099887A1 · Sklar et al. · 2009 [cited by applicant]
US 20090112350A1 · Yuan et al. · 2009 [cited by applicant]
US 20090157569A1 · Henby et al. · 2009 [cited by applicant]
US 20090228408A1 · Kaushal et al. · 2009 [cited by applicant]
US 20100003645A1 · Hathaway · 2010 [cited by applicant]
US 20100049592A1 · Alderman et al. · 2010 [cited by applicant]
US 20100191581A1 · Furin et al. · 2010 [cited by applicant]
US 20100249974A1 · Fei et al. · 2010 [cited by applicant]
US 20110213715A1 · George et al. · 2011 [cited by applicant]
US 20110246257A1 · Meade · 2011 [cited by applicant]
US 20120123583A1 · Hazen et al. · 2012 [cited by applicant]
US 20150127480A1 · Herrman · 2015 [cited by examiner]
US 20150347949A1 · Dwyer et al. · 2015 [cited by applicant]
US 20190278878A1 · Sawyer et al. · 2019 [cited by applicant]
CN 101065742A · 2007 [cited by examiner]
CN 103049330 · 2015 [cited by applicant]
CN 107862411A · 2018 [cited by examiner]
JP H05204891 · 1993 [cited by applicant]
JP 2005339587 · 2005 [cited by applicant]
JP 2009223785A · 2009 [cited by examiner]
JP 2011221887A · 2011 [cited by examiner]
SU 930320 · 1982 [cited by applicant]
Kumar et al. (“Literature review of JIT-KANBAN system”, Int J Adv Manuf Technol, Mar. 22, 2006, p. 393-408) (Year: 2006). [cited by examiner]
Min et al. (CN-100580594-C, Jan. 2010, p. 1-16.) (Year: 2010). [cited by examiner]
Blazewicz, et al., “The job shop scheduling problem: Conventional and new solution techniques,” Eur. J. Operational Res., 1996, 93:1-33. [cited by applicant]
Graham, et al., “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, 1979, 5:287-326. [cited by applicant]
Liker, “Benefits of One-Piece Flow,” The Toyota Way, McGraw-Hill, 2004, 3 pages. [cited by applicant]
Nielsen, “Neural Networks and Deep Learning,” Determination Press, 2015. [cited by applicant]
Zhang et al., “Fuzzy neural network-based rescheduling decision mechanism for semiconductor manufacturing”, 2014, Elsevier, p. 1115-1125. (Year: 2014). [cited by applicant]
Kuo et al., Manufacturing Intelligence to Exploit the Value of Production and Tool Data to Reduce Cycle Time, IEEE, Jan. 2011, p. 103-111. (Year: 2011). [cited by applicant]
Lenz, “Analysis of Low Inventory Manufacturing using MIM”, IEEE, 1988, p. 667-670. (Year: 1988). [cited by applicant]
U.S. Appl. No. 60/438,906, filed Jan. 9, 2003, Rodrigue et al. [cited by applicant]
“Control chart”, retrieved from https://en.wikipedia.org/wiki/Control_chart on Apr. 25, 2016. [cited by applicant]
A.M. Tsirlin, Vladimir Kaskov and N.A. Kolinko Program System Institute, Russion Academy of Science; Jun. 16, 2003; [email protected]; [email protected]; Titled: A minimal dissipation type based classific… [cited by applicant]
AC 2007-711; Instructional Strategies And Tools To Teach Six Sigma To Engineering Technology Undergraduate Students [PDF] from usm.eduS Furterer—2007—ice.usm.edu. [cited by applicant]
Anupindi, Ravi, et al., Managing Business Process Flows, Principles of Operations Management, © 2006, 1999. Pearson Education, Inc. Upper Saddle River, NJ, p. 50. [cited by applicant]
Application of DMAIC to integrate Lean Manufacturing and Six Sigma [PDF] from vt.edu P Stephen—2004—scholar.lib.vt.edu. [cited by applicant]
Bao, Han P., Samarch, J.A., “Affordable Design: A methodology to implement process-based manufacturing cost models into the traditional performance-focused multidisciplinary design optimization,” American Institute of A… [cited by applicant]
Campolongo, et al. “An effective screening design for sensitivity analysis of large models” Environmental Modelling & Software 22 (2007) pp. 1509-1518. [cited by applicant]
Caramanis, Michael C., Anli, Osman M., “Dynamic Lead Time Modeling for JIT Production Planning,” Proceedings of the 1999 IEEE International Conference on Robotics 7 Automation, Detroit Michigan 1999, pp. 1450-1455. [cited by applicant]
Caramanis, Michael C., Pan, Haidong, Anli, Osman M., A Closed-Loop Approach to Efficient and Stable Supply-Chain Coordination in Complex Stochastic Manufacturing Systems Proceedings of the American Control Conference, A… [cited by applicant]
Chase, Richard BI., et al., Production and Operations Management, Manufacturing and Services, Eighth Edition, © 1998, pp. 590-591, Irwin McGraw-Hill, United States of America. [cited by applicant]
Darlington, Jon, “Lean thinking and mass customization: The relationship between product and costs,” Management Accounting, vol. 77, No. 10, Nov. 1999, pp. 18-21. [cited by applicant]
Dobson, G., et al. “Batching to Minimize Flow times on One Machine”, Management Science, Jun. 1987, vol. 33, No. 6, pp. 784-799. [cited by applicant]
E.W. Piotrowski and J. Sladkowski; Titled: The Thermodynamics of Portfolios; Institute of Theoretical Physics, University of Bialystok; [email protected]; [email protected]; 8 pages. [cited by applicant]
Hermann, Jeffrey W., Chincholkar, Mandar M., “Reducing Throughput Time during Product Design Institute for Systems Research,” University of Maryland, Aug. 13, 2001, pp. 1-25. [cited by applicant]
Hermann, Jeffrey, Chincholkar, Mandar M., “Design For Production: A tool for reducing manufacturing cycle time,” Proceedings of DETC 2000, 2000 ASME Design Engineering Technical Conference, Baltimore Maryland, pp. 1-10. [cited by applicant]
Hines, Peter, Rich, Nick, “The seven value stream mapping tools,” International Journal of Operations & Production Management, vol. 17, Issue 1, Nov. 19979. [cited by applicant]
Hoehn, William K., “Robust Designs Through Design to Six Sigma Manufacturability,” 1995 Engineering Management Conference, IEEE 1995, pp. 241-246. [cited by applicant]
How to scope DMAIC projects [PDF] from topcities.com DP Lynch, S Bertolino . . .—quality Progress, 2003-jpm2002.topcities.com. [cited by applicant]
John Bryant; Titled: A Thermodynamic Theory of Economics; Final Post Review Version; [email protected]; 31 pages. [cited by applicant]
Kochan, A., “Hocus Takes the Risk Our of Planning FMS”, FMS Magazine, pp. 91-93, Apr. 1984. [cited by applicant]
Lean and Six Sigma—a one-two punch [PDF] from tbmcg.com B Smith—quality progress, 2003—tbmcg.com. [cited by applicant]
Lee, Hau L., Tang, Christopher S., “Modeling the Costs and Benefits of Delayed Product Differentiation,” Management Science, vol. 43, Issue 1, Jan. 1997, pp. 40-53. [cited by applicant]
Liberopoulos, et al. “Performance Evaluation of an Automatic Transfer Line with WIP Scrapping During Long Failures” (2006) pp. 1-22. [cited by applicant]
Michael, George, “Lean Six Sigma: Combining Six Sigma Quality with Lean Speed,” McGraw-Hill, Apr. 2002, ISBN: 0071385215. [cited by applicant]
Morris, “Factorial sampling plans for preliminary computational experiments” Technometrics, vol. 33, No. 2 May 1991. [cited by applicant]
Nahmias, Steven, Production and Operations Analysis, © 2005, 2 pp., McGraw-Hill Irwin, NY, NY. 5th Edition, pp. 202-203. [cited by applicant]
Naylor et al., “The Manufacturing Game: A Formal Approach to Manufacturing Software,” IEEE Transactions on Systems, Man and Cybernetics, pp. 321-334 (May/Jun. 1986). [cited by applicant]
Poole, T.G., and Szymankiewicz, J.Z., eds., Using Simulation to Solve Problems, Chapter 5, Building a Formal Model, pp. 75-112, 1977, McGraw-Hill book Company (UK) Limited. [cited by applicant]
Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications, Bolch, Greiner, de Meer, and Trivedi, eds., John Wiley & Sons, Inc. 1988, pp. 209, 212-215, 223-225, 265-273, … [cited by applicant]
Raisinghani, “Six Sigma: concepts, tools, and applications” Industrial Management & Data Systems vol. 105, No. 4, (2005) p. 491-505. [cited by applicant]
Roundy, Robin, “98% Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems,” Management Science, Nov. 1985, pp. 1416-1430, vol. 31, No. 11, U.S.A. [cited by applicant]
Roundy, Robin, “A 98% Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production/Inventory Sys,” Mathematics of Operations Research, Nov. 1986, pp. 699-727, vol. 11, No. 4. The Institute of Management Science… [cited by applicant]
Rummel, Jeffrey, “An empirical investigation of costs in batching decisions,” Decision Sciences, vol. 31, No. 1, Winter 2000, pp. 79-103. [cited by applicant]
Six Sigma black belts: what do they need to know? [PDF] from psu.eduRW Hoerl—Hournal of Quality Technology, 2001—Citeseer. [cited by applicant]
Thermodynamic analogies in economics and finance: instability of markets (MeCauley) Published in: Physica A 329 (2003). [cited by applicant]
When worlds collide: lean and Six SigmaRD Snee—Quality Progress, 2005—mall.asq.org. [cited by applicant]
Womack, et al. “The Machine That Changed the World” (1991) pp. 138-168 and 192-222. [cited by applicant]
Yang, Jiaqin, Deane, Richard H., “A lotsize reduction model for just-in-time manufacturing systems,” Integrated Manufacturing Systems, 2002, vol. 13, Issue 7, pp. 471-488. [cited by applicant]
Cited By (1)
US 12,699,384