JPH0343375B2 - - Google Patents

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention provides a method for determining how to use the raw yarn for which fabric when a certain raw yarn is commonly required for the production of a plurality of textiles. The present invention relates to a yarn shipping priority determining device that determines whether to ship yarn in priority order.

[Prior Art] Conventionally, the above-mentioned decisions were made by skilled workers based on the delivery date of the fabric that requires yarn and the number of days required to manufacture the fabric, in order to determine the shipping priority. Even when a woven fabric is made up of multiple types of yarns, they do not take into account the expected date when other yarns needed to manufacture the woven fabric can be added to the weaving process.

[Problems to be solved by the invention] Therefore, in the past, even if a certain raw yarn was shipped for the production of a textile, other raw yarns necessary for the production of the textile were not used in the weaving process of the textile. Since production of the woven fabric cannot be started until it is input, there is a problem in that the yarn that has been shipped may end up in work-in-progress inventory. In addition, in such cases, if the material had been shipped for the production of other textiles and inputted into the weaving process of that textile, the possibility that the weaving process could have been started was eliminated. This was thought to be a problem, leading to a decline in the loom operating rate. The present invention has been made in consideration of the above points, and when a certain raw yarn is commonly required for the production of a plurality of textiles, the raw yarn can be used in an appropriate manner for manufacturing the textile. It is an object of the present invention to provide a device that automatically determines the priority order of yarn shipment so that the yarn can be shipped in priority order.

[Means for Solving the Problems] The configuration of the yarn shipping priority determining device of the present invention will be explained based on FIG. 1.

Reference numeral 101 denotes a target yarn name storage means for storing the name of the target yarn, that is, the yarn whose shipping priority is to be determined.

Reference numeral 102 denotes a textile delivery date storage means that stores the name of the textile to be manufactured and the delivery date of the textile.

Reference numeral 103 is a yarn storage device that stores the name of the yarn and the scheduled shipping date of the yarn.

Reference numeral 104 denotes yarn storage means that stores the name of the woven fabric, the name of the yarn necessary for manufacturing the woven fabric, and the name of the process in which the yarn is to be input.

Reference numeral 105 denotes a process sequence storage means that stores the name of the fabric, the name of the process applied to manufacturing the fabric, and the order thereof.

Reference numeral 106 denotes a standard lead time storage means that stores the name of the process and the standard processing time of the process, that is, the standard lead time.

107 is the target yarn name storage means 101;
Based on the outputs from the textile delivery date storage means 102, the yarn storage means 104, the process sequence storage means 105, and the standard lead time storage means 106, all manufacturing schedules that require the target yarn are stored. A scheduled weaving start date calculation storage means that calculates the scheduled start date of the weaving process of the fabric, that is, the scheduled weaving start date, and stores this.

108 is the target yarn name storage means 101;
The yarn expected date storage means 103, the yarn storage means 104, and the process sequence storage means 1.
05 and the output from the standard lead time storage means 106, the scheduled date when raw yarn or processed yarn necessary for manufacturing all the fabrics to be manufactured that require the target raw yarn can be introduced into the weaving process. In other words, it is a calculation storage means for calculating and storing the scheduled date for starting the weaving process, which calculates and stores the scheduled date for starting the weaving process.

109 is the scheduled weaving start date calculation storage means 1
07 and the output from the weaving processing process scheduled date calculation storage means 108, the date to be used as the standard for determining the priority order, that is, the priority This is a priority ranking determination date determination storage means that determines and stores the ranking determination date.

110 is the scheduled weaving start date calculation storage means 1
07, the scheduled weaving process input date calculation storage means 108, and the priority determination date determination storage means 109, and by the output from the priority determination date determination storage means 109, Yarn shipping priority determining means determines the priority for all fabrics scheduled to be manufactured that require the target yarn.

The yarn shipping priority determining device of the present invention includes the target yarn name storage means, textile delivery date storage means, scheduled yarn shipping date storage means, yarn storage means, process series storage means, and standard lead time. It is constituted by a storage means, a storage means for calculating a scheduled weaving start date, a storage means for calculating a scheduled date for inputting a weaving process, a storage means for determining a priority determination date, and a yarn shipping priority determination means.

[Operation] The yarn shipping priority determining means 110 activates the operation of the scheduled weaving start date calculation storage means 107.

The scheduled weaving start date calculation storage unit 107 stores the name of the target yarn, the name and delivery date of the fabric to be manufactured, the name of the yarn necessary for manufacturing the fabric, the name of the process in which the yarn is to be input, and the name of the yarn to be manufactured. Obtain the name and order of the textile application process and the standard lead time of each application process, and input the intermediate product into the final application process by subtracting the standard lead time of the final application process from the delivery date of the textile. By calculating the desired point in time and repeating this calculation sequentially going back through the application steps, the scheduled weaving start date of the fabric is calculated and stored.

After the operation of the scheduled weaving start date calculation storage means 107 is completed, the yarn shipping priority determining means 110 activates the operation of the weaving process start date calculation storage means 108.

Weaving process input possible expected date calculation storage means 108
The name of the target yarn, the name of the fabric to be manufactured, the name of the yarn necessary for manufacturing the fabric, the estimated shipping date of the yarn, the name of the process in which the yarn should be input, and the name of the yarn needed to manufacture the fabric. Obtain the name and order of the applied processes and the standard lead time of each applied process, and add the standard lead time of the yarn input process to the scheduled shipping date of the raw yarn necessary for manufacturing the textile to determine the next process. By calculating the point at which raw yarn or processed yarn can be introduced into the fabric, and repeating this calculation by sequentially following the applied steps along the process sequence, all yarn weaving processes for the textile can be calculated. Calculate the expected date of possible input and store it.

Weaving process input possible expected date calculation storage means 108
After the operation is completed, yarn shipping priority determining means 110
starts the operation of the priority determination date determination storage means 109.

The priority determination date determination storage means 109 obtains the scheduled weaving start date and the scheduled start date for the weaving process for all the fabrics scheduled to be manufactured that require the target raw yarn, and determines the scheduled start date for the weaving process and the scheduled date for starting the weaving process. If the scheduled date when all necessary raw yarns can be input into the weaving process is earlier than or the same as the scheduled weaving start date of the textile, the scheduled weaving start date of the textile will be used as the priority determination date for the textile. If not, determine the latest date on which all yarns necessary for manufacturing the textile can be put into the weaving process.
The priority determination date is determined as the priority determination date for the fabric, and the priority determination date is stored.

After the operation of the priority determination date determination storage means 109 is completed, the yarn shipping priority determination means 110 obtains the priority determination dates for all the fabrics scheduled to be manufactured that require the target yarn, and stores them in order of earliest priority. determining the priority order;

[Example] Hereinafter, an example of the present invention will be described based on the drawings.

Figure 2 shows an overview of the device of this embodiment, where 1 is an input device such as a keyboard, 2 is a display device such as a CRT display or printer, and 3 is a CPU.
(central processing unit), ROM (read-only memory), RAM (random access memory), I/O ports, etc. 4 is an auxiliary storage device such as a magnetic disk, magnetic tape, etc. The devices are connected via an interface circuit.

The RAM of the microcomputer 3 receives from the input device 1 the coded name, ie, the code name, of the yarn whose shipping priority is to be determined, and stores this. That is, the RAM of the microcomputer 3 is used as the target yarn name storage means 101 mentioned above.

The auxiliary storage device 4 stores a fabric table 4a to be manufactured, which stores the code name of the fabric to be manufactured, its production quantity, and its delivery date, and also stores the code name of the raw yarn and its expected stock amount for each raw yarn. The yarn inventory management table 4b, the code name of the fabric for each fabric,
The code name of the yarn necessary for its manufacture, the amount of yarn necessary to manufacture a unit amount of the woven fabric, the code name of the process in which the yarn should be input, and the applicable process applied to its manufacture. A yarn/process sequence master 4c in which code names and their orders are registered, a standard lead time table 4d in which process code names and standard lead times for the processes are registered, and Code name and scheduled start date of weaving processing,
The code names of all yarns necessary for the manufacture of the woven fabric, the expected dates when these yarns can be introduced into the weaving process, the priority determination date that should be used as the basis for determining the priority order of yarn shipment for the woven fabric, and the A work file 4e in which the priorities of textiles are stored is stored. In other words, the fabric table to be manufactured 4
a is used as the textile delivery date storage means 102. The yarn inventory management table 4b is used as the storage means 103 for the expected date of yarn shipment. The yarn/process sequence master 4c is stored in the yarn storage means 104 and the process sequence storage means 10.
It is used as 5. The standard lead time table 4d is stored in the standard lead time storage means 1.
It is used as 06. Work file 4e
is the scheduled weaving start date calculation storage means 107;
The storage means 10 for calculating the expected date when the weaving process can be started
8 and as a storage means of the priority ranking determination date determination storage means 109.

In order to explain the fabric to be manufactured table 4a, yarn inventory management table 4b, yarn/process sequence master 4c, and standard lead time table 4d, an example of process sequence will be explained first. a certain textile
57101 is manufactured by the process sequence shown in FIG. That is, the raw yarns GB001 and GB002 used for the fabric 57101 are shipped from the raw yarn inventory, and these raw yarns are respectively input into the yarn processing process. The raw yarn processing process is divided into two sub-processes: a yarn dyeing process and a yarn twisting process. Yarn GB101
is input only to the yarn dyeing process, and the raw yarn GB002 is input to the yarn dyeing process, and after that process, it is input to the yarn twisting process. The two raw yarns processed through the above steps are then input into a weaving process as processed yarns. In this process, after the warp preparation process, the warp threads are fed into a loom process and woven into a fabric. Finally, the fabric is processed through two finishing processes: a gas firing process and a washing process.
57101 is completed and the product is in stock. In addition, 01, 02, A1, A2, and B1 are used for each process of yarn dyeing, twisting, warp preparation, loom, gas burning, and washing mentioned above.
and B2, and when the first letter of the process code name is A, the code name is determined to belong to the weaving process.

The fabric table 4a to be manufactured stores the code name of the fabric to be manufactured, its production quantity, and its delivery date in the format shown in FIG. 4, for example. In the example shown in the figure, the production quantity of the fabric with code name 57101 is 1000 kg, and the delivery date is April 27th (April 27th).
It is shown that

In the yarn inventory management table 4b, the code name of yarn and the expected inventory amount of the yarn are registered for each yarn on each page in the format shown in FIG. 5, for example. In the example of the first page shown in the figure, for yarn with code name GB001, it is registered that the expected inventory amount for five days from March 3rd to March 7th is 0 kg, for example. Furthermore, from March 8th, 4
The planned inventory amount up to the 1st of the month is registered every 5 days, and the same is registered thereafter.

The yarn/process series master 4c has, for example, the format shown in Figure 6, with each page containing, for each fabric, the code name of the fabric, the code name of the yarn necessary for its manufacture, and the unit quantity of the fabric. The amount of raw yarn required for manufacturing, the code name of the process in which the raw yarn is to be input, the code name of the applied process applied to the manufacturing, and the order thereof are registered. In other words, for example, to produce 100 kg of fabric with code name 57101, code name
GB001 requires 50kg of raw yarn, and the code name is
It is registered that 50 kg of raw yarn for GB002 is required. In addition, the yarn with the code name GB001 is input and processed in the process with the code name 01, and the yarn with the code name
The raw yarn of GB002 is input and processed in the process with code name 01 and then processed in the process with code name 02, and the two intermediate products obtained by the above processes are both input into the process with code name A1. It is also registered that the woven fabric with the code name 57101 is completed by being sequentially processed through the subsequent steps of code names A2, B1, and B2. Note that in this figure, the steps are basically processed in order from the top, and are processed in parallel only when separated by broken lines. Note that when the process code names are arranged side by side, they are processed in order from the left. Further, in a process in which yarn is input, the code name of the yarn to be input is registered to the left of the code name of that process.

In the standard lead time table 4d, for example, in the format shown in FIG. 7, standard lead times are registered for each yarn processing process, weaving process, and finishing process on each page. That is, on the first page, it is registered that the standard lead times for processes with code names 01 and 02 belonging to the yarn processing process are 9 days and 5 days, respectively. Standard lead times for other processes belonging to the yarn processing process are also registered on this page. On the second page, it is registered that the standard lead times for processes with code names A1 and A2 belonging to the weaving process are 3 days and 16 days, respectively. Standard lead times for other processes belonging to the weaving process are also registered on this page. On the third page, it is registered that the standard lead times for processes with code names B1 and B2 belonging to the finishing process are 5 days and 15 days, respectively. Standard lead times for other processes belonging to the finishing process are also registered on this page. Note that the numerical examples of standard lead times shown above are values for convenience of explanation, and do not necessarily match actual values.

The ROM of the microcomputer 3 mainly stores the following programs, which include the weaving process scheduled start date calculation storage means 107, the weaving process start date calculation storage unit 108, and the priority determination date determination storage unit. 109, and is used as a calculation determining means of the yarn shipping priority determining means 110. That is, a program that calculates the scheduled start date of weaving of a fabric that requires the target raw yarn among all the fabrics scheduled to be manufactured, and stores it in a work file along with its code name, and A program that calculates and stores the scheduled start date of weaving process for all yarns necessary for manufacturing, and a program that calculates and stores the scheduled start date of weaving process and the scheduled start date of weaving process for all the fabrics stored in the work file. A program that determines and stores a priority judgment date, which is a standard for determining the priority of target raw yarn shipments, and a program that compares the This is a program that determines priorities in descending order of priority. However, these programs do not need to be stored in the ROM, and may be stored in the auxiliary storage device 4 and loaded into the RAM before being executed.

The display device 2 is used to display the priorities determined by the microcomputer 3.

Next, the processing performed by the microcomputer 3 according to the flowcharts shown in FIGS. 9 to 12 will be explained using the fabric 57101 whose manufacturing process was explained in FIG. 3 as an example.

FIG. 9 is a flowchart of the main program. First, let me explain.

In step 1 of the figure, the code name D of the yarn whose shipping priority is to be determined, that is, the target yarn, is input into the microcomputer 3 from the input device 1 such as a keyboard. For example, let D=GB001.

In step 2, the number NA of all fabrics to be manufactured, their fabric code names C(I) (I=1,...,NA), and the delivery dates T(I)(I =1,...,NA). For example, NA=100, C(1)=57101, T(1)=4/27, etc.

In step 3, in order to run the loop from step 4 to step 6, variables I and B are set to I=
1, initialize as B=1.

In step 4, a subroutine for determining the scheduled weaving start date, which will be explained later, is called, and only when the fabric C(I) to be manufactured requires target raw yarn with code name D, the weaving process start date of the fabric is determined. The date TT(B) is grasped and stored in page B of the work file 4e along with the code name TN(B) of the fabric. For example, the fabric C(1)=57101 requires the target yarn D=GB001, so as shown in FIG. 8, TN(1)=57101 TT(1)=GB001 is Stored on page 1.

In steps 5 and 6, the value of variable I is changed, and as long as I is less than or equal to NA, the processes from step 4 onwards are repeated. That is, in the previous example, NA=
100, the fabric table 4a to be manufactured is determined by steps from step 3 to step 6.
Of the 100 lots of fabrics stored in , for all fabrics that require target yarn with code name D, the scheduled weaving start date TT(B) of the fabric is determined, and the code name TN( B) is stored in the work file 4e.

In step 7, the lot number F of fabrics written in the work file 4e and the code names TN(B) (B=1, . . . F) of those fabrics are retrieved from the work file 4e.
In the previous example, F=5.

In step 8, in order to run the loop from step 9 to step 11, variable B is initialized to B=1.

In step 9, a subroutine for determining the expected date for inputting the weaving process, which will be explained later, is called, and for the fabric TN(B) stored in page B of the work file 4e, the number N of yarn types required for manufacturing the fabric TN(B) and the In addition to grasping the code name G(L) (L=1,...,N), the scheduled date when these yarns can be input into the weaving process, that is, the scheduled date when they can be input into the weaving process DT(L)
(L=1, . . . , N), determine the priority determination date TY(B) that should be used as the standard for determining the priority of yarn shipment, and write them on page B of the work file 4e. In the previous example, as explained later, N=2, G(1)=GB001, G(2)=GB002, DT(1)=3/22, DT(1)=4/1, TY( B)=4/1.

In steps 10 and 11, the value of variable B is changed, and as long as B is less than or equal to F, the processes from step 9 onwards are repeated. That is, in the previous example, since F=5, the steps from step 8 to step 11 result in the 5 stored in the work file 4e.
For all of the lot fabrics TN(B) (B=1,...,5), the code name G(L) of the raw yarn necessary for manufacturing them.
(L=1,...,N), the scheduled date when these yarns can be input into the weaving process DT(L)(L=1,...,N), and the priority determination date TY(B)(B=1,... , 5) are stored in the work file 4e.

In step 12, the lot number F of fabrics written therein and the priority determination date TY(B) (B=1, . . . F) of those fabrics are retrieved from the work file 4e.

In step 13 and step 14, priority order Y is determined in order of priority determination date TY(B) (B=1,...F).
(B) (B=1,...,F) and work file 4
Y(B)(B=1,...F) on page B(B=1,...F) of e
...Write F).

In step 15, the yarn shipping priority order Y(B)(B
=1, . . . F) and the code name TN(B) (B=1, .

Next, the subroutine for ascertaining the scheduled start date of weaving shown in FIG. 10 will be explained using the fabric with the code name 57101 as an example of C(I).

In step 1, raw materials/process series master 4
From a, the number M of applied processes for the corresponding textile, code name P(K) (K=1,...,M), number NP(K) of the next process of each applied process except the final process (K=1,... ,M-
1), the number N of yarn types required to manufacture the woven fabric
and the code name of the yarn G(L) (L=1,...,N)
Take out. Note that process numbers K from 1 to M are sequentially assigned to all applied processes. According to the example in Figure 4, M=7, P(1)=01, NP(1)=4, P(2)=01, NP(2)=3, P(3)=02, NP(3 )=4, P(4)=A1, NP(4)=5, P(5)=A2, NP(5)=6, P(6)=B1, NP(6)=7, P(7) =B2 N=2, G(1)=GB001, G(2)=GB002, and process numbers from 1 to 7 are used.

In step 2, in order to run the loop from step 3 to step 5, a variable L is initialized to L=1.

In step 3, the code name G(L) of the yarn necessary for manufacturing the fabric with code name C(I) is compared with the code name D of the target yarn, and when they match, the process proceeds to step 6. If they do not match, proceed to step 4. In the example of FIG. 6, manufacturing the fabric with the code name 57101 requires G(1)=GB001, which matches D=GB001, so proceed to step 6.

In steps 4 and 5, the value of variable L is changed, and as long as L is less than or equal to N, the processes from step 3 onwards are repeated. That is, through steps 2 to 5, it is checked whether the fabric with code name C(I) requires target raw yarn with code name D, and only when it is necessary, step 6 is carried out.
If not, simply return from the subroutine.

In step 6, the process number R of the first process of the weaving process is determined from the code name P(K) (K=1, . . . , M) of the process to which the fabric with the code name C(I) is applied. In the previous example, P(4) and P(5) are A1 and A2, respectively, and both belong to the weaving process, so R=4
becomes.

In step 7, the microcomputer 3 extracts the standard lead time ST(K) (K=1, . . . M) for each applied process from the standard lead time table 4d. According to the example in Figure 7, ST(1)=9 days, ST(2)=9 days, ST(3)=5 days, ST(4)=3 days, ST(5)=16 days, ST( 6) = 5 days, ST(7) = 15 days.

In step 8, the scheduled weaving start date of the weaving process is calculated by determining the time when the raw yarn and intermediate products used in the fabric to be manufactured are to be introduced into each application process, that is, the calculation time. To do this, first, the final applied process P(M) is calculated by subtracting the standard lead time ST(M) of the final applied process P(M) from the delivery date T(I) of the fabric with code name C(I). Find the time CT (M). Furthermore, the final application step P
Starting from (M), the applied processes are sequentially traced back along the process sequence, and calculated using the following formula: CT(K) (K=
M-1,...,R). That is, CT(K)=CT(NP(K))−ST(K)(K=M−1,…,
R) is calculated. This will determine the scheduled start date for weaving.
TT(B) is determined as CT(R). Note that the code name C(I) of the fabric is substituted into TN(B). According to the examples in Figures 4 and 5, since R=4, CT(7)=4/12, CT(6)=4/7, CT(5)=3/22, CT(4) = 3/19, TT(B) = 3/19, TN(B) = 57101.

In step 9, the scheduled weaving start date TT(B) of the fabric with code name C(I) and the code name TN(B) of the fabric are determined.
and is written to page B of work file 4e, B=
After setting B+1, return from the subroutine.

Next, regarding the subroutine for ascertaining the expected date when the weaving process can be started as shown in Fig. 11, the code name 57101 is
The following will explain the fabric as an example of TN(B).

In step 1, raw materials/process series master 4
From a, the number M of applied processes for the corresponding textile, code name P(K) (K=1,...,M), number NP(K) of the next process of each applied process except the final process (K=1,... ,M-
1), the number N of yarn types required to manufacture the woven fabric,
The code name of the yarn G(L) (L=1,...,N) and the process number GP(L) (L=1,..., N) of the yarn feeding process.
..., N). According to the example in Figure 4, M=7 P(1)=01, NP(1)=4, P(2)=01, NP(2)=3, P(3)=02, NP(3) =4, P(4)=A1, NP(4)=5, P(5)=A2, NP(5)=6, P(6)=B1, NP(6)=7, P(7)= B2 N=2, G(1)=GB001, GP(1)=1, G(2)=GB002, GP(2)=2.

In step 2, the microcomputer 3 extracts the standard lead time ST(K) (K=1, . . . M) for each applied process from the standard lead time table 4d. According to the example in Figure 7, ST(1)=9 days, ST(2)=9 days, ST(3)=5 days, ST(4)=3 days, ST(5)=16 days, ST( 6) = 5 days, ST(7) = 15 days.

In step 3, the scheduled yarn shipping date T'(L) (L=1..,N) is retrieved from the yarn inventory management table 4b. According to the example in Figure 5, the yarn G(1)=
GB001 will not be ready until March 13th, so T′(1)=3/13. Regarding the yarn G(2)=GB002, the following explanation will be given assuming that T'(2)=3/18 from the page of the yarn inventory management table 4b (not shown).

In step 4, a variable L is initialized to L=1 in order to run the loop from step 5 to step 12.

In the loop from step 5 to step 12,
For each raw yarn G(L) (L=1.…,N), the expected date when it can be put into the weaving process DT(L)(L=1.…,N)
Calculate. Each step will be explained in sequence below.

In step 5, the process number K=GP(L) of the process to which the yarn with the code name G(L) is to be introduced is calculated. In the previous example, for yarn G(1)=GB001, K=GP
(1)=1, and for yarn G(2)=GB002,
K=GP(2)=2.

In step 6, it is determined whether the process is a weaving process. When the process number K is R and it is determined that the process is a weaving process, the process advances to step 7, and in step 7,
Substitute T'(L) for CT(R) and proceed to step 13. Conversely, if it is determined in step 6 that the process number K is not R and that the process is not a weaving process, the process proceeds to step 8. In the previous example, the yarn G(1)=
For GB001, R=4 and K=1, and for yarn G(2)=GB002, R=4 and K=2, so in either case, proceed to step 8.

In step 8, the expected start date for the next process is calculated. In other words, add the standard lead time ST(K) of the yarn feeding process of process number K=GP(L)L) to the scheduled shipping date T'(L) of yarn with code name G(L). In this way, the expected feeding date CT (NP(K')) of the next process of the yarn feeding process is determined. In the previous example, for yarn G(1)=GB001, K=1, L=1, ST
(1) = 9 days, T'(1) = 3/13, NP(1) = 4, so CT(4) = T'(1) + ST(1) = 3/22, and the raw yarn G
(2)=For GB002, K=2, L=2, ST(2)
= 9 days, T'(2) = 3/18, NP(2) = 3, so CT(3) = T'(2) + ST(2) = 3/27.

In step 9, it is determined whether the next process is a weaving process. Process number of the next process
When NP(K) is R and it is determined that the next process is a weaving process, the process proceeds to step 13.
Conversely, if it is determined in step 9 that the process number NP(K) is not R and the process is not a weaving process, the process advances to step 10. In the previous example, the raw yarn G
For (1)=GB001, R=4 and NP(1)=4, so proceed to step 13. Raw yarn G(2)=GB002
For, R=4 and NP(2)=3, so proceed to step 10.

In Steps 10 to 12, the applicable processes are further traced in sequence along the process sequence to determine the scheduled start date for each applicable process.

In step 10, the expected available date of the applicable process is determined using the following formula. In other words, calculate K′=NP(K) CT(NP(K′))=CT(K′)+ST(K′).

In the previous example, for yarn G(2) = GB002,
Since K=2, K′=NP(K)=3, L=2, ST(3)=5 days, CT(3)=3/27,
Since NP(3)=4, CT(4)=CT(3)+ST(3)=4/1.

In step 11, it is determined whether the process is a weaving process. Process number NP of the process
If (K') is R and it is determined that the process is a weaving process, the process proceeds to step 13. On the other hand, if it is determined in step 11 that the process number NP (K') is not R and that the process is not a weaving process, the process proceeds to step 12 and after substituting K',
Return to step 10. In the previous example, the yarn G(2)=
For GB002, R=4 and NP(3)=4, so proceed to step 13.

In step 13, the value obtained by the above steps is
Substitute CT(R) into the expected date DT(L) for inputting into the weaving process. In the previous example, for the yarn G(1)=GB001 and the yarn G(2)=GB002, DT(1)=3/22 and DT(2)=4/1, respectively.

In steps 14 and 15, the value of the variable L is changed, and as long as L is less than or equal to N, the processes from step 5 onwards are repeated to weave all the raw yarns necessary for manufacturing the woven fabric TN(B). Calculate the expected date for processing process input. Then proceed to step 16.

In step 16, a priority determination date determination subroutine to be described later is called, and for the fabric TN(B), the scheduled weaving start date TT(B) and the scheduled weaving process start date DT(L) (L=1, ..., N), the priority determination date TY(B) that should be used as the standard for determining the priority order of yarn shipment is determined.

In step 17, for the fabric TN(B), the code name G(L) (L=1,...,
N) Scheduled date when these raw yarns can be introduced into the weaving process
DT(L) (L=1,...,N) and the priority determination date TY(B) of the fabric are written on page B of the work file 4e. These are written to page B of the work file 4e, and the process returns from the subroutine.

Next, regarding the priority determination date determination subroutine shown in Figure 12, the fabric with code name 57101 is
This will be explained as an example of TN(B).

In step 1, a variable L is initialized to L=1 in order to run the loop from step 2 to step 4.

In Step 2, the scheduled weaving start date TT(B) of the fabric TN(B) is compared with the scheduled date DT(L) when raw yarn G(L) necessary for manufacturing the fabric can be introduced into the weaving process. When the latter is earlier than or the same as the former (in the figure, such a temporal relationship is expressed as .ET., for example, DT(L).ET.TT(B)), then ,
Proceed to step 3; otherwise, proceed to step 6.

In steps 3 and 4, the value of variable L is changed, and as long as L is less than or equal to N, the processes from step 2 onwards are repeated. In other words, after repeating the steps from Step 2 to Step 4 N times, proceeding to Step 5 is the scheduled date DT when all yarns necessary for manufacturing the fabric TN(B) can be input into the weaving process.
(L) (L=1,...,N) is earlier than or equal to the scheduled weaving start date TT(B) of the fabric.

In step 5, the scheduled weaving start date TT(B) of the fabric TN(B) is substituted for its priority determination date TY(B), and the process returns from the subroutine.

In steps 6 to 10, the latest date among the scheduled dates DT(L) (L=1,...,N) when all yarns necessary for manufacturing the fabric TN(B) can be introduced into the weaving process is prioritized. Assign to ranking judgment date TY(B).

In step 6, in order to run the loop from step 7 to step 10, DT(1) is assigned to TY(B) as a candidate value, and the variable L is set to L.
Initialize as =2.

In step 7, the scheduled date DT(L) when raw yarn G(L) necessary for manufacturing the fabric TN(B) can be introduced into the weaving process is compared with the priority determination date TY(B), and the latter is determined to be higher than the former. If it is earlier or the same (TY(B).ET.DT(L)), proceed to step 8, otherwise proceed to step 10.

In step 7, DT(L) is assigned to TY(B).

In steps 9 and 10, the value of the variable L is changed, and as long as L is less than or equal to N, the processes from step 7 onwards are repeated. That is, after repeating the steps from step 7 to step 10 N times, the process returns from the subroutine. Now, in the previous example, TT(B)=3/19, DT(1)=3/22, DT(2)=
Since it is 4/1, TY(B)=4/1.

In addition, as shown below, if the processing capacity of the applied process and the scheduled load amount of that process are compared to calculate the scheduled start date of the weaving process and the scheduled date when the weaving process can be input, It is possible to determine the priority order of yarn shipment with even higher accuracy. That is, in addition to the above components, the auxiliary storage device 4
A scheduled load amount table is stored for each step in which the code name of the step, the processing capacity of that step, and the expected load amount are registered, so that the microcomputer 3 can also execute the next program. The program is based on the amount of fabric to be manufactured that is stored in the fabric table to be manufactured 4a, and the amount of yarn necessary to manufacture a unit amount of the fabric that is stored in the yarn/process series master 4c. A program that calculates the scheduled input amount of yarn and intermediate products on the scheduled start date and scheduled input date of each applied process determined by the standard lead time, and the load for each applied process. Calculate the sum of the planned amount and the planned input amount, calculate the processing time, that is, the calculated lead time, for the process such that this sum is less than the processing capacity of that process, and use the calculated lead time instead of the standard lead time. Particularly, it is a program for changing the scheduled start date and the scheduled available input date.

[Effects of the Invention] According to the present invention, it is possible to provide a device that automatically determines the priority order of yarn shipment by simply inputting the name of the target yarn without causing the above-mentioned problems. be able to.

[Brief explanation of drawings]

FIG. 1 is a block diagram for explaining the configuration of the present invention, FIG. 2 is a block diagram showing an embodiment of the present invention, FIG. 3 is a diagram for explaining an example of a process sequence, and FIG. Figure 4 is a diagram for explaining an example of a fabric table to be manufactured, Figure 5 is a diagram for explaining an example of a yarn inventory management table, and Figure 6 is an example of a yarn/process series master. Figure 7 is a diagram showing an example of a standard lead time table, and Figure 8 is a diagram showing an example of a standard lead time table.
A diagram for explaining an example of a work file, FIG. 9 is a flowchart showing the processing of the microcomputer of the above embodiment, and FIG. 10 shows a process for grasping the scheduled start date of weaving. Flowchart FIG. 11 is a flowchart showing the process for determining the scheduled date for inputting the weaving process, and FIG. 12 is a flowchart showing the process for determining the priority determination date. Explanation of symbols, 1... Input device, 2... Display device, 3... Microcomputer, 4... Auxiliary storage device, 4a... Fabric table to be manufactured, 4b...
... Yarn inventory management table, 4c... Yarn/process series master, 4d... Standard lead time table, 4e... Work file, 101... Target yarn name storage means, 102... Fabric delivery date storage means, 1
03... Scheduled yarn shipping date storage means, 104...
... Yarn storage means, 105 ... Process series storage means,
106...Standard lead time storage means, 107...
...Scheduled weaving start date calculation storage means, 108...Scheduled weaving process starting date calculation storage means, 109...
...Priority determination date determination storage means, 110... Yarn shipping priority determination means.

Claims (1)

[Scope of Claims] 1 (a) Target yarn name storage means for storing the name of the yarn for which shipping priority is to be determined, that is, the target yarn; (b) The name of the fabric to be manufactured and its name. A fabric delivery date storage means that stores the delivery date of the fabric; (c) A yarn storage date that stores the name of the yarn and a scheduled shipping date of the yarn; and (d) The name of the fabric. (e) a yarn storage means that stores the name of the yarn necessary for manufacturing the woven fabric and the name of the process in which the yarn is to be input; (f) a standard lead time storage means that stores the name of the process and the standard processing time, that is, the standard lead time, of the process; g) The target yarn is required by the output from the target yarn name storage means, the textile delivery date storage means, the yarn storage means, the process sequence storage means, and the standard lead time storage means. (h) a scheduled weaving start date calculation storage means for calculating and storing the scheduled start date of the weaving process for all the fabrics scheduled to be manufactured; (h) the target yarn name storage means; a possible scheduled date storage means, the yarn storage means,
Based on the output from the process sequence storage means and the standard lead time storage means, the raw yarn or processed yarn necessary for manufacturing all the fabrics to be manufactured that require the target raw yarn are input into the weaving process. a weaving process start date calculation storage means that calculates and stores the possible weaving process start date calculation storage means; (i) the weaving process start date calculation storage means; and the weaving process start date calculation storage means; A priority determination date determination memory for determining and storing a date to be used as a reference for determining the priority order, that is, a priority determination date, for all fabrics scheduled to be manufactured that require the target raw yarn, based on the output of (j) controlling the execution of the operations of the weaving process scheduled start date calculation storage unit, the weaving process start date calculation storage unit, and the priority determination date determination storage unit; Yarn shipping priority determining means for determining the priority order for all fabrics scheduled to be manufactured that require the target yarn based on the output from the ranking determination date determination storage means. Shipment prioritization device.