Scheduling device and method therefor

• US 9,063,527 B2
• Filed: 09/14/2012
• Issued: 06/23/2015
• Est. Priority Date: 03/22/2012
• Status: Expired due to Fees

• Current Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: Kuroki, Yusuke, Kuninobu, Shigeta
• Primary Examiner(s): Hartman, Jr., Ronald
• Application Number:
  US13/617,445
• Publication Number:
  US 20130253680A1
• Time in Patent Office: 1,012 Days
• Field of Search: 700/95, 700/100, 700/101
• US Class Current: 1/1
• CPC Class Codes: G05B 19/02 electric
• CPC Class Codes: G05B 19/41865 characterised by job scheduling, process planning, material flow
• CPC Class Codes: G05B 2219/31378 Queue control
• CPC Class Codes: G05B 2219/31386 Determine size of batch of material for each process to meet mfl rate
• CPC Class Codes: G05B 2219/32077 Batch control system
• CPC Class Codes: G05B 2219/32078 Calculate process end time, form batch of workpieces and transport to process
• CPC Class Codes: G05B 2219/32243 Rerouting parts
• CPC Class Codes: G05B 2219/32305 Fastest interrupt time, change jobs dynamically to fastest machine
• CPC Class Codes: G05B 2219/32306 Rules to make scheduling decisions
• CPC Class Codes: Y02P 90/02 Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Abstract

There is provided a scheduling device in which a dividing unit selects a predetermined number of semi-finished products from a head out of a semi-finished products for which scheduling order was determined, and divides selected semi-finished products according to a plurality of patterns to generate a plurality of set sequences, the set sequences each being a sequence of one or more sets each including at least one semi-finished product; a calculating unit assigns, for each of the set sequences, the sets included in the set sequence to different ones of the processing devices so that processing of all the semi-finished products are completed fastest, and finds the set sequence that completion time is completed fastest among the set sequences; and a determining unit determines that a top set in the set sequence found by the calculating unit is processed by the processing device assigned thereto.

Claims

1. A scheduling device that schedules processing of a plurality of semi-finished products by a plurality of processing devices, comprising:

a dividing unit configured to select a predetermined number of semi-finished products from a head out of a plurality of the semi-finished products for which scheduling order was determined, and to divide selected semi-finished products according to a plurality of patterns to generate a plurality of set sequences, the set sequences each being a sequence of one or more sets, the sets each including at least one semi-finished product;

a calculating unit configured to assign, for each of the set sequences, the sets included in the set sequence to different ones of the processing devices so that processing of all the semi-finished products belonging to the set sequence are completed fastest, and find the set sequence that completion time is fastest among the set sequences; and

a determining unit configured to determine that a top set in the set sequence found by the calculating unit is processed by the processing device assigned by the calculating unit, wherein

the dividing unit uses the patterns satisfying that

a size of one set is not less than a smallest number of minimum numbers of semi-finished products that the processing devices can process at one time and is not more than a largest number of maximum numbers of semi-finished products that the processing devices can process at one time, and

sizes of respective top sets in the set sequences cover all values in a range from the minimum number to the maximum number.

2. The device according to claim 1, wherein

the dividing unit removes the top set in the set sequence found by the calculating unit from the semi-finished products for which scheduling order was determined, and targets the semi-finished products after removal on next processing.

3. The device according to claim 1, wherein

the predetermined number is identical to the largest number of the maximum numbers of semi-finished products that the processing devices can process at one time.

4. The device according to claim 1, wherein

the predetermined number is a number specified by a user.

5. A scheduling device that schedules processing of a plurality of semi-finished products by a plurality of processing devices, comprising:

a dividing unit configured to select a predetermined number of semi-finished products from a head out of a plurality of the semi-finished products for which scheduling order was determined, and to divide selected semi-finished products according to a plurality of patterns to generate a plurality of set sequences, the set sequences each being a sequence of one or more sets, the sets each including at least one semi-finished product;

a calculating unit configured to assign, for each of the set sequences, the sets included in the set sequence to different ones of the processing devices so that energy use amount for processing of all the semi-finished products belonging to the set sequence is minimized, and find the set sequence that minimized energy use amount is least among the set sequences; and

a determining unit configured to determine that a top set in the set sequence found by the calculating unit is processed by the processing device assigned by the calculating unit, wherein

the dividing unit uses the patterns satisfying that

a size of one set is not less than a smallest number of minimum numbers of semi-finished products that the processing devices can process at one time and is not more than a largest number of maximum numbers of semi-finished products that the processing devices can process at one time, and

sizes of respective top sets in the set sequences cover all values in a range from the minimum number to the maximum number.

6. The device according to claim 5, wherein

the dividing unit removes the top set in the set sequence found by the calculating unit from the semi-finished products for which scheduling order was determined, and targets the semi-finished products after removal on next processing.

7. The device according to claim 5, wherein

the predetermined number is identical to the largest number of the maximum numbers of semi-finished products that the processing devices can process at one time.

8. The device according to claim 5, wherein

the predetermined number is a number specified by a user.

9. A scheduling method performed using a computer having a processor mounted therein, the processor executing a program that schedules processing of a plurality of semi-finished products by a plurality of processing devices, the program performing the steps of:

selecting a predetermined number of semi-finished products from a head out of a plurality of the semi-finished products for which scheduling order was determined, and dividing selected semi-finished products according to a plurality of patterns to generate a plurality of set sequences, the set sequences each being a sequence of one or more sets, the sets each including at least one semi-finished product;

assigning, for each of the set sequences, the sets included in the set sequence to different ones of the processing devices so that processing of all the semi-finished products belonging to the set sequence are completed fastest, and finding the set sequence that complete time is fastest among the set sequences; and

determining that a top set in the set sequence as found is processed by the processing device assigned to the top set, wherein

the patterns satisfies that

a size of one set is not less than a smallest number of minimum numbers of semi-finished products that the processing devices can process at one time and is not more than a largest number of maximum numbers of semi-finished products that the processing devices can process at one time, and

sizes of respective top sets in the set sequences cover all values in a range from the minimum number to the maximum number.

10. A scheduling method performed using a computer having a processor mounted therein, the processor executing a program that schedules processing of a plurality of semi-finished products by a plurality of processing devices, the program performing the steps of:

selecting a predetermined number of semi-finished products from a head out of a plurality of the semi-finished products for which scheduling order was determined, and dividing selected semi-finished products according to a plurality of patterns to generate a plurality of set sequences, the set sequences each being a sequence of one or more sets, the sets each including at least one semi-finished product;

assigning, for each of the set sequences, the sets included in the set sequence to different ones of the processing devices so that energy use amount for processing of all the semi-finished products belonging to the set sequence is minimized, and finding the set sequence that minimized energy use amount is least among the set sequences; and

determining that a top set in the set sequence as found is processed by the processing device assigned to the top set, wherein

the patterns satisfies that

a size of one set is not less than a smallest number of minimum numbers of semi-finished products that the processing devices can process at one time and is not more than a largest number of maximum numbers of semi-finished products that the processing devices can process at one time, and

sizes of respective top sets in the set sequences cover all values in a range from the minimum number to the maximum number.