Scheduling tools with queue time constraints

• US 7,463,939 B1
• Filed: 11/18/2004
• Issued: 12/09/2008
• Est. Priority Date: 11/18/2004
• Status: Active Grant

• Current Assignee: Globalfoundries US Incorporated (GlobalFoundries, Inc.)
• Original Assignee: Advanced Micro Devices, Inc.
• Inventors: Barto, Larry D., Mata, Gustavo, Nettles, Steven C.
• Primary Examiner(s): Jarrett; Ryan A
• Application Number:
  US10/991,808
• Time in Patent Office: 1,482 Days
• Field of Search: 700/100, 700/103
• US Class Current: 700/100
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

A method and apparatus for use in an automated manufacturing environment are disclosed. The method includes autonomously scheduling a consumer manufacturing domain entity for the consumption of services provided by a plurality of provider manufacturing domain entities in an automated process flow; and constraining the autonomous scheduling to lessen queue time violations in the process flow. The apparatus includes a program storage medium encoded with instructions that, when executed by a computing device, performs such a method; a computing apparatus programmed to perform such a method, and an automated process flow implementing such a method.

Claims

1. A method for use in an automated manufacturing environment, comprising:

autonomously scheduling a consumer manufacturing domain entity for the consumption of services provided by a plurality of provider manufacturing domain entities in an automated process flow; and

constraining the autonomous scheduling to lessen queue time violations in the process flow, including;

negotiating for appointments that will comply with maximum queue times; and

considering the risk of queue time violations when selecting bids.

2. The method of claim 1, wherein autonomously scheduling includes:

negotiating among a plurality of software implemented agents, each representing a respective one of the consumer and provider manufacturing entities; and

booking a plurality of negotiated appointments for the consumption of services.

3. The method of claim 2, wherein autonomously scheduling includes scheduling through a contract net negotiation protocol.

4. The method of claim 2, wherein booking the negotiated appointments includes booking the negotiated appointments on a plurality of calendars, each calendar being associated with a respective consumer and provider manufacturing domain entities.

5. The method of claim 2, wherein booking the negotiated appointments includes booking negotiated appointments that will comply with maximum queue times.

6. The method of claim 1, wherein negotiating for appointments that will comply with maximum queue times includes defining a maximum queue time when requesting bids for a later process operation of a queue time constraint when a previous operation of the queue time constraint is already booked.

7. The method of claim 1, wherein negotiating for appointments that will comply with maximum queue times includes defining a maximum queue time when requesting bids for a previous process operation of a queue time constraint when a later process operation of the queue time constraint is already booked.

8. The method of claim 1, wherein negotiating for appointments that will comply with maximum queue times includes decreasing a commitment window end time when requesting bids for a later process operation of a queue time constraint when a previous process operation of the queue time constraint is already booked.

9. The method of claim 1, wherein constraining the autonomous scheduling includes scheduling the consumption of services to comply with maximum queue times.

10. The method of claim 1, wherein constraining the autonomous scheduling to lessen queue time violations includes scheduling appointments for consumption that will comply with maximum queue times.

11. The method of claim 10, wherein scheduling the consumption of services to comply with maximum queue times includes limiting the shifting of appointments to prevent violation of maximum queue times.

12. The method of claim 10, wherein scheduling the consumption of services to comply with maximum queue times includes locking down a scheduled appointment to prevent a queue time violation.

13. The method of claim 10, wherein scheduling the consumption of services to comply with maximum queue times includes canceling an appointment that will result in a violation of a queue time.

14. The method of claim 1, wherein constraining the autonomous scheduling includes increasing a budget of a consumer when the consumer begins processing at the previous process operation of a queue time constraint.

15. The method of claim 14, wherein increasing the budget of a consumer when the consumer begins processing at the previous process operation of a queue time constraint includes increasing the budget inversely proportionally to the difference between the maximum queue time and the scheduled queue time.

16. The method of claim 1, further comprising executing the scheduled consumption.

17. The method of claim 1, further comprising rework scheduling upon an expected violation of a maximum queue time or an actual violation of a maximum queue time.

18. An apparatus for use in an automated manufacturing environment, the apparatus comprising:

means for autonomously scheduling a consumer manufacturing domain entity for the consumption of services provided by a plurality of provider manufacturing domain entities in an automated process flow; and

means for constraining the autonomous scheduling to lessen queue time violations in the process flow, including;

means for negotiating for appointments that will comply with maximum queue times; and

means for considering the risk of queue time violations when selecting bids.

19. The apparatus of claim 18, wherein the autonomous scheduling means includes:

means for negotiating among a plurality of software implemented agents, each representing a respective one of the consumer and provider manufacturing entities; and

means for booking a plurality of negotiated appointments for the consumption of services.

20. The apparatus of claim 18, wherein constraining the autonomous scheduling includes means for increasing a budget of a consumer when the consumer begins processing at the previous process operation of a queue time constraint.

21. The apparatus of claim 18, further comprising means for executing the scheduled consumption.

22. The apparatus of claim 18, further comprising means for rework scheduling upon an expected violation of a maximum queue time or an actual violation of a maximum queue time.

23. A computing apparatus, comprising:

a computing device;

a bus system;

a storage communicating with the computing device over the bus system; and

a plurality of software-implemented agents residing on the storage that, when invoked by the computing device, performs a method for use in an automated manufacturing environment, the method comprising;

autonomously scheduling a consumer manufacturing domain entity for the consumption of services provided by a plurality of provider manufacturing domain entities in an automated process flow; and

constraining the autonomous scheduling to lessen queue time violations in the process flow, including;

negotiating for appointments that will comply with maximum queue times; and

considering the risk of queue time violations when selecting bids.

24. The computing apparatus of claim 23, wherein autonomously scheduling in the method includes:

negotiating among a plurality of software implemented agents, each representing a respective one of the consumer and provider manufacturing entities; and

booking a plurality of negotiated appointments for the consumption of services.

25. The computing apparatus of claim 23, wherein constraining the autonomous scheduling to lessen queue time violations includes scheduling appointments for consumption that will comply with maximum queue times.

26. The computing apparatus of claim 23, wherein constraining the autonomous scheduling in the method includes increasing a budget of a consumer when the consumer begins processing at the previous process operation of a queue time constraint.

27. The computing apparatus of claim 23, wherein the method further comprises executing the scheduled consumption.

28. The computing apparatus of claim 23, wherein the method further comprises rework scheduling upon an expected violation of a maximum queue time or an actual violation of a maximum queue time.

29. A program storage medium encoded with instructions that, when executed by a computing device, perform a method for use in an automated manufacturing environment, the method comprising:

autonomously scheduling a consumer manufacturing domain entity for the consumption of services provided by a plurality of provider manufacturing domain entities in an automated process flow; and

constraining the autonomous scheduling to lessen queue time violations in the process flow, including;

negotiating for appointments that will comply with maximum queue times; and

considering the risk of queue time violations when selecting bids.

30. The program storage medium of claim 29, wherein autonomously scheduling in the encoded method includes:

negotiating among a plurality of software implemented agents, each representing a respective one of the consumer and provider manufacturing entities; and

booking a plurality of negotiated appointments for the consumption of services.

31. The program storage medium of claim 29, wherein constraining the autonomous scheduling to lessen queue time violations in the encoded method includes scheduling appointments for consumption that will comply with maximum queue times.

32. The program storage medium of claim 29, wherein constraining the autonomous scheduling in the encoded method includes increasing a budget of a consumer when the consumer begins processing at the previous process operation of a queue time constraint.

33. The program storage medium of claim 29, wherein the encoded method further comprises executing the scheduled consumption.

34. The program storage medium of claim 29, wherein the encoded method further comprises rework scheduling upon an expected violation of a maximum queue time or an actual violation of a maximum queue time.

35. An automated processing environment, comprising:

a plurality of manufacturing domain entities including at least one consumer manufacturing domain entity and a provider manufacturing domain entity;

a plurality of software implemented agents representing the manufacturing domain entities for scheduling purposes and performing a method comprising;

autonomously scheduling the consumer manufacturing domain entity for the consumption of services provided by the provider manufacturing domain entity; and

constraining the autonomous scheduling to lessen queue time violations in the process flow, including;

negotiating for appointments that will comply with maximum queue times; and

considering the risk of queue time violations when selecting bids.

36. The automated processing environment of claim 35, wherein autonomously scheduling in the method includes:

negotiating among a plurality of software implemented agents, each representing a respective one of the consumer and provider manufacturing entities; and

booking a plurality of negotiated appointments for the consumption of services.

37. The automated processing environment of claim 35, wherein constraining the autonomous scheduling to lessen queue time violations in the method includes scheduling appointments for consumption that will comply with maximum queue times.

38. The automated processing environment of claim 35, wherein constraining the autonomous scheduling in the method includes increasing a budget of a consumer when the consumer begins processing at the previous process operation of a queue time constraint.

39. The automated processing environment of claim 35, wherein the method further comprises executing the scheduled consumption.

40. The automated processing environment of claim 35, wherein the method further comprises rework scheduling upon an expected violation of a maximum queue time or an actual violation of a maximum queue time.