JPH04348856A - Work starting order deciding system - Google Patents

Work starting order deciding system

Info

Publication number
JPH04348856A
JPH04348856A JP3146623A JP14662391A JPH04348856A JP H04348856 A JPH04348856 A JP H04348856A JP 3146623 A JP3146623 A JP 3146623A JP 14662391 A JP14662391 A JP 14662391A JP H04348856 A JPH04348856 A JP H04348856A
Authority
JP
Japan
Prior art keywords
process lead
work
lead time
average
lot
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
JP3146623A
Other languages
Japanese (ja)
Inventor
Yoshihisa Arai
荒井 良尚
Mitsuhiro Enomoto
充博 榎本
Masanori Kondo
近藤 眞範
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
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 Hitachi Ltd filed Critical Hitachi Ltd
Priority to JP3146623A priority Critical patent/JPH04348856A/en
Publication of JPH04348856A publication Critical patent/JPH04348856A/en
Pending legal-status Critical Current

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Multi-Process Working Machines And Systems (AREA)
  • General Factory Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

PURPOSE:To calculate (decide) the degree of starting priority (starting order) of each lot by allowing latitude in the completion scheduled data of each by using a process lead time in which latitude is allowed. CONSTITUTION:From a lead time in which latitude, such as shortmost, average, and longmost, is allowed and a present data, a completion date of each of lots A, B... classified by kind of part groups (a), (b)... is predicted with latitude, such as rapidmost, average, latemost, allowed. From a relation between the completion data and a delivery date, the degree of priority (the degree of emergency) is calculated, and a starting order is decided according to the degree of priority. The degree of priority is determined by (average - delivery time)/(latemost - average) when a delivery date of, for example, A is between average and latemost. The degree of priority is determined by (average - a delivery date)/(latemost - average) when delivery dates of B and C are between average and rapidmost. When a delivery data is before rapidmost, it is set to 1.0 and when a delivery data is after latemost, it is set to -1.0.

Description

【発明の詳細な説明】[Detailed description of the invention]

【0001】0001

【産業上の利用分野】本発明は、複数の機械装置(工程
)からなるシヨツプ(職場、作業場)で作業を行うこと
によつて完成するような複数の着手可能部品(ロツト)
の作業の着手順序決定方式に係り、特に、これら作業の
着手順序を納期に間にあうように決定する作業順序決定
方式に関する。
[Industrial Application Field] The present invention is directed to the production of a plurality of ready-to-start parts (lots) that can be completed by working in a shop (workplace, workshop) consisting of a plurality of mechanical devices (processes).
The present invention relates to a method for determining the starting order of these tasks, and particularly relates to a method for determining the starting order of these tasks so as to meet a delivery deadline.

【0002】0002

【従来の技術】従来、作業の着手順序を決定する方式と
して、例えば、特開平2−212053号公報記載のよ
うに、デイスパツチングル−ルや熟練者のノウハウ(知
識)をルール化したものを利用したエキスパ−トシステ
ムを用いて行なう方式が考案されている。ここでは、デ
イスパツチングルールを適用して、各ロツトの工程リー
ドタイムから完成日を予測し、予測完成日と納期との関
係から納期遵守の可能性を判断する。
2. Description of the Related Art Conventionally, as a method for determining the starting order of work, a dispatching rule or a rule based on the know-how of experts has been used, for example, as described in Japanese Patent Laid-Open No. 2-212053. A method using an expert system has been devised. Here, the dispatching rule is applied to predict the completion date from the process lead time of each lot, and the possibility of meeting the delivery date is determined from the relationship between the predicted completion date and the delivery date.

【0003】0003

【発明が解決しようとする課題】上記従来技術では、デ
イスパツチングル−ルを適用して予め固定的に与えられ
た各ロツトの工程リ−ドタイムから完成日を予測し、予
測完成日と納期が一致するか、または予測完成日が納期
より早い場合に納期遵守が可能であると判断し、それ以
外の場合には納期遵守が不可能であると判定している。 しかし、各ロツトのリ−ドタイムは現在の該当シヨツプ
の作業負荷量やシヨツプ内仕掛かり、機械装置の稼動状
況等によつて変化するため、固定的に与えられたリ−ド
タイムから求めた予測完成日(1点で与えられる)によ
り納期遵守の可能性を判断することは不適切である。例
えば、10日後という納期に対し完成日が11日後と予
測された場合、特急指示によつて納期遵守が可能か否か
の判断は不可能である。逆に、10日後という要求納期
に対し完成日が8日後と予測された場合、このロツトを
今着手すべきか否かの判断や、また、シヨツプの作業負
荷量が多いときでも納期を遵守できるかどうかの判定も
困難である。そのため、各シヨツプの作業負荷量やシヨ
ツプ内仕掛かり、機械装置の稼動状況等によつては納期
遅延が発生してしまうという問題があつた。また、種々
のデイスパツチングル−ルを用いてスケジユ−ル案の作
成し、これを評価しながらスケジユ−ルを調整していく
方法では多くの計算時間が必要であつた。
[Problems to be Solved by the Invention] In the above-mentioned prior art, the completion date is predicted from the process lead time of each lot fixed in advance by applying a dispatching rule, and the predicted completion date and delivery date are If they match or the predicted completion date is earlier than the delivery date, it is determined that the delivery date can be met; otherwise, it is determined that the delivery date cannot be met. However, because the lead time for each lot changes depending on the current workload of the relevant shop, the work in progress in the shop, the operating status of machinery, etc., the predicted completion time obtained from the fixed lead time It is inappropriate to judge the possibility of meeting deadlines by days (given as 1 point). For example, if the delivery date is 10 days from now and the completion date is predicted to be 11 days from now, it is impossible to determine whether or not the delivery date can be met by using express instructions. On the other hand, if the requested delivery date is 10 days later, but the completion date is predicted to be 8 days later, it is difficult to decide whether or not to start this lot now, and whether the delivery date can be met even when the shop's workload is heavy. It is also difficult to judge whether Therefore, there has been a problem in that delivery dates may be delayed depending on the workload of each shop, the amount of work in progress within the shop, the operating status of mechanical equipment, etc. Further, the method of creating a schedule using various dispatching rules and adjusting the schedule while evaluating the schedule requires a lot of calculation time.

【0004】したがつて、本発明の目的は、上記従来技
術の問題点を解決し、納期遵守の可能性を高めるために
、工程リ−ドタイムに幅をもたせ、これを用いて完成日
にも幅をもたせてその予測をし、予測完成日と納期との
関係にしたがつて作業着手順序を決定する作業着手順序
決定方式を提供することにある。
[0004] Therefore, an object of the present invention is to provide a width to the process lead time in order to solve the above-mentioned problems of the prior art and to increase the possibility of meeting the delivery date. The object of the present invention is to provide a work start order determining method that makes predictions with a wide range and determines the work start order according to the relationship between the predicted completion date and the delivery date.

【0005】[0005]

【課題を解決するための手段】上記目的を達成するため
、本発明は、複数の工程(機械装置)で次々と作業する
ことによつて完成する複数のロツト(着手可能部品)の
作業着手順序を決定する作業着手順序決定方式において
、各ロツトの部品の種類、納期を記憶するロツト情報記
憶部と、部品種類グル−プ別に該当シヨツプにおける着
手から完成までの期間(工程リードタイム)を最短、平
均、最長で記憶する工程リ−ドタイム記憶部と、部品の
種類に関して工程リ−ドタイム記憶部から得られる最短
、平均、最長の工程リ−ドタイムと現在日を用いて完成
日を最早、平均、最遅という区間(区間完成日)で予測
する区間完成日予測部と、予測した区間完成日(完成予
測日)と納期から各ロツトの作業着手順序を決定する着
手順序決定部とを備えたものである。
[Means for Solving the Problems] In order to achieve the above object, the present invention provides a work start sequence for a plurality of lots (startable parts) that are completed by successively working in a plurality of processes (mechanical devices). In the work start order determination method that determines the work start order, there is a lot information storage unit that stores the type of parts and delivery date of each lot, and the shortest period from start to completion (process lead time) in the corresponding shop for each part type group. Using the process lead time storage section that stores the average and longest, and the shortest, average, and longest process lead times obtained from the process lead time storage section regarding the type of part and the current date, the completion date is stored as the earliest, average, It is equipped with a section completion date prediction unit that predicts based on the latest section (section completion date), and a start order determining section that determines the work start order of each lot based on the predicted section completion date (predicted completion date) and delivery date. It is.

【0006】また、部品種類別に過去の工程リ−ドタイ
ム実績を記憶する工程リ−ドタイム実績記憶部と、工程
リ−ドタイム実績記憶部に格納されている過去の実績か
ら最短、平均、最長の工程リ−ドタイムを求める工程リ
−ドタイム予測部とを備えたものである。
[0006] Also, there is a process lead time record storage unit that stores past process lead time records for each part type, and a process lead time record storage unit that stores the shortest, average, and longest processes from the past records stored in the process lead time record storage unit. The system also includes a process lead time prediction section that calculates lead time.

【0007】さらに、作業負荷を加味して工程リ−ドタ
イムを予測するために、現在の作業状況を記憶する作業
状況記憶部と生産計画を記憶する生産計画記憶部のいず
れか一方または両方と、作業状況記憶部や生産計画記憶
部に格納されている情報を用いて該当シヨツプの作業負
荷を計算する作業負荷演算部とを備えたものである。
[0007]Furthermore, in order to predict the process lead time in consideration of the workload, one or both of a work status storage unit that stores the current work status and a production plan storage unit that stores the production plan; It is equipped with a workload calculation unit that calculates the workload of the corresponding shop using information stored in the work status storage unit and the production plan storage unit.

【0008】[0008]

【作用】上記構成に基づく作用を説明する。[Operation] The operation based on the above configuration will be explained.

【0009】本発明によれば、(例えば該当シヨツプで
)着手可能な各ロツトに対して、ロツト情報記憶部から
取り出された各ロツトの部品種類の値を用いて、工程リ
−ドタイム記憶部に格納されている該当部品種類の(例
えば該当シヨツプにおける)着手から完成までの最短、
平均、最長の工程リ−ドタイムが取り出される。次に、
先に得た最短、平均、最長の工程リ−ドタイムと現在日
とから区間完成日予測部で完成日が最早、平均、最遅と
いう区間(区間完成日)で予測される。着手順序決定部
では、予測された区間完成日とロツト情報記憶部から取
り出した各ロツトの納期から各ロツトの作業着手順序が
決定される。例えば、納期が最早完成予測日以前であれ
ば納期遅れとなるため作業着手の優先度を高く設定し、
納期が最早完成予測日と平均完成予測日との間にあれば
、納期に間にわせることはできるが、木目細かい管理が
必要であるため優先度をやや高く設定し、納期が平均完
成予測日と最遅完成予測日との間にあれば納期に若干の
余裕があるため優先度をやや低く設定し、納期が最遅完
成予測日以降であればまだ着手する必要がないため優先
度を低く設定する、等の判断をもとに優先度を設定し、
これをもとに各ロツトの作業着手順序を決定する。
According to the present invention, for each lot that can be started (for example, in the relevant shop), the value of the part type of each lot retrieved from the lot information storage section is used to store the process lead time storage section. The shortest time from start to completion of the stored part type (for example, in the relevant shop),
On average, the longest process lead time is taken. next,
Based on the shortest, average, and longest process lead times obtained earlier and the current date, the section completion date prediction unit predicts the completion date in the earliest, average, and latest sections (section completion dates). The start order determining section determines the work start order for each lot based on the predicted section completion date and the delivery date of each lot retrieved from the lot information storage section. For example, if the delivery date is before the earliest predicted completion date, the delivery date will be delayed, so the priority for starting work is set high.
If the delivery date is between the earliest predicted completion date and the average predicted completion date, it is possible to meet the delivery date, but since detailed management is required, the priority should be set slightly higher and the delivery date is between the average predicted completion date. If the delivery date is between the date and the latest predicted completion date, there is some margin for the delivery date, so set the priority slightly lower. If the delivery date is after the latest predicted completion date, there is no need to start yet, so set the priority. Set the priority based on your judgment, such as setting it low.
Based on this, the order in which work begins on each lot is determined.

【0010】上記方式は、最短、平均、最長の工程リ−
ドタイムとして工程リ−ドタイム記憶部に格納されてい
る固定的なデ−タを用いるものであるが、工程リ−ドタ
イム実績記憶部に格納されている過去の工程リ−ドタイ
ム実績を用いて工程リ−ドタイム予測部によつて該当部
品種類の最短、平均、最長の工程リ−ドタイムを予測す
る方法も可能である。この最短、平均、最長の工程リ−
ドタイムを用いて完成日を予測することによつてより正
確な予測を行なうことができる。
[0010] The above method calculates the shortest, average, and longest process lead.
Fixed data stored in the process lead time storage unit is used as the process lead time, but process lead time can be calculated using past process lead time records stored in the process lead time performance storage unit. - It is also possible to use a lead time prediction unit to predict the shortest, average, and longest process lead times for the corresponding part type. This shortest, average, and longest process lead
A more accurate prediction can be made by predicting the completion date using the detime.

【0011】さらに、現在の作業状況を記憶する作業状
況記憶部、生産計画を記憶する生産計画記憶部のいずれ
か一方または両方の情報から作業負荷演算部により該当
シヨツプの作業負荷を計算し作業負荷情報を加味した工
程リ−ドタイムを予測し、これを用いてより正確な完成
日予測を行なうことができる。
[0011]Furthermore, the workload calculation unit calculates the workload of the corresponding shop from information in either or both of the work status storage unit that stores the current work status and the production plan storage unit that stores the production plan. It is possible to predict the process lead time in consideration of the information and use this to more accurately predict the completion date.

【0012】0012

【実施例】以下に、本発明の実施例を図面を用いて説明
する。
Embodiments Below, embodiments of the present invention will be described with reference to the drawings.

【0013】図1は本発明の一実施例による作業着手順
序決定方式の概略機能構成を示したものである。図1に
おいて、101は各ロツトの部品種類、納期を記憶する
ロツト情報記憶部、102は部品種類別、シヨツプ別に
着手から完成までの期間(工程リードタイム)を最短、
平均、最長で記憶する工程リ−ドタイム記憶部、103
は工程リ−ドタイム記憶部から得られる最短、平均、最
長の工程リ−ドタイムと現在日を用いて完成日を最早、
平均、最遅の区間(区間完成日)で予測する区間完成日
予測部、104は予測した区間完成日と納期から各ロツ
トの作業着手順序を決定する着手順序決定部である。ま
た、部品種類別、シヨツプ別に工程リ−ドタイム実績を
記憶する工程リ−ドタイム実績記憶部111と、工程リ
−ドタイム実績記憶部111に格納されている作業実績
から最短、平均、最長の工程リ−ドタイムを求める工程
リ−ドタイム予測部112とを用いることによつて、最
短、平均、最長の工程リ−ドタイムを過去の作業実績か
ら求めることができる。さらに、作業負荷を加味して工
程リ−ドタイムを予測する場合には、現在の各シヨツプ
の作業状況を記憶する作業状況記憶部121と生産計画
を記憶する生産計画記憶部122に格納されている情報
を用いてシヨツプの作業負荷を計算する作業負荷演算部
123が必要となる。
FIG. 1 shows a schematic functional configuration of a work start order determining system according to an embodiment of the present invention. In FIG. 1, 101 is a lot information storage unit that stores the part type and delivery date of each lot, and 102 is a part that stores the shortest period from start to completion (process lead time) for each part type and shop.
Process lead time storage unit that stores average and longest time, 103
uses the shortest, average, and longest process lead times obtained from the process lead time storage and the current date to determine the earliest completion date.
A section completion date prediction section 104 predicts based on the average and latest section (section completion date), and a start order determining section 104 determines the work start order for each lot based on the predicted section completion date and delivery date. In addition, there is a process lead time record storage unit 111 that stores process lead time records by part type and shop, and the shortest, average, and longest process lead times from the work records stored in the process lead time record memory unit 111. - By using the process lead time prediction unit 112 for calculating lead times, the shortest, average, and longest process lead times can be determined from past work results. Furthermore, when predicting the process lead time by taking into account the workload, the information stored in the work status storage unit 121 that stores the current work status of each shop and the production plan storage unit 122 that stores the production plan. A workload calculation unit 123 is required to calculate the workload of the shop using the information.

【0014】図2は本発明の実施例による作業着手順序
決定方式を3つのシヨツプ(シヨツプ1、シヨツプ2、
シヨツプ3)から構成される機械加工職場に適用した場
合の全体のシステム構成を示したものである。各シヨツ
プにはロツトの着手、完成等の作業実績を収集するため
のバ−コ−ドリ−ダ等の作業実績収集端末201〜20
3と、作業者211〜213に作業着手指示を表示する
ためのパソコン等の作業指示端末221〜223が設置
されている。これらの端末はネツトワ−ク231を介し
て、全てのシヨツプを統括管理するシヨツプ管理計算機
232に接続されている。図1で示した作業着手順序決
定方式の機能101〜123はすべてシヨツプ管理計算
機232で実行される。
FIG. 2 shows a work start order determination method according to an embodiment of the present invention in three shops (shop 1, shop 2,
This figure shows the overall system configuration when applied to a machining workplace consisting of shop 3). Each shop has work record collection terminals 201 to 20 such as barcode readers for collecting work records such as starting and completing lots.
3, and work instruction terminals 221 to 223 such as personal computers for displaying work start instructions to workers 211 to 213 are installed. These terminals are connected via a network 231 to a shop management computer 232 which centrally manages all shops. All the functions 101 to 123 of the work start order determining method shown in FIG. 1 are executed by the shop management computer 232.

【0015】作業着手順序決定は各シヨツプの作業者2
11〜213が新規にロツトの加工作業を着手しようと
した場合に、作業指示端末221〜223から作業指示
の表示を要求したときに実行される。以下、着手可能ロ
ツトとしてロツトA(部品種類a)、ロツトB(部品種
類b)、ロツトC(部品種類c)の3つのロツトがある
ものとして作業着手順序決定方式を説明する。
The work start order is determined by the worker 2 of each shop.
This is executed when a request is made to display a work instruction from the work instruction terminals 221 to 223 when the robots 11 to 213 are about to start a new lot machining operation. Hereinafter, the work start order determination method will be explained assuming that there are three lots that can be started: lot A (parts type a), lot B (parts type b), and lot C (parts type c).

【0016】区間完成日予測部103は着手可能ロツト
のそれぞれについて以下の手順で完成日を予測する。
The section completion date prediction unit 103 predicts the completion date for each of the available lots according to the following procedure.

【0017】1)ロツト情報記憶部101から該当ロツ
トに関する部品の種類、及び、納期を取り出す。
1) The type of parts and delivery date related to the lot are retrieved from the lot information storage section 101.

【0018】2)工程リ−ドタイム記憶部102から該
当ロツトの加工作業を行なう各シヨツプについて、最短
、平均、最長の工程リ−ドタイムを取り出す。
2) The shortest, average, and longest process lead times are retrieved from the process lead time storage unit 102 for each shop that performs the machining work of the corresponding lot.

【0019】3)上記2)で得られた各シヨツプの最短
の工程リ−ドタイムを加え合わせ、該当ロツトが完成す
るまでの最短の工程リ−ドタイムとする。同様にして、
該当ロツトが完成するまでの平均、最長の工程リ−ドタ
イムを求める。
3) Add together the shortest process lead times for each shop obtained in 2) above to determine the shortest process lead time until the corresponding lot is completed. Similarly,
Find the average and longest process lead time until the corresponding lot is completed.

【0020】4)上記3)で求めた最短、平均、最長の
工程リ−ドタイムと現在日とから区間完成日を求める。
4) Find the section completion date from the shortest, average, and longest process lead times found in 3) above and the current date.

【0021】例えば、ロツトA(部品種類a)はシヨツ
プ1、シヨツプ2、シヨツプ3の順序で加工作業を行な
うものとし、ロツトAの各シヨツプにおける最短、平均
、最長の工程リ−ドタイムが、                          
       最短    平均    最長    
        シヨツプ1        10日 
 12日  15日            シヨツプ
2          8日    9日  10日 
           シヨツプ3        1
5日  20日  26日であるとすると、シヨツプ1
、シヨツプ2、シヨツプ3で加工作業を行なつてロツト
Aが完成するまでの最短、平均、最長の工程リ−ドタイ
ムは、             最短の工程リ−ドタイム  
          33日            
平均の工程リ−ドタイム            41
日            最長の工程リ−ドタイム 
           51日となる。ここで、最短の
工程リ−ドタイムとは、このロツトを優先させて加工作
業を行なえば各機械の前での待ち時間が小さくなるため
工程リ−ドタイムをこの期間まで短縮可能であることを
意味し、最長の工程リ−ドタイムとは、このロツトの優
先度を低くして加工作業を行なうと各機械の前での待ち
時間が大きくなるが、遅くともこの期間で完成すること
を意味する。また、平均の工程リ−ドタイムは、普通に
作業を進めていけば平均的にみてこの期間で完成するこ
とを意味する。
For example, assume that lot A (part type a) is processed in the order of shop 1, shop 2, and shop 3, and the shortest, average, and longest process lead times for each shop in lot A are as follows:
Shortest Average Longest
Shop 1 10 days
12th 15th Shop 2 8th 9th 10th
Shop 3 1
If it is the 5th, 20th, and 26th, then shop 1
The shortest, average, and longest process lead times from the processing operations in Shops 2 and 3 to the completion of Lot A are the shortest process lead times.
33rd
Average process lead time 41
Days Longest process lead time
It will be 51 days. Here, the shortest process lead time means that if this lot is prioritized and processed, the waiting time in front of each machine will be shortened, so the process lead time can be shortened to this period. However, the longest process lead time means that if the priority of this lot is lowered and the machining work is performed, the waiting time in front of each machine will be longer, but the work will be completed within this period at the latest. Also, the average process lead time means that if the work progresses normally, it will be completed within this period on average.

【0022】次に、このようにして求めた最短、平均、
最長の工程リ−ドタイムと現在日とから各ロツトごとの
区間完成日を予測する。区間完成日は、実際には工場の
実働日カレンダを用いて、最早完成予測日X月X日、平
均完成予測日Y月Y日、最遅完成予測日Z月Z日のよう
に予測するが、本実施例の説明では、最早完成予測日、
平均完成予測日、最遅完成予測日を現在日からの累計日
数で示すこととする。このようにしても本発明の考え方
になんら影響を与えることはない。
Next, the shortest, average, and
The section completion date for each lot is predicted from the longest process lead time and the current date. The section completion date is actually predicted using the factory's actual working day calendar, such as the earliest predicted completion date, X month, X day, the average predicted completion date, Y month Y day, and the latest predicted completion date, Z month Z day. , In the explanation of this example, the earliest predicted completion date,
The average predicted completion date and latest predicted completion date are expressed as the cumulative number of days from the current date. Even if this is done, the concept of the present invention will not be affected in any way.

【0023】着手順序決定部104では、まず各ロツト
ごとに予測した区間完成日とロツト情報記憶部101か
ら取り出した該当ロツトの納期とを比較し、各ロツトの
着手優先度を求める。本実施例では着手優先度を以下の
ように考える。
The start order determining unit 104 first compares the predicted section completion date for each lot with the delivery date of the corresponding lot retrieved from the lot information storage unit 101 to determine the start priority of each lot. In this embodiment, start priority is considered as follows.

【0024】(1)納期が最早完成予測日以前である場
合、納期遅れとなるため作業着手の優先度を高く設定す
る。
(1) If the delivery date is before the earliest predicted completion date, the priority for starting work is set high because the delivery date will be delayed.

【0025】(2)納期が最早完成予測日と平均完成予
測日との間にある場合、納期に間にあわせることができ
るが木目細かい管理が必要であるため、優先度をやや高
く設定する。
(2) If the delivery date is between the earliest predicted completion date and the average predicted completion date, the delivery date can be met, but detailed management is required, so the priority is set a little higher.

【0026】(3)納期が平均完成予測日と最遅完成予
測日との間にある場合、納期に対してやや余裕があるた
め優先度をやや低く設定する。
(3) If the delivery date is between the average predicted completion date and the latest predicted completion date, the priority is set slightly lower because there is some margin for the delivery date.

【0027】(4)納期が最遅完成予測日以降である場
合、まだ着手する必要がないため優先度を低く設定する
(4) If the delivery date is after the latest predicted completion date, the priority is set low because there is no need to start yet.

【0028】着手優先度の与え方には様々な方法が考え
られるが、本実施例では以下のように優先度を1.0か
ら−1.0の範囲で設定し、優先度が大きい着手の緊急
度が高いロツトほど優先度が大きくなるようにする。
Various methods can be considered for assigning start priority, but in this embodiment, the priority is set in the range of 1.0 to -1.0 as shown below, and the start priority is set as follows. Lots with higher urgency are given higher priority.

【0029】(1)の場合  優先度=1.0(2)の
場合優先度=(平均完成予測日−納期)/(平均完成予
測日−最早完成予測日)  (3)の場合優先度=(平
均完成予測日−納期)/(最遅完成予測日−平均完成予
測日)  (4)の場合優先度=−1.0このようにし
て各ロツトの優先度を求め、優先度の大きい順に作業を
着手するように作業着手順序を決定すれば、納期遵守を
考慮した各ロツトの作業着手指示を行なうことができる
In the case of (1), priority = 1.0 In the case of (2), the priority = (average predicted completion date - delivery date) / (average predicted completion date - earliest predicted completion date) In the case of (3), priority = (Average predicted completion date - delivery date) / (latest predicted completion date - average predicted completion date) In the case of (4), priority = -1.0 In this way, the priority of each lot is determined and ordered in descending order of priority. By determining the order in which the work is to be started, instructions for starting the work for each lot can be given in consideration of compliance with the delivery deadline.

【0030】実例によつて優先度を求める方式を説明す
る。ロツト情報格納部101の内容からロツトAの納期
が45日であるとすると、ロツトAの最早完成予測日が
33日、平均完成予測日が41日、最遅完成予測日が5
1日であるから、ロツトAの納期は平均完成予測日と最
遅完成予測日との間にある(3)の場合に相当し、優先
度は−0.4となる。同様に、ロツトB、ロツトCにつ
いても完成するまでの最短、平均、最長の工程リ−ドタ
イムを求め、                          
      ロツトB    ロツトC       
     最早完成予測日      18日    
  15日            平均完成予測日 
     20日      20日        
    最遅完成予測日      22日     
 25日が得られたとし、また、ロツトB、ロツトCの
納期がともに19日であつたとすると、いずれも納期が
最早完成予測日と平均完成予測日との間にある(2)の
場合に相当し、ロツトB、ロツトCの優先度はそれぞれ
、0.5、0.2となる。以上の結果からロツトB、ロ
ツトC、ロツトAの順に作業を着手するように作業着手
指示が行なわれる。通常の方法では、ロツトBとロツト
Cの平均完成予測日も納期も同じ値であるため、どちら
のロツトを先に着手すべきかを判定することは困難であ
るが、実施例によれば、完成予測日を区間で求め、これ
をもとに優先度を決定し、優先度の大きい順に作業を着
手するように作業着手順序を決定すれば、納期遵守を考
慮した作業着手指示を行なうことができる。
[0030] A method for determining priorities will be explained using an example. Assuming that the delivery date of lot A is 45 days from the contents of the lot information storage unit 101, the earliest predicted completion date of lot A is 33 days, the average predicted completion date is 41 days, and the latest predicted completion date is 5 days.
Since it is one day, the delivery date of lot A corresponds to case (3), which is between the average predicted completion date and the latest predicted completion date, and the priority is -0.4. Similarly, find the shortest, average, and longest process lead times until completion for lots B and C, and
Lot B Lot C
Earliest expected completion date: 18th
15 days Average expected completion date
20th 20th
Latest expected completion date: 22nd
25 days is obtained, and the delivery dates for both lots B and C are 19 days.In case (2), when both delivery dates are between the earliest predicted completion date and the average predicted completion date, Correspondingly, the priorities of lot B and lot C are 0.5 and 0.2, respectively. Based on the above results, a work start instruction is given to start work on lot B, lot C, and lot A in this order. In the normal method, it is difficult to determine which lot should be started first because the average expected completion date and delivery date for Lot B and Lot C are the same, but according to the example, By determining the predicted date by interval, determining the priority based on this, and determining the work start order so that the work starts in descending order of priority, it is possible to give work start instructions that take delivery deadlines into consideration. .

【0031】図3に作業指示端末221〜223に表示
される作業着手指示画面を示す。着手可能ロツトのロツ
ト名、部品種類、納期とともに、最早完成予測日、平均
完成予測日、最遅完成予測日、優先度が表示され、着手
可能ロツトは優先度の順に並べられているので、作業者
211〜213は作業着手すべきロツトを容易に決定す
ることができる。
FIG. 3 shows a work start instruction screen displayed on the work instruction terminals 221 to 223. Along with the lot name, part type, and delivery date of available lots, the earliest predicted completion date, average predicted completion date, latest predicted completion date, and priority are displayed. The operators 211 to 213 can easily decide which lot to start work on.

【0032】以上の説明では、最短、平均、最長の工程
リ−ドタイムとして工程リ−ドタイム記憶部102に格
納されている固定的なデ−タを用いる場合について述べ
たが、本発明による作業着手順序決定方式を効果的に用
いるためには、最短、平均、最長の工程リ−ドタイムの
値を固定せずに適切に設定する必要がある。そこで、こ
のような最短、平均、最長の工程リ−ドタイムを過去の
工程リ−ドタイム実績を用いて求める方式について説明
する。
In the above explanation, a case has been described in which fixed data stored in the process lead time storage unit 102 is used as the shortest, average, and longest process lead times. In order to effectively use the order determination method, it is necessary to appropriately set the values of the shortest, average, and longest process lead times without fixing them. Therefore, a method for determining the shortest, average, and longest process lead times using past process lead time records will be described.

【0033】実績から最短、平均、最長の工程リ−ドタ
イムを求めるために、各シヨツプごとに各ロツトの着手
、完成の作業実績をバ−コ−ドリ−ダ等の作業実績収集
端末201〜203で収集し、ネツトワ−ク231を介
してシヨツプ管理計算機232に転送し、工程リ−ドタ
イム実績記憶部111に記憶する。各ロツトの工程リ−
ドタイム実績は、ロツトの完成日からロツトの着手日を
引くことによつて容易に求めることができる。工程リ−
ドタイム予測部112では、日あるいは週等の一定期間
ごとに工程リ−ドタイム実績記憶部111から取りだし
た工程リ−ドタイム実績から、部品種類別、シヨツプ別
に最短、最長の工程リ−ドタイム実績を求め、それぞれ
を最短、最長の工程リ−ドタイムとし、また、平均の工
程リ−ドタイムは通常の算術平均を用いて計算により求
め、この結果を工程リ−ドタイム記憶部102に格納す
ることによつて、最新の最短、平均、最長の工程リ−ド
タイムを設定することができる。
[0033] In order to find the shortest, average, and longest process lead times from the actual results, the work results for the start and completion of each lot for each shop are collected on work result collection terminals 201 to 203 such as barcode readers. The information is collected by the process lead time record storage unit 111, transferred to the shop management computer 232 via the network 231, and stored in the process lead time record storage unit 111. Process lead for each lot
The time performance can be easily determined by subtracting the start date of the lot from the completion date of the lot. Process Lee
The lead time prediction unit 112 calculates the shortest and longest process lead times for each part type and shop from the process lead time records retrieved from the process lead time record storage unit 111 for each fixed period such as days or weeks. , respectively, are set as the shortest and longest process lead times, and the average process lead time is calculated using ordinary arithmetic mean, and this result is stored in the process lead time storage unit 102. , the latest shortest, average, and longest process lead times can be set.

【0034】工程リ−ドタイムはまた、シヨツプの作業
負荷量やシヨツプ内仕掛かり(着手後で完了していない
作業)、機械装置の稼動状況等によつても影響を受ける
。そこで、最短、平均、最長の工程リ−ドタイムを、シ
ヨツプの作業負荷量やシヨツプ内仕掛かり、機械装置の
稼動状況等を考慮して求める方法について説明する。 尚、以下の説明ではシヨツプ内仕掛かりのみをを考慮し
た方式について述べるが、同様の考え方を用いれば、作
業負荷量や機械装置の稼動状況等を考慮した各ロツトの
最短、平均、最長の工程リ−ドタイムの予測が可能であ
る。
The process lead time is also affected by the amount of work load in the shop, the work in progress in the shop (work that has not been completed after it has started), the operating status of machinery, and the like. Therefore, a method for determining the shortest, average, and longest process lead times will be explained by taking into account the workload of the shop, the amount of work in progress in the shop, the operating status of machinery, and the like. In the following explanation, we will discuss a method that takes into account only the in-process work in the shop, but if we use the same concept, we can calculate the shortest, average, and longest processes for each lot, taking into account the workload, operating status of machinery, etc. Lead time can be predicted.

【0035】工程リ−ドタイムはシヨツプ内仕掛かりに
影響を受け、シヨツプ内仕掛かりが多くなると工程リ−
ドタイムは長くなり、逆にシヨツプ内仕掛が少なくなる
と工程リ−ドタイムは短くなる。そこで、シヨツプ内仕
掛かりと工程リ−ドタイムとの関係を工程リ−ドタイム
実績記憶部111の作業実績を用いて求めておき、工程
リ−ドタイムの予測を行なうときは、現在のシヨツプ内
仕掛かりと予め求めておいたシヨツプ内仕掛かりと工程
リ−ドタイムとの関係を用いて工程リ−ドタイムを予測
することを考える。以下、部品種類a、シヨツプ1に関
するシヨツプ内仕掛かりと工程リ−ドタイムとの関係を
求める場合を例として説明する。
[0035] Process lead time is affected by the work in progress within the shop, and as the work in progress within the shop increases, the process lead time decreases.
The lead time becomes longer, and conversely, as the amount of in-process work in the shop decreases, the process lead time becomes shorter. Therefore, the relationship between the work in progress within the shop and the process lead time is determined using the work results in the process lead time performance storage unit 111, and when predicting the process lead time, the relationship between the work in progress within the shop and the process lead time is calculated using Let us consider predicting the process lead time using the relationship between the work in progress in the shop and the process lead time, which has been determined in advance. Hereinafter, an example will be explained in which the relationship between the in-process work in the shop and the process lead time for part type a and shop 1 is determined.

【0036】工程リ−ドタイム実績記憶部111に格納
されている部品種類a、シヨツプ1に関する全てのロツ
トについて、シヨツプ内仕掛かりと工程リ−ドタイムと
の関係を求める。以下、上記の条件を満たしているロツ
トAの場合を例に説明する。まず、ロツトA着手時の仕
掛かり数を求める。着手日がロツトAの着手日以前であ
り完成日がロツトAの着手日以降であるようなロツトは
ロツトA着手時にシヨツプ内に仕掛かりとなつているロ
ツトである。
For all lots related to part type a and shop 1 stored in the process lead time record storage unit 111, the relationship between the work in progress in the shop and the process lead time is determined. The case of lot A, which satisfies the above conditions, will be explained below as an example. First, find the number of work in progress when lot A starts. A lot whose start date is before the start date of lot A and whose completion date is after the start date of lot A is a lot that is in progress in the shop when lot A starts.

【0037】図4は、シヨツプ1に関する工程リ−ドタ
イム実績記憶部111の構造及び内容の一部を示したも
のであるが、ロツトAの着手日は2/1であり、ロツト
Bの着手日が1/25、完成日が2/8であるため、ロ
ツトBはロツトA着手時点でシヨツプ1の仕掛かりとな
っている。また、同様にして、ロツトD、ロツトFがロ
ツトA着手時点でシヨツプ1の仕掛となっていることが
わかる。すなわち、ロツトAの着手時点での仕掛かり数
は3である。同様にして、工程リ−ドタイム実績記憶部
111に格納されているシヨツプ1に関する全ての作業
実績(部品種類は無関係)について、ロツトA着手時点
でのシヨツプ1の仕掛かり数を計算する。今、ロツトA
着手時点でのシヨツプ1の仕掛数が30でかつロツトA
のリードタイムが18であつたとすると、部品種類a、
シヨツプ1に関して、仕掛かり数が30であつたときの
工程リ−ドタイムが18日であるという実績を得たこと
になる。同様にして、部品種類がaでかつ既に完成して
いる(完成日のある)全てのロツト(図4ではロツトD
とEが該当する。実際にはもつと多くのロツトが過去の
実績として貯えられる。)について、シヨツプ1に関す
るシヨツプ内仕掛かりと工程リ−ドタイムとの関係を計
算し、この関係をグラフに表わすと図5のようになる。 ここで、個々のロツトを×印で示す。このグラフから部
品種類a、シヨツプ1に関するシヨツプ内仕掛かりと最
短、平均、最長の工程リ−ドタイムとの関係を求める方
法にはいくつかのものが考えられるが、例えば、区間回
帰分析の手法を用いれば、図6のように、シヨツプ内仕
掛かり数(W)と最短、平均、最長の工程リ−ドタイム
(Lmin、Lmean、Lmax)との関係を区間回
帰式によつて、 Lmin=Kmin×W+Dmin Lmean=Kmean×W+DmeanLmax=K
max×W+Dmax のように求めるための係数Kmin、Dmin、Kme
an、Dmean、Kmax、Dmaxを計算すること
ができる。
FIG. 4 shows a part of the structure and contents of the process lead time record storage unit 111 regarding shop 1. The start date of lot A is 2/1, and the start date of lot B is 2/1. Since Lot B is 1/25 and the completion date is 2/8, Shop 1 is in progress at the time Lot A starts. Similarly, it can be seen that Lots D and F are in progress in Shop 1 when Lot A starts. That is, the number of work in progress at the time of starting Lot A is 3. Similarly, the number of works in progress for shop 1 at the time of starting lot A is calculated for all work records for shop 1 (regardless of part type) stored in process lead time record storage unit 111. Now lot A
The number of work in process in shop 1 at the time of start is 30 and lot A
If the lead time of is 18, then part type a,
Regarding Shop 1, we have obtained a track record that the process lead time is 18 days when the number of work in progress is 30. Similarly, all lots with part type a and already completed (with a completion date) (lot D in Figure 4)
and E apply. In reality, many lotteries are stored as past results. ), the relationship between the in-shop work in progress and the process lead time for shop 1 is calculated, and this relationship is expressed in a graph as shown in FIG. Here, individual lots are marked with an x. From this graph, there are several ways to find the relationship between in-process work in the shop and the shortest, average, and longest process lead times for part type a and shop 1. If used, as shown in Figure 6, the relationship between the number of work in progress in the shop (W) and the shortest, average, and longest process lead times (Lmin, Lmean, Lmax) is determined by an interval regression equation, Lmin=Kmin× W+Dmin Lmean=Kmean×W+DmeanLmax=K
Coefficients Kmin, Dmin, Kme to calculate as max×W+Dmax
an, Dmean, Kmax, and Dmax can be calculated.

【0038】シヨツプ1に関する現在のシヨツプ内仕掛
かり数(W)は作業状況記憶部121に格納されている
ので、工程リードタイム予測部112は、上記の区間回
帰式を用いて、部品種類aのシヨツプ1における最短、
平均、最長の工程リ−ドタイムを求めることができる。 例えば、シヨツプ1に関する現在のシヨツプ内仕掛かり
数(W)が35であつたとすると、図6に示すように、
最短、平均、最長の工程リードタイムは、それぞれ13
日、16日、19日、のように求まる。
Since the current number of work-in-progress (W) in the shop regarding shop 1 is stored in the work status storage unit 121, the process lead time prediction unit 112 uses the above interval regression formula to estimate the number of work in progress for part type a. Shortest in shop 1,
The average and longest process lead time can be determined. For example, if the current number of work in progress (W) in shop 1 is 35, as shown in FIG.
The shortest, average, and longest process lead times are 13 each.
Day, 16th, 19th, etc.

【0039】以上のようにして、工程リ−ドタイム実績
記憶部に格納されている過去の工程リ−ドタイム実績を
用いて各ロツトの最短、平均、最長の工程リ−ドタイム
を予測することができるので、実績を反映し、シヨツプ
内仕掛かりや作業負荷量、機械装置の稼動状況等を考慮
した、より正確な完成日の予測が可能となる。
As described above, the shortest, average, and longest process lead times for each lot can be predicted using the past process lead time records stored in the process lead time record storage unit. Therefore, it is possible to more accurately predict the completion date by reflecting actual results and taking into consideration the work in progress in the shop, the amount of work load, the operating status of machinery and equipment, etc.

【0040】なお、上記実施例では各シヨツプに作業者
がおり、作業指示端末からの着手指示に従つて作業が行
なわれる場合について説明したが、シヨツプが高度に自
動化されている場合には、作業着手順序決定方式により
決定された作業着手順序に従つて作業指示端末から作業
着手指示を行なう代わりに直接機械や周辺機器に対して
作業着手の指示を与えることによつて同様の効果が得ら
れることは明らかである。
[0040] In the above embodiment, there is a worker in each shop, and the work is carried out in accordance with the start instructions from the work instruction terminal, but if the shop is highly automated, The same effect can be obtained by directly instructing machines and peripheral equipment to start work instead of instructing them to start work from a work instruction terminal according to the start order determined by the start order determination method. is clear.

【0041】[0041]

【発明の効果】以上詳しく説明したように、本発明によ
れば最早、平均、最遅のように幅を持たせた工程リード
タイムと現在日を用いて、各ロツトの完成日を、最早、
平均、最遅という区間で幅を持たせて予測し、これらの
予測完成日と納期との関係から優先度(緊急性)を求め
、この優先度に従つて各ロツトの作業着手順を決定する
ようにしたので、納期遵守の判断をきめ細かく柔軟に適
切に行なうことができ、納期遵守の可能性を高めること
ができるという効果がある。
Effects of the Invention As explained in detail above, according to the present invention, the completion date of each lot can be determined by using the process lead time and the current date, which have a range of widths such as earliest, average, and latest.
Forecast with a range of average and slowest, determine priority (urgency) from the relationship between these predicted completion dates and delivery dates, and determine the work wear procedure for each lot according to this priority. This has the effect of making it possible to make detailed, flexible and appropriate decisions regarding compliance with delivery dates, thereby increasing the possibility of compliance with delivery dates.

【図面の簡単な説明】[Brief explanation of the drawing]

【図1】本発明の一実施例の概略機能を示す機能構成図
である。
FIG. 1 is a functional configuration diagram showing schematic functions of an embodiment of the present invention.

【図2】本発明の一実施例の適用される全体のシステム
のシステム構成図である。
FIG. 2 is a system configuration diagram of an entire system to which an embodiment of the present invention is applied.

【図3】本発明の一実施例による作業着手指示画面を示
す図である。
FIG. 3 is a diagram showing a work start instruction screen according to an embodiment of the present invention.

【図4】工程リードタイム実績記憶部の構造及び内容を
示す図である。
FIG. 4 is a diagram showing the structure and contents of a process lead time record storage section.

【図5】シヨツプ内仕掛かり数と工程リードタイムとの
関係を表わす図である。
FIG. 5 is a diagram showing the relationship between the number of in-process items in a shop and process lead time.

【図6】シヨツプ内仕掛かり数と最短、平均、最長の工
程リードタイムとの関係を示す図である。
FIG. 6 is a diagram showing the relationship between the number of in-process items in a shop and the shortest, average, and longest process lead times.

【符号の説明】[Explanation of symbols]

101  ロット情報記憶部 102  工程リ−ドタイム記憶部 103  区間完成日予測部 104  着手順序決定部 111  工程リ−ドタイム実績記憶部112  工程
リ−ドタイム予測部 121  作業状況記憶部 122  生産計画記憶部 123  作業負荷演算部
101 Lot information storage unit 102 Process lead time storage unit 103 Section completion date prediction unit 104 Start order determination unit 111 Process lead time performance storage unit 112 Process lead time prediction unit 121 Work status storage unit 122 Production plan storage unit 123 Work Load calculation section

Claims (3)

【特許請求の範囲】[Claims] 【請求項1】  複数の工程で次々と作業することによ
つて完成する複数のロツトの作業着手順序を決定する作
業着手順序決定方式において、各ロツトの部品の種類及
び納期を記憶するロツト情報記憶部と、部品種類別に着
手から完成までの期間である工程リードタイムを最短、
平均、最長で記憶する工程リ−ドタイム記憶部と、部品
の種類に関して前記工程リ−ドタイム記憶部から得られ
る最短、平均、最長の工程リ−ドタイムと現在日を用い
て、完成日を最早、平均、最遅という区間完成日で予測
する区間完成日予測部と、予測した区間完成日と納期か
ら各ロツトの作業着手順序を決定する着手順序決定部と
を構えたことを特徴とする作業着手順序決定方式。
Claim 1: In a work start order determination method that determines the work start order for multiple lots that are completed by successively performing work in multiple processes, a lot information storage that stores the type and delivery date of parts of each lot. Minimize the process lead time, which is the period from start to completion, by department and part type.
Using the process lead time storage unit that stores the average and longest process lead times, and the shortest, average, and longest process lead times obtained from the process lead time storage unit regarding the type of part and the current date, the completion date is determined as soon as possible. Work start is characterized by having a section completion date prediction unit that predicts based on average and latest section completion dates, and a start order determining unit that determines the work start order for each lot based on the predicted section completion date and delivery date. Ordering method.
【請求項2】  部品種類別に過去の工程リ−ドタイム
実績を記憶する工程リ−ドタイム実績記憶部と、前記工
程リードタイム実績記憶部の情報を用いて、最短、平均
、最長の工程リ−ドタイムを求める工程リ−ドタイム予
測部とを備えたことを特徴とする請求項1記載の作業着
手順序決定方式。
[Claim 2] A process lead time record storage unit that stores past process lead time records for each part type, and information in the process lead time record storage unit to determine the shortest, average, and longest process lead times. 2. The work start order determining method according to claim 1, further comprising a process lead time prediction unit that calculates the process lead time.
【請求項3】  現在の作業状況を記憶する作業状況記
憶部と、生産計画を記憶する生産計画記憶部と、前記作
業状況記憶部及び生産計画記憶部のいずれか一方または
両方の情報から該当工程またはシヨツプの作業負荷を計
算する作業負荷演算部とを備え、作業負荷情報を加味し
て工程リ−ドタイムを予測するように構成したことを特
徴とする請求項2記載の作業着手順序決定方式。
3. A work status storage unit that stores the current work status, a production plan storage unit that stores the production plan, and a corresponding process based on information from either or both of the work status storage unit and the production plan storage unit. 3. The work starting order determining method according to claim 2, further comprising: a workload calculation section for calculating the workload of the shop, and is configured to predict the process lead time by taking into account the workload information.
JP3146623A 1991-05-23 1991-05-23 Work starting order deciding system Pending JPH04348856A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3146623A JPH04348856A (en) 1991-05-23 1991-05-23 Work starting order deciding system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3146623A JPH04348856A (en) 1991-05-23 1991-05-23 Work starting order deciding system

Publications (1)

Publication Number Publication Date
JPH04348856A true JPH04348856A (en) 1992-12-03

Family

ID=15411925

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3146623A Pending JPH04348856A (en) 1991-05-23 1991-05-23 Work starting order deciding system

Country Status (1)

Country Link
JP (1) JPH04348856A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05131345A (en) * 1991-11-12 1993-05-28 Nec Kyushu Ltd Production progress control system
JPH06203034A (en) * 1992-12-28 1994-07-22 Sharp Corp Information processor with memorandum function
JPH0916671A (en) * 1995-06-28 1997-01-17 Nec Corp Production schedule preparing device
JP2003050612A (en) * 2001-08-07 2003-02-21 Kawasaki Microelectronics Kk Production management method and system
JP2012242950A (en) * 2011-05-17 2012-12-10 Toyota Motor Corp Work priority setting method and work priority setting device

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05131345A (en) * 1991-11-12 1993-05-28 Nec Kyushu Ltd Production progress control system
JPH06203034A (en) * 1992-12-28 1994-07-22 Sharp Corp Information processor with memorandum function
JPH0916671A (en) * 1995-06-28 1997-01-17 Nec Corp Production schedule preparing device
JP2003050612A (en) * 2001-08-07 2003-02-21 Kawasaki Microelectronics Kk Production management method and system
JP2012242950A (en) * 2011-05-17 2012-12-10 Toyota Motor Corp Work priority setting method and work priority setting device

Similar Documents

Publication Publication Date Title
Sadeh Micro-opportunistic scheduling: The micro-boss factory scheduler
Frantzén et al. A simulation-based scheduling system for real-time optimization and decision making support
US6434440B1 (en) Production estimate management system
US5826040A (en) Method and system for production planning
JPH09153090A (en) Method and device for forming working process production plan
JPH09259181A (en) Work flow managing system
JPH04348856A (en) Work starting order deciding system
WO2022014048A1 (en) Scheduler system, scheduler management device, and machine learning device
Hegde et al. Engineering changes and time delays: a field investigation
JPH03251351A (en) Production progress management device
JP3240237B2 (en) Production planning system
JPH1196222A (en) Method for managing process progress and its device
Jiang et al. An adaptive agile manufacturing control infrastructure based on TOPNs-CS modelling
JPH08126942A (en) Production line operation management method and device thereof
McKay et al. Decision support for production scheduling tasks in shops with much uncertainty and little autonomous flexibility
JPH05174030A (en) Job shop scheduling expert system
JP3491558B2 (en) Alternative lot determination system
JP3195385B2 (en) Production planning system and production planning method
JPH04347769A (en) Process management device
US6266646B1 (en) Method and apparatus for providing choices for a facility
JPH08227432A (en) Virtual process execution system
JPH1086044A (en) Worker's discretion utilization schedule planning method and device therefor
De Swaan Arons et al. Integration of dynamic expert scheduling in production control
JPH02224954A (en) Production control system
Dhar Overview of models and DSS in planning and scheduling of FMS