KR20150105145A - Method and system for plan of product production by considering appointed date of payment and stockpiling expenses - Google Patents

Method and system for plan of product production by considering appointed date of payment and stockpiling expenses Download PDF

Info

Publication number
KR20150105145A
KR20150105145A KR1020140027415A KR20140027415A KR20150105145A KR 20150105145 A KR20150105145 A KR 20150105145A KR 1020140027415 A KR1020140027415 A KR 1020140027415A KR 20140027415 A KR20140027415 A KR 20140027415A KR 20150105145 A KR20150105145 A KR 20150105145A
Authority
KR
South Korea
Prior art keywords
production
product
time
delivery date
order
Prior art date
Application number
KR1020140027415A
Other languages
Korean (ko)
Inventor
장영재
성신웅
Original Assignee
한국과학기술원
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 한국과학기술원 filed Critical 한국과학기술원
Priority to KR1020140027415A priority Critical patent/KR20150105145A/en
Publication of KR20150105145A publication Critical patent/KR20150105145A/en

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling

Abstract

Disclosed is a planning system for product production that considers a date of delivery and inventory cost. In accordance with an embodiment of the present invention, the planing system for product production that considers a date of delivery and inventory cost comprises: an input data generation unit to generate input data having product production information including ordered product information, the date of delivery, order quantity, product production time, product production preparation time and the number of available facilities with respect to a plurality of products; and a production planning unit to determine the production timeline of a corresponding product and the expected volume of the product for the timeline from the input data to minimize the inventory cost for a period starting from a product production date until the date of delivery, and to meet the date of delivery.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a product planning method and a planning system,

The present embodiment relates to a product production planning method and a planning system that takes into account delivery dates and inventory costs.

The contents described in this section merely provide background information on the present embodiment and do not constitute the prior art.

In fact, most manufacturing companies have a lot of time to manually design their production plans, depending on experience, when planning the production of a product. Even if you use a mathematical model such as mixed integer programming in your production planning, you need to purchase expensive commercial software such as IBM, ILOG CPLEX, SAS / OR to solve this mathematical model, and in some cases There is a problem that not only takes a very long time to solve a problem but also requires a lot of computer memory.

In the process of establishing such a production plan, it is not possible to determine the optimum production time and production quantity of the product easily and quickly considering the delivery date and the inventory cost. Therefore, an effective production planning method that can minimize the inventory cost while producing the product according to the delivery date It is not true.

The main purpose of this embodiment is to provide a product production planning system that determines the production time, production quantity and production order within the same production period in consideration of delivery date and inventory cost in the production process of discontinuous products.

According to one aspect of the present embodiment, input data for generating input data having product production information including order product information, delivery date, order quantity, product production time, product production preparation time, and number of usable equipments for a plurality of products Generating unit; And a production planning unit for determining production quantities to be allocated to production periods and production periods of the products from the input data so that the production completion time does not exceed the delivery date and the inventory cost from the production to the delivery date is minimized. And a product planning system that considers inventory costs.

Here, the production planning unit may include a delivery date recognizing unit for recognizing the delivery date from the input data; And a production decision unit which determines the quantity of production to be allocated to the production period and the production period of the product so that the inventory cost is minimized under the condition that the production completion time is not later than the delivery date.

The production planning unit may include a production order determining unit that determines a production order for minimizing a product production preparation time for a plurality of products to which production periods are equally allocated; And a production order plan file output unit for generating and outputting a production plan file reflecting the production order.

The production decision section may further comprise: a slack value calculation section for calculating a slack value s from the input data; Order product information sorting unit for sorting order product information according to the size of slack value; And s = r - t (where r = the number of days left before the delivery date of the product to be ordered, t = The number of production days of the order product).

In addition, the ordered product information sorting unit sorts the ordered product information in the order of the smallest slack value to the largest one.

In addition, the production decision section determines the production period of the product so that the production completion time is before the delivery date.

According to another aspect of the present invention, input data for generating input data having product production information including order product information, delivery date, order quantity, product production time, product production preparation time, Generation process; And a production planning process for determining production quantities allocated to the production period and the production period of the product from the input data so that the production completion time does not pass the delivery date and the inventory cost from the product production to the delivery date is minimized Provides product planning method considering delivery date and inventory cost.

Here, the production planning process includes a delivery date recognition process for recognizing the delivery date from the input data; And a production decision process to determine the quantity of production allocated to the production period and the production period of the product so that the inventory cost is minimized under the condition that the production completion time is not later than the delivery date.

Also, a production order determining process for determining a production order for minimizing a product production preparation time for a plurality of products to which production periods are equally allocated; And a production plan file output process for generating and outputting a production plan file reflecting the production order.

Also, the production timing determination process may include a slack value calculation process for calculating the slack value s from the input data; Ordering the product information according to the size of the slack value; And s = r - t (where r = the number of days left before the due date of the product to be ordered, t = the number of production days of the order product).

As described above, according to this embodiment, in the production process of the discontinuous product, the production period, the production quantity and the production order within the same production period are determined in consideration of the delivery date and the inventory cost, Can be minimized.

1 is a block diagram of a product production planning system that takes into account delivery dates and inventory costs according to an embodiment of the present invention.
2 is a block diagram of the production decision unit of FIG.
Fig. 3 is a diagram showing a decision date of production date of an order product.
FIG. 4 is a diagram illustrating a push-back process for minimizing inventory costs when the production date of the main product of FIG. 3 is determined.
FIG. 5 is a diagram illustrating a method of determining a production order for minimizing a production preparation time according to an embodiment of the present invention.
6 is a flowchart of a product production planning method in consideration of delivery date and inventory cost according to an embodiment of the present invention.
7 is a detailed flowchart of the production decision process of FIG.

Hereinafter, some embodiments of the present invention will be described in detail with reference to exemplary drawings. It should be noted that, in adding reference numerals to the constituent elements of the drawings, the same constituent elements are denoted by the same reference numerals even though they are shown in different drawings. In the following description of the present invention, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear.

In describing the components of the present invention, terms such as first, second, A, B, (a), and (b) may be used. These terms are intended to distinguish the constituent elements from other constituent elements, and the terms do not limit the nature, order or order of the constituent elements. Throughout the specification, when an element is referred to as being "comprising" or "comprising", it means that it can include other elements as well, without excluding other elements unless specifically stated otherwise . In addition, '... Quot ;, " module ", and " module " refer to a unit that processes at least one function or operation, and may be implemented by hardware or software or a combination of hardware and software.

1 is a block diagram of a product production planning system that takes into account delivery dates and inventory costs according to an embodiment of the present invention. Referring to FIG. 1, a product production planning system that takes into account delivery dates and inventory costs includes an input data generation unit 110 and a production planning unit 120.

The input data generation unit 110 has product production information including a product product information of order, a delivery date, an order quantity, a product production time, a product production preparation time, a usable facility number, a customer name, And generates input data. For example, the input data may be microfilter PL22, March 10, 2014, 200, 5, 2, Jeil Electronics and March 2, 2014. Product production information is extracted from the database (DB, 50).

The production planning unit 120 determines the production quantity allocated to the production period and the production period of the product from the input data so that the inventory cost from the product production to the delivery date is minimized without elapsing the delivery date as much as possible. The production planning unit 120 is executed as a production planning program structured in Java, and the production planning program is coded as a heuristic algorithm. The production planning unit 120 includes a delivery date recognition unit 121, a production decision unit 122, a production order determination unit 123 and a production plan file output unit 124.

The delivery date recognition unit 121 recognizes the delivery date from the input data. Here, the delivery date means the delivery date that the product manufacturer should send the product to the product ordering company.

The production decision unit (122) determines the quantity of production to be allocated to the production period and the production period of the product so that the inventory cost is minimized under the condition that the production completion time is not later than the delivery date. That is, the production decision unit 122 finds a condition that the production completion time is not later than the delivery date as much as possible from the input data, and if the production time and the production time are all satisfied, The production period of the product and the production quantity allocated to the production period, which minimize the inventory cost, are determined. Particularly, the production decision unit 122 determines the production period of the product so that the production completion time is before the delivery date, so that the order product can be delivered on the delivery date. If the time to produce the ordered product is not enough by the due date, the ordered product is produced by the due date.

The production order determining unit 123 determines a production order for minimizing the product production preparation time (setup time) for a plurality of products to which the production time is equally allocated. In relation to the product production process, the operation time of the product is divided into the product preparation time and the product production time. The minimum product preparation time is required to minimize the operation time and to operate the factory efficiently.

The production plan file output unit 124 generates and outputs a production plan file reflecting the production order. The production plan file output unit 124 can be implemented as a production schedule template of a program structured in Visual Basic. The production plan file output unit 124 can automatically read the output file from the production planning program, Format.

2 is a block diagram of the production decision unit of FIG. 2, the production determining unit includes a slack value calculating unit 122a, an ordered product information sorting unit 122b, and a production amount allocating unit 123c.

The slack value computing unit 122a computes the slack value s from the input data. s = r - t (where r = number of days remaining until the due date of the order product, and t = number of production days of the order product). The slack value may be positive (+) or negative (-). As can be seen from the above formula, the small slack value of an order product means that there is not enough margin until the due date, and the large slack value means that there is a margin until the delivery date. Therefore, it can be seen that the smaller the slack value, the more urgent the order, and the larger the slack value, the more comfortable the order that can be produced late. If the slack value is negative (-), the product is an order that can not be produced until the due date, even if it starts production right now.

The ordered product information sorting unit 122b sorts the ordered product information according to the size of the slack value. The slack value is sorted in order from smallest to largest, that is, from urgent order to affordable order.

The production amount allocating unit 122c allocates the production amount so that the product production preparation time and the product production time according to the ordered product information sorted by the ordered product arranging unit 122b are matched with the available production time of the factory.

The theory related to the product production planning system considering the delivery date and the inventory cost according to the embodiment of the present invention as described above will be described with reference to FIG. 3 and FIG. 4. FIG.

The heuristic algorithm is a heuristic algorithm that combines the principle of Minimum Slack Time (MST) with the principle of shortest processing time (SPT). The MST principle and the SPT principle are for the earliest completion and earliness / tardiness penalty problems of a single machine, and the algorithm additionally has a pushback procedure. The pushback procedure is based on the idea that inserting an idle time between tasks improves the objective function value for the early completion penalty. Consider the following observation and lemma.

(Observation 1) Minimizing the penalty function F jt

Figure pat00001
Is minimized. If job j is premature completion (t j is less than or equal to D * j ), u j is
Figure pat00002
(Premature completion penalty), and job j is a delivery delay (t j is more than D * j ), u j
Figure pat00003
(Delivery delay penalty). t j is the production date of job j in the production process, D * j is Ideal production day of work j in the production process.

(Observation 2) If s j is the slack of job j, then D * j is as shown in equation (1).

[Equation 1]

D * j = delivery date - standard lead time (standard lead time) = (d j - SLT j ) = s j

(Theorem 1) If job capacity is not constrained, proceeding to task j at D * j for all j

Figure pat00004
Is minimized.

(Observation 3) There can be two or more jobs with the same s j . therefore,

Figure pat00005
Minimizing the total cost of ownership is equivalent to minimizing the sum of the absolute value deviations between each job completion time from common due dates. [Garey, MR, Tarjan, RE, Wilfong, GT (1988). "One-processor scheduling with symmetric earliness and tardiness penalties." Mathematics of Operations Research, 13 (2), pp. 330-348. Reference]. In other words, the concept of common slack time in this problem is the same as the concept of the common delivery date, and SPT is used as a rule to minimize delivery delay in these problems.

(Observation 4) The weighted MST principle is optimal when all due dates are spread well [Pinedo, M. (2012). Scheduling: theory, algorithms, and systems. Springer. Reference]. In this case, all

Figure pat00006
j is the same and all
Figure pat00007
Assume j is the same. Therefore, the weighted MST and weighted SPT are MST and SPT. Additionally,
Figure pat00008
The value is
Figure pat00009
Value (for example,
Figure pat00010
= 0.02,
Figure pat00011
= 2), which means that the delivery delay has a higher penalty than early production.

Based on the above observations, the combination of MST and SPT can provide a good initial solution for minimizing delivery delays. Here, the MST principle is performed first, and the SPT principle is executed in the same slack to create a sequence. FIG. 3 shows the time period during which seven ordered products (indicated by boxes) are produced. Since the products are produced without the idle time from the order date (D-6), two days before the delivery date (D-2) D-1). In such a case, since the product production date is assigned with priority not only to the date of completion of production but also to the date of delivery, the ordered product may be produced too early and left in stock.

On the other hand, as shown in FIG. 4, the early production penalty can be reduced by pushing back the order products (boxed) sorted in accordance with the MST principle and the SPT principle in the past on the ideal production date (the day before the delivery date). D-6 to D-5, D-5, and D-5 when the slack value (described in FIG. 2) is 1, 2, 3, 4, 5, To D-4, D-4, D-3, D-2 and D-1. The time zone corresponding to the product a, b, c, d, e, and f is the time zone corresponding to the equipment operation time (product preparation time + product production time) , e, and f is the time zone, that is, the idle time, not the facility operation time for the product. Production of such products takes into account delivery dates and inventory costs, which can minimize inventory costs while maximizing delivery times. In case of products a and b, the production completion time is the delivery date, and in the case of products c, d, e, and f, the production completion time is before the delivery date.

(Theorem 2) Given an initial solution that is ordered by MST-SPT, there is a spare time between the completion date of the job j (t j ) and the ideal completion date (D * j ) , Moving the job j to D * j by applying the pushback procedure results in a total penalty that is always smaller than the old total penalty due to the reduction of the early production penalty.

FIG. 5 is a diagram illustrating a method of determining a production order for minimizing a production preparation time according to an embodiment of the present invention.

Referring to FIG. 5, the order of product A, product B, and product C indicates the preparation time for preparing the product between two products (time for preparing another product after production of one product). As can be seen from FIG. 5, the preparation time for product production between the different products varies, and between the products A and B, the product preparation time when the product is changed from the product A to the product B Time is different. Therefore, the total preparation time for a product during a day can vary greatly depending on the production order of the day.

In this situation, the Traveling Sales Person problem algorithm can be used to determine the production order that minimizes product preparation time. By applying the salesman problem algorithm, each product can be set as a point, and the product preparation time between each product production can be modeled as the distance between each point. At this time, it is possible to determine the production order for minimizing the product preparation time using the nearest neighborhood algorithm. The nearest neighbors route algorithm determines the passing order by selecting the point located at the shortest distance at each point through each point so that the total total path length can be minimized.

Referring to FIG. 5, the product preparation time before production of product B after production of product A is 1 hour, and preparation time of product production before production of product B after production of product B is 1.5 hours. After preparation of product B, preparation time of product before production of product C is 1.2 hours, preparation time of production of product B after production of product C is 2 hours. Product C after production of product A preparation time of production of product A is 0.5 hour, and product preparation time before production of product C after product A is 3 hours.

When the products A, B, and C are produced on a specific day, the production order of the products is classified into six cases as shown in the following (1) to (6) as shown in FIG.

(1) Product preparation time (1.2 hours) from production of product A to production of product B, production preparation time before production of product C after product B, when product A, product B, 2.2 hours) combined to take 2.5 hours of product preparation time.

(2) When preparing products A, C, and B in order, prepare preparation time (3 hours) before production of product C after product A, preparation preparation time (2 Time) to prepare the product for 5 hours.

(3) When product B, product A, and product C are ordered, product preparation time (1.5 hours) before production of product A after product B, product preparation time 3 Time), all take 4.5 hours of product preparation time.

(4) Product preparation time (2.2 hours) before production of product C after production of product B, product preparation time (0.5) before production of product A after production of product C, when product B, product C, Time), which takes 2.7 hours of product preparation time.

(5) Product preparation time (0.5 hour) before production of product A after production of product C, product preparation time (1.2 hours) before product production after production of product B Time), all 1.7 hours of product preparation time is required.

(6) When preparing products C, B, and A in order, prepare preparation time (2 hours) before production of product B after product C, preparation preparation time (1.5 Time), all take 3.5 hours of product preparation time.

(1) to (6), it can be seen that the production preparation time is minimized when the products are produced in the order of (1) and (6).

6 is a flowchart of a product production planning method in consideration of delivery date and inventory cost according to an embodiment of the present invention. Referring to FIG. 6 together with FIG. 1, the product production planning method considering the delivery date and the inventory cost includes S610 to S690.

The input data generation unit 110 has product production information including a product product information, a delivery date, an order quantity, a product production time, a product production preparation time, a usable facility number, a customer name, and an order creation date for a plurality of products And generates input data (input data generating process, S610). For example, the input data may be micro filter PL22, March 10, 2014, 200, 5 days, 2, Jeil Electronics, March 2, 2014. Product production information is extracted from the database (DB, 50).

The production planning unit 120 determines the production quantity and the production quantity allocated to the production period of the product from the input data S620 so that the inventory cost from the production to the delivery date is minimized without elapsing the delivery date as much as possible ). The production planning unit 120 is executed as a production planning program structured in Java, and the production planning program is coded as a heuristic algorithm. The production planning process includes S620 to S690.

The delivery date recognition unit 121 recognizes the delivery date from the input data (S620) (delivery date recognition process, S630). Here, the delivery date means the delivery date that the product manufacturer should send the product to the product ordering company.

The production decision unit 122 receives the delivery date information S640 from the delivery date recognition unit 121 and determines the production time and the production time allocated to the production time so that the inventory cost is minimized under the condition that the production completion time is not later than the delivery date (Production decision process, S650). That is, the production decision unit 122 finds a condition that the production completion time is not later than the delivery date as much as possible from the input data, and if the production time and the production time are all satisfied, The production period of the product and the production quantity allocated to the production period, which minimize the inventory cost, are determined. Particularly, the production decision unit 122 determines the production period of the product so that the production completion time is before the delivery date, so that the order product can be delivered on the delivery date. If the time to produce the ordered product is not enough by the due date, the ordered product is produced by the due date.

The production order determining unit 123 receives the information on the production time and the production quantity S660 from the production decision unit 122 to determine the production order for minimizing the product production preparation time for the equally allocated products (Production order determination process, S670). In relation to the product production process, the operation time of the product is divided into the product preparation time and the product production time. The minimum product preparation time is required to minimize the operation time and to operate the factory efficiently.

The production plan file output unit 124 receives the production order information from the production order determination unit 123 (S680), generates and outputs a production plan file reflecting the production order (production plan file output process, S690). The production plan file output unit 124 can be implemented as a production schedule template of a program formed by Visual Basic, and automatically reads the output file from the production planning program and outputs it in an Excel file format do.

7 is a detailed flowchart of the production decision process of FIG. Referring to Fig. 7 together with Fig. 2, the production decision process includes S651 to S655.

The slack value calculating unit 122a calculates the slack value s from the input data (S651). s = r - t (where r = number of days remaining until the due date of the order product, and t = number of production days of the order product). The slack value may be positive (+) or negative (-). As can be seen from the above formula, the small slack value of an order product means that there is not enough margin until the due date, and the large slack value means that there is a margin until the delivery date. Therefore, it can be seen that the smaller the slack value, the more urgent the order, and the larger the slack value, the more comfortable the order that can be produced late. If the slack value is negative (-), the product is an order that can not be produced until the due date, even if it starts production right now.

The ordered product information sorting unit 122b receives the slack value information S652 from the slack value calculating unit 122a and sorts the ordered product information according to the size of the slack value (S653). The slack value is sorted in order from smallest to largest, that is, from urgent order to affordable order.

The production amount allocation unit 122c receives the ordered product information sorted from the ordered product information arrangement unit 122b (S654), allocates the production amount so that the product production preparation time and the product production time for each product product information match the available time of the factory (S655).

6 to 7, steps S610 to S690 are sequentially executed. However, this is merely an example of the technical idea of the embodiment of the present invention. In other words, those skilled in the art will understand that the steps described in FIGS. 6 through 7 may be changed and executed without departing from the essential characteristics of an embodiment of the present invention, S690 may be modified and modified in various ways by executing at least one of the processes in parallel, so that the embodiments of FIGS. 6 to 7 are not limited to the time series.

The foregoing description is merely illustrative of the technical idea of the present embodiment, and various modifications and changes may be made to those skilled in the art without departing from the essential characteristics of the embodiments. Therefore, the present embodiments are to be construed as illustrative rather than restrictive, and the scope of the technical idea of the present embodiment is not limited by these embodiments. The scope of protection of the present embodiment should be construed according to the following claims, and all technical ideas within the scope of equivalents thereof should be construed as being included in the scope of the present invention.

50: Database
110: input data generating unit
120: Production Planning Department
121: Delivery date recognition section
122: production decision unit
122a: a slack value calculating unit
122b: order product information sorting section
122c:
123: production order determining unit
124: Production plan file output unit

Claims (10)

An input data generation unit for generating input data having product production information including order product information, delivery date, order quantity, product production time, product production preparation time, and number of available facilities for a plurality of products; And
A production planning unit that determines a production time of the product and a production quantity allocated to the production time from the input data so that the production completion time does not pass the delivery date and the inventory cost from the product production to the delivery date is minimized,
And a product production planning system that takes into account delivery dates and inventory costs. The method according to claim 1,
The production planning unit,
A delivery date recognizing unit for recognizing the delivery date from the input data; And
A production decision unit that determines a production time of the product and a production quantity allocated to the production time so that the inventory cost is minimized under a condition that the production completion time is not later than the delivery date,
And a product production planning system that takes into account delivery dates and inventory costs. 3. The method of claim 2,
The production planning unit,
A production order determining unit that determines a production order for minimizing a product production preparation time for a plurality of products to which the production time is equally allocated; And
A production plan file output unit for generating and outputting a production plan file reflecting the production order,
And a product production scheduling system that takes into account delivery dates and inventory costs. 3. The method of claim 2,
The production decision unit
A slack value calculating unit for calculating a slack value s from the input data;
An ordered product information sorting unit for sorting the ordered product information according to the size of the slack value; And
A production amount allocation unit for allocating the production amount so that the product production preparation time and the product production time per available product information are suitable for the available production time
Wherein s = r - t (where r is the number of days remaining until the delivery date of the ordered product and t is the number of production days of the ordered product). 5. The method of claim 4,
Wherein the ordered product information sorting unit arranges the ordered product information in the order of the smallest slack value and the largest slack value. 3. The method of claim 2,
Wherein the production decision unit determines the production time of the product so that the production completion time is before the delivery date. An input data generating step of generating input data having product production information including order product information, delivery date, order quantity, product production time, product production preparation time and number of available facilities for a plurality of products; And
A production planning process for determining the production time of the product and the production quantity allocated to the production time from the input data so that the production completion time does not exceed the delivery date and the inventory cost from the product production to the delivery date is minimized
And a product planning method considering the delivery date and inventory cost. 8. The method of claim 7,
In the production planning process,
A delivery date recognizing step of recognizing the delivery date from the input data; And
A manufacturing decision process for determining the production time of the product and the production quantity allocated to the production time so that the inventory cost is minimized under the condition that the production completion time is not later than the delivery date
And a product planning method considering the delivery date and inventory cost. 9. The method of claim 8,
A production order determining step of determining a production order for minimizing a product production preparation time for a plurality of products to which the production time is equally allocated; And
A production plan file output process for generating and outputting a production plan file reflecting the production order
The method of claim 1, further comprising: 9. The method of claim 8,
The production time determination process includes:
A slack value calculating step of calculating a slack value s from the input data;
An ordered product information sorting process of sorting the ordered product information according to the size of the slack value; And
A product allocation preparation process for allocating the production amount so that the product production preparation time and the product production time correspond to the available production time
, Wherein s = r - t (where r = number of days remaining until the delivery date of the order product and t = number of production days of the order product).
KR1020140027415A 2014-03-07 2014-03-07 Method and system for plan of product production by considering appointed date of payment and stockpiling expenses KR20150105145A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020140027415A KR20150105145A (en) 2014-03-07 2014-03-07 Method and system for plan of product production by considering appointed date of payment and stockpiling expenses

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020140027415A KR20150105145A (en) 2014-03-07 2014-03-07 Method and system for plan of product production by considering appointed date of payment and stockpiling expenses

Publications (1)

Publication Number Publication Date
KR20150105145A true KR20150105145A (en) 2015-09-16

Family

ID=54244630

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020140027415A KR20150105145A (en) 2014-03-07 2014-03-07 Method and system for plan of product production by considering appointed date of payment and stockpiling expenses

Country Status (1)

Country Link
KR (1) KR20150105145A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20170055757A (en) * 2015-11-12 2017-05-22 주식회사 온데이코스메틱 Method of sell Individual and Custom-Tailored Cosmetics and Thereof Sales System
CN108681838A (en) * 2018-07-03 2018-10-19 山东浪潮通软信息科技有限公司 A kind of production planning and sequencing determines method and device
KR20190078972A (en) * 2017-12-27 2019-07-05 오씨아이 주식회사 Method for Managing Production Schedule in Carbon Black

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20170055757A (en) * 2015-11-12 2017-05-22 주식회사 온데이코스메틱 Method of sell Individual and Custom-Tailored Cosmetics and Thereof Sales System
KR20190078972A (en) * 2017-12-27 2019-07-05 오씨아이 주식회사 Method for Managing Production Schedule in Carbon Black
CN108681838A (en) * 2018-07-03 2018-10-19 山东浪潮通软信息科技有限公司 A kind of production planning and sequencing determines method and device
CN108681838B (en) * 2018-07-03 2021-11-09 浪潮通用软件有限公司 Scheduling plan determining method and device

Similar Documents

Publication Publication Date Title
US11894680B2 (en) Integrated solution techniques for security constrained unit commitment problem
US20060224426A1 (en) Transportation planning with system assisted exception resolution
US9076116B2 (en) Alpha-chain constraints for process planning
JP5872677B2 (en) Production planning decision method, production planning device and program
Kobayashi et al. Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques
Mokhtari et al. Scheduling with an outsourcing option on both manufacturer and subcontractors
US20130103607A1 (en) Determination of Projected Carrier Assignment
Reimann et al. Joint optimization of production planning and vehicle routing problems: A review of existing strategies
Fu et al. Coordinated scheduling of production and delivery with production window and delivery capacity constraints
Heching et al. Scheduling home hospice care with logic-based Benders decomposition
Schuh et al. Cyber-physical production management
KR20120110215A (en) Method, system and recording medium for production planing
Krishnaiyer et al. A cloud-based Kanban decision support system for resource scheduling & management
KR20150105145A (en) Method and system for plan of product production by considering appointed date of payment and stockpiling expenses
Emde et al. Scheduling direct deliveries with time windows to minimise truck fleet size and customer waiting times
CN106462145B (en) Adjusting apparatus and program are supplied between region
Monostori et al. Digital enterprise solution for integrated production planning and control
Zeng et al. Disruption management model and its algorithms for berth allocation problem in container terminals
CN117196530A (en) Digital intelligent scheduling method and system for software project set and human resource pool
Eliiyi et al. A vehicle scheduling problem with fixed trips and time limitations
Xu et al. Single machine scheduling with total tardiness criterion and convex controllable processing times
US11036516B2 (en) Parallel distributed processing control system, program, and parallel distributed processing control method
Hall et al. Capacity allocation games without an initial sequence
JP2006244470A (en) Delivery date reply system, delivery date reply method, and delivery date reply program
JP2017191376A (en) Intercompany stock accommodation control system, accommodation plan generation device and corporate business execution device

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E601 Decision to refuse application