JP2005018596A - Scheduling apparatus and scheduling program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To efficiently generate suitable production schedules. <P>SOLUTION: A scheduling apparatus is provided with four schedulers for determining the processing order of six products in each four processes and a controller for instructing the schedulers to transmit/receive data between the schedulers and to carry out scheduler's processing. A CPU 12a1 in each scheduler is provided with: a estimated time calculation part 12a12 for finding the processing start scheduling time and processing end scheduling time of each product; an evaluation part 12a13 for evaluating the production efficiency of a production schedule by using the found processing start estimated time and processing end estimated time of each product; a schedule changing part 12a15 for changing the production schedule; and a data output part 12a16 for outputting the processing end estimated time information of each product which is found out by the estimated time calculation part 12a12. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

ただし、ｉ＝１〜４であって、ここでは、ｉ＝２であり、重みαｉ、βｉ、γｉは、後述する重み記憶部１２ａ２３に格納されているものである。評価関数Ｅｉの第１項は、生産効率を評価するための評価項目であり、第２項及び第３項は、納期の達成度を評価するための評価項目である。なお、評価関数Ｅｉの第２項及び第３項の遅れ時間が「０」未満である場合には、「０」として取り扱うものとする。
【００４８】
ここで、評価関数Ｅｉで使用される納期の達成度を評価するための指標について図４及び図５を用いて説明する。図４は、後工程納期の説明図の一例であり、図５は、後工程処理可能時刻の説明図の一例である。図４及び図５において横軸は時間Ｔであり、縦方向に工程ｉ及びその直前工程である工程（ｉ−１）、直後工程である工程（ｉ＋１）の生産スケジュールの一部を上から下に通過工程順に示している。図中の処理時間Ｊ０、Ｊ１はそれぞれ製品Ｐ０、Ｐ１の各工程における処理時間である。また、ここでは、便宜上、工程間のリードタイムが「０」であるものとして（工程間のリードタイムを無視して）説明する。
【００４９】
図４、図５において、時刻Ｔ０は工程ｉにおける製品Ｐ１の工程納期の時刻である。ここで、工程納期とは、出荷納期と工程間の平均的なリードタイムとから計算した仮想的な納期の時刻であり、各工程で出荷納期を考慮した生産スケジュールを生成する目的で導入されている。時刻ＴＦ１は工程ｉにおける製品Ｐ１の処理終了予定時刻（処理時間Ｊ１の終了予定タイミング）である。ここでは、工程ｉにおける製品Ｐ１については、工程納期の時刻Ｔ０に対して処理終了予定時刻ＴＦ１が時間Ａだけ遅れている。
【００５０】
図４において、時刻Ｔ１は工程（ｉ＋１）における製品Ｐ１の処理開始予定時刻である。ここでは、工程ｉにおける製品Ｐ１については、直後工程（ｉ＋１）の処理開始予定時刻Ｔ１に対して処理終了予定時刻ＴＦ１が時間Ｂだけ遅れている。従来の生産スケジュールは、工程納期の時刻Ｔ０に対する処理終了予定時刻ＴＦ１の遅れ時間Ａ及び直後工程（ｉ＋１）の処理開始予定時刻Ｔ１に対する処理終了予定時刻ＴＦ１の遅れ時間Ｂを用いて評価されていた。
【００５１】
図５において、時刻Ｔ２は工程（ｉ＋１）における製品Ｐ１の直前に処理される製品Ｐ０の処理終了予定時刻（この時刻Ｔ２から工程（ｉ＋１）において製品Ｐ１の処理を開始することが可能であるため、製品Ｐ１の処理開始可能時刻という）である。ここでは、工程ｉにおける製品Ｐ１については、直後工程（ｉ＋１）の処理開始可能時刻Ｔ２に対して処理終了予定時刻ＴＦ１が時間Ｃだけ遅れている。本発明の生産スケジュールは、工程納期の時刻Ｔ０に対する処理終了予定時刻ＴＦ１の遅れ時間Ａ及び直後工程（ｉ＋１）の処理開始可能時刻Ｔ２に対する処理終了予定時刻ＴＦ１の遅れ時間Ｃを用いて評価される。
【００５２】
遅れ時間Ｂは、直後工程（ｉ＋１）の処理開始予定時刻Ｔ１に対する処理終了予定時刻ＴＦ１の遅れを表しており、これを「０」以下にしないと実行可能な生産スケジュールとはならない。これに対して、遅れ時間Ｃは、直後工程（ｉ＋１）の処理開始可能時刻Ｔ２に対する処理終了予定時刻ＴＦ１の遅れを表しており、これを「０」に近づけることで工程（ｉ＋１）の生産効率が向上する。つまり、遅れ時間Ｂは、実行可能な生産スケジュールを生成する上で必須の条件（最低限満たすべき条件）を規定するものであるのに対して、遅れ時間Ｃは更に厳しい納期条件を規定するものである。
【００５３】
再び図３に示す構成図に戻って説明する。重み設定部１２ａ１４は、上記（１）式で定義される評価関数Ｅｉの重みαｉ、βｉ、γｉ（ここでは、ｉ＝２）を設定するものである。また、重み設定部１２ａ１４は、スケジュール変更部１２ａ１５によって求められるスケジュール変更回数Ｎｉの増加に伴って納期の達成度を評価するための評価項目の重みγｉを大きくするものである。例えば、重みγｉを次の（２）式を用いて求める。
【００５４】
γｉ＝Ｍ０＋Ｍ１×［１−ｅｘｐ（−Ｋｉ×Ｎｉ）］ （２）
ただし、係数Ｍ０、Ｍ１は正の定数（例えば、Ｍ０＝１、Ｍ１＝２）であり、係数Ｋｉ（ｉ＝１〜４）は、スケジュール変更回数Ｎｉの増加に伴う重みγｉの増大速度を決定する係数であって、係数Ｋｉの値が大きい程、重みγｉは速く増大する（図６（ａ）参照）。例えば、生産効率を重視する工程である場合には、係数Ｋｉの値を小さく設定し、納期を重視する工程である場合には、係数Ｋｉの値を大きく設定すると、適切な生産スケジュールが生成される。
【００５５】
ここで、図６を用いて、係数Ｋｉの意味について具体的に説明する。図６は、係数Ｋｉの重みγｉ及び生産スケジュールに及ぼす影響についての説明図の一例である。（ａ）は係数Ｋｉの変化に伴う重みγｉの変化のグラフであって、（ｂ）は係数Ｋｉの値の生産スケジュールへの影響を表す図である。
【００５６】
（ａ）のグラフの横軸は、スケジュール変更回数Ｎｉ（ここでは、工程ｉ１のスケジュール変更回数Ｎｉ１、工程ｉ２のスケジュール変更回数Ｎｉ２）であって、縦軸は重みγｉ（ここでは、工程ｉ１の重みγｉ１、工程ｉ２の重みγｉ２）である。ここでは、工程ｉ１の係数Ｋｉである係数Ｋｉ１が工程ｉ２の係数Ｋｉである係数Ｋｉ２より大きい場合を図示している。係数Ｋｉが大きい程、少ないスケジュール変更回数Ｎｉで重みγｉが増大する（増大速度が速い）。従って、工程ｉ１の重みγｉ１は、工程ｉ２の重みγｉ２より速く増大する。
【００５７】
（ｂ）の図において横軸は時間Ｔであり、縦方向に工程ｉ１及びその直後工程である工程ｉ２、さらにその直後工程について本発明のスケジューリング装置によって生成された生産スケジュールの一部を上から下に通過工程順に示している。工程ｉ１の重みγｉ１は速く増大するため、生産効率と比較して納期の達成度に関する評価が厳しく、逆に、工程ｉ２の重みγｉ２の増大する速度が遅いため、納期の達成度と比較して生産効率に関する評価が厳しい。そこで工程ｉ２は生産効率の良好なスケジュールが生成されている。つまり、生産効率を重視する工程である場合には、係数Ｋｉの値を小さく設定し、納期を重視する工程である場合には、係数Ｋｉの値を大きく設定すると、適切な生産スケジュールが生成される。
【００５８】
再び図３の構成図に戻って説明する。スケジュール変更部１２ａ１５は、評価部１２ａ１３による評価結果に基づいて、自工程（工程２）の生産スケジュールを変更し、後述するスケジュール記憶部１２ａ２１に更新的に格納するものである。具体的には、（１）式で定義される評価関数Ｅｉの値を最小化するための生産スケジュールを求め、その生産スケジュールに変更するものである。評価関数Ｅｉの値を最小化するための生産スケジュールを求める手法としては、ＳＡ（Ｓｉｍｕｌａｔｅｄ Ａｎｎｅａｌｉｎｇ）法、ＧＡ（Ｇｅｎｅｔｉｃ Ａｌｇｏｌｉｔｈｍ）、局所探索法等の最適化法を用いることができる。ここでは、ＳＡ法を用いるものとする。
【００５９】
データ出力部１２ａ１６は、制御手段２からのデータの授受の指示を受け付けて、自工程（工程２）の直後工程（工程３）のスケジューラ１３（データ取得部１３ａ１１）に対して、予定時刻算出部１２ａ１２によって求められた各製品の処理終了予定時刻情報を出力すると共に、自工程（工程２）の直前工程（工程１）のスケジューラ１１（データ取得部１１ａ１１）に対して、予定時刻算出部１２ａ１２によって求められた各製品の直前に処理される製品の処理終了予定時刻である処理開始可能時刻情報を出力するものである。
【００６０】
ＲＡＭ１２ａ２は、自工程（工程２）における製品の処理順序である生産スケジュール情報を更新的に格納するスケジュール記憶部（工程別スケジュール記憶部に相当する）１２ａ２１と、自工程（工程２）における各製品の処理時間（処理に要する時間）情報を格納する処理時間記憶部１２ａ２２と、重み設定部１２ａ１４によって設定された重み情報を更新的に格納する重み記憶部１２ａ２３とを備えている。
【００６１】
スケジュール記憶部１２ａ２１は、自工程（工程２）における製品の処理順序である生産スケジュール情報を更新的に格納するものであって、初期スケジュール生成部１２ａ１０によって生成された生産スケジュールの初期値が格納されており、スケジュール変更部１２ａ１５によって生産スケジュールが変更された場合に更新されるものである。なお、生産スケジュールの初期値は、例えば、外部からの入力を受け付けて予め設定されている形態でもよい。
【００６２】
処理時間記憶部１２ａ２２は、予定時刻算出部１２ａ１２で使用する各製品の自工程（工程２）での処理時間情報を格納するものである。この処理時間情報は、予め外部からの入力を受け付けて設定する形態でもよいし、製品の重量、サイズ等の条件から算出して設定する形態でもよい。
【００６３】
重み記憶部１２ａ２３は、重み設定部１２ａ１４によって設定された重み情報を更新的に格納するものである。具体的には、評価関数Ｅｉの重みαｉ、βｉ、γｉの値を格納するものである。ここでは、重みαｉ、βｉは定数であり、重みγｉは上述の（２）式に従って、スケジュール変更回数Ｎｉによってその値が変化する変数である。
【００６４】
図７は、制御装置２のハード構成図の一例である。制御装置２は、パーソナルコンピュータ等からなり制御装置２の全体の動作を制御する制御部２ａと、外部からの操作を受け付ける操作部２ｂと、外部に音声を出力するスピーカ２ｃと、外部に画像を出力するモニタ２ｄと、ＬＡＮ３を介してスケジューラ１１〜１４２と通信を行うネットワーク通信部２ｅとがデータ伝送路であるバスＢＡ２を介して接続されている。
【００６５】
制御部２ａは制御装置２の全体の動作を制御するもので、情報処理部（ＣＰＵ）２ａ１と、処理途中の情報等を一時的に格納するＲＡＭ２ａ２と、所定の画像情報等が予め記憶されたＲＯＭ２ａ３とを備えている。
【００６６】
描画処理部２ｄ１は制御部２ａからの画像表示指示に従って所要の画像をモニタ２ｄに表示させるもので、ビデオＲＡＭ等を備えている。音声再生部２ｃ１は制御部２ａからの指示に従って所定のメッセージやＢＧＭ等をスピーカ２ｃに出力するものである。ＲＯＭ２ａ３に記憶された各種データのうち装着脱可能な記録媒体に記憶され得るデータは、例えばハードディスクドライブ、光ディスクドライブ、フレキシブルディスクドライブ、シリコンディスクドライブ、カセット媒体読み取り機等のドライバで読み取り可能にしてもよく、この場合、記録媒体は、例えばハードディスク、光ディスク、フレキシブルディスク、ＣＤ、ＤＶＤ、半導体メモリ等である。
【００６７】
ネットワーク通信部２ｅは、各種データをＬＡＮ３からなるネットワークを介してスケジューラ１１〜１４と送受信するためのものである。インターフェイス部２ｂ１は、操作部２ｂとの間のデータの授受を行なうためのものである。制御部２ａは、このネットワーク通信部２ｅを介してスケジューラ１１〜１４から送信された種々の情報を用いて各種の処理を行う。
【００６８】
なお、本発明のスケジューリングプログラムの一部は、ＲＯＭ２ａ３に記録されており、ＲＡＭ２ａ２上にロードされ、ＣＰＵ２ａ１によりＲＡＭ２ａ２上のスケジューリングプログラムが順次実行されることによってそれぞれの機能が実現される。
【００６９】
図８は、制御部２ａの機能構成図の一例である。ＣＰＵ２ａ１は、スケジューラ１１〜１４の処理の実行を指示する処理実行制御部２ａ１１と、スケジューラ１１〜１４に対してスケジューラ１１〜１４間のデータの授受を指示する入出力制御部２ａ１２とを備える。
【００７０】
処理実行制御部２ａ１１は、スケジューラ１１〜１４の初期スケジュール生成部１１ａ１０〜１４ａ１０、予定時刻算出部１１ａ１２〜１４ａ１２、評価部１１ａ１３〜１４ａ１３、重み設定部１１ａ１４〜１４ａ１４及びスケジュール変更部１１ａ１５〜１４ａ１５に対して処理の実行を指示するものである。各スケジューラ１１〜１４はそれぞれ独立に、且つ、並行して処理を行うため、処理実行制御部２ａ１１は、その処理の実行タイミングの調整を行うと共に、スケジューラ１１〜１４の評価関数Ｅｉ（ｉ＝１〜４）の値を用いて終了判定を行うものである。
【００７１】
入出力制御部２ａ１２は、スケジューラ１１〜１４のデータ取得部１１ａ１１〜１４ａ１１に対してデータの取得を指示すると共に、データ出力部１１ａ１６〜１４ａ１６に対してデータの出力を指示し、スケジューラ１１〜１４間のデータの授受を制御するものである。
【００７２】
図９は、制御部２ａの処理の概要を表すフローチャートの一例である。まず、制御部２ａの処理実行制御部２ａ１１によって、スケジューラ１１〜１４の初期スケジュール生成部１１ａ１０〜１４ａ１０に対して、初期生産スケジュールを生成する旨の指示情報が出力され、次いで、スケジューラ１１〜１４の予定時刻算出部１１ａ１２〜１４ａ１２、評価部１１ａ１３〜１４ａ１３及びスケジュール変更部１１ａ１５〜１４ａ１５に対して順次処理の実行が指示される（ステップＳ１）。ここでは、ステップＳ１で行われる処理の指示を初期スケジュールの処理指示という。
【００７３】
そして、制御部２ａの制御部２ａの処理実行制御部２ａ１１からの処理を実行する旨の指示情報が受け付けられて、によって、スケジューラ１１〜１４のデータ取得部１１ａ１１〜１４ａ１１及びデータ出力部１１ａ１６〜１４ａ１６に対してデータの授受の指示情報が出力される（ステップＳ３）。ここでは、ステップＳ３で行われる処理の指示を情報交換処理指示という。
【００７４】
つぎに、制御部２ａの処理実行制御部２ａ１１によって、スケジューラ１１〜１４の予定時刻算出部１１ａ１２〜１４ａ１２、評価部１１ａ１３〜１４ａ１３及びスケジュール変更部１１ａ１５〜１４ａ１５に対して順次処理の実行が指示される（ステップＳ５）。ここでは、ステップＳ５で行われる処理の指示をスケジュール変更処理指示という。
【００７５】
そして、制御部２ａの入出力制御部２ａ１２によって、ステップＳ３と同様の情報交換処理指示が行われる（ステップＳ７）。次いで、ステップＳ５での指示に従ってスケジューラ１１〜１４の評価部１１ａ１３〜１４ａ１３によって得られる評価関数Ｅｉ（ｉ＝１〜４）の値を用いて制御部２ａの処理実行制御部２ａ１１によって終了判定処理が行われる（ステップＳ９）。終了判定処理とは、例えば、評価関数Ｅｉ（ｉ＝１〜４）の値が全て所定値（例えば、１）以下となった場合に処理を終了すると判定するものである。
【００７６】
ステップＳ９において処理を終了すると判定された場合には、処理が終了される。ステップＳ９において処理を終了しないと判定された場合には、制御部２ａの処理実行制御部２ａ１１によって、スケジューラ１１〜１４の重み設定部１１ａ１４〜１４ａ１４に対して重みγｉを変更する旨の指示情報が出力され（ステップＳ１１）、ステップＳ５に戻り、ステップＳ５からステップＳ９の処理が繰り返し実行される。
【００７７】
図１０は、図９のステップＳ１及びステップＳ３に対応するスケジューラ１１〜１４の処理を表すフローチャートの一例である。ここでは、便宜上、スケジューラ１２について説明する。まず、初期スケジュール生成部１２ａ１０によって、制御部２ａの処理実行制御部２ａ１１からの初期生産スケジュールを生成する旨の指示情報が受け付けられて、初期生産スケジュールが生成される（ステップＳ１０１）。次いで、予定時刻算出部１２ａ１２によって、制御部２ａの処理実行制御部２ａ１１からの処理を実行する旨の指示情報が受け付けられて、処理開始予定時刻および処理終了予定時刻が求められる（ステップＳ１０３）。そして、データ出力部１２ａ１６によって、制御部２ａの入出力制御部２ａ１２からのデータを出力する旨の指示情報が受け付けられて、処理終了予定時刻情報及び処理開始可能時刻情報が出力され（ステップＳＴ５、７）、処理が終了される。
【００７８】
図１１は、図９のステップＳ５〜Ｓ１１に対応するスケジューラ１１〜１４の処理を表すフローチャートの一例である。ここでは、便宜上、スケジューラ１２について説明する。まず、データ取得部１２ａ１１によって、制御部２ａの入出力制御部２ａ１２からのデータを取得する旨の指示情報が受け付けられて、各製品の直前工程（工程１）における処理終了予定時刻情報及び直後工程（工程３）の処理開始可能時刻情報が取得される（ステップＳ５０１、５０３）。そして、予定時刻算出部１２ａ１２によって、制御部２ａの処理実行制御部２ａ１１からの処理を実行する旨の指示情報が受け付けられて、スケジュール記憶部１２ａ２１から自工程（工程２）の生産スケジュール情報が読み出され、処理開始予定時刻及び処理終了予定時刻が求められる（ステップＳ５０５、５０７）。
【００７９】
つぎに、評価部１２ａ１３によって、制御部２ａの処理実行制御部２ａ１１からの処理を実行する旨の指示情報が受け付けられて、評価関数Ｅｉ（ｉ＝２）の値が求められる（ステップＳ５１１）。そして、所定の終了条件（例えば評価関数Ｅｉ（ｉ＝２）の値が３回減少する、又は、スケジュールが３回更新された）を満たすか否かの判定が行われる（ステップＳ５１３）。終了条件を満たさないと判定された場合には、スケジュール変更部１１ａ１５によって、制御部２ａの処理実行制御部２ａ１１からの処理を実行する旨の指示情報が受け付けられて、生産スケジュールが変更される（ステップＳ５１５）。そして、重み設定部１２ａ１４によって、制御部２ａの処理実行制御部２ａ１１からの処理を実行する旨の指示情報が受け付けられて、重みγｉが変更され（ステップＳ５１６）、ステップＳ５０１に戻り、ステップＳ５０１からステップＳ５１３の処理が繰り返し実行される。
【００８０】
ステップＳ５１３において、終了条件を満たすと判定された場合には、データ出力部１２ａ１６によって、制御手段２の入出力制御部２ａ１２からのデータの授受の指示が受け付けられて、各製品の処理終了予定時刻及び処理開始可能時刻が出力され（ステップＳ５１７、５１９）、処理が終了される。
【００８１】
ここで、図１２〜図１６を用いてスケジューリング装置１によって生成される生産スケジュールの一例を説明する。ここでは、製品１〜製品６が工程１〜工程４の順に処理される場合の生産スケジュールについて説明する。図１２は、段取り替えの要否を表す図表の一例である。（ａ）〜（ｄ）はそれぞれ工程１〜工程４の段取り替え要否を表す図表である。段取り替えの要否は、前に処理される製品とその直後に処理される製品との種類によって決定する。各図表において、各行が前に処理される製品であり、各列が後に処理される製品である。ここで、×印は段取り替えが必要であることを表し、○印は段取り替えが不要であることを表す。例えば、工程１において、製品１の後に製品４を処理する場合には製品４の処理開始の前に段取り替えが必要であり、製品１の後に製品２を処理する場合には製品２の処理開始の前の段取り替えは不要である。
【００８２】
図１３は、図１０のフローチャートのステップＳ１０１において生成される初期生産スケジュールを表す図表の一例である。横軸は工程１における製品（ここでは製品１）の処理を開始した時点を原点とする経過時間であり、縦方向には工程１〜工程４の生産スケジュールをこの順に記載している。ここで、各製品の処理時間は、白抜きの四角で表し、白抜きの四角内の数字は製品番号を表している。また、斜線付きの四角は段取り替えを表している。また、最下部の▲印は、製品１〜製品６の工程４における工程納期（工程４が最終工程である場合には納期となる）Ｔ１０〜Ｔ６０のタイミングを表している。
【００８３】
例えば、工程２では、製品５、製品６、製品３、製品１、製品４、製品２の順に処理され、製品５の処理終了から製品６の処理開始までの間に５０分の待ち時間が発生しており、製品６と製品３、製品１と製品４、製品４と製品２との処理の間には段取り替えが発生している（図１２（ｂ）参照）。この初期スケジュールでは、全ての製品（製品１〜製品６）について工程４の工程納期に対して処理終了予定時刻が遅れており、工程納期遅延が発生している。
【００８４】
図１４は、図１０のフローチャートのステップＳ１０３において行われる情報交換処理の説明図の一例である。横軸は工程１における製品（ここでは製品１）の処理を開始した時点を原点とする経過時間であり、縦方向には工程１、工程２（または、工程１〜工程３）の生産スケジュールをこの順に記載している。（ａ）は、工程１の製品６に関する情報交換処理の説明図であり、（ｂ）は、工程２の製品４に関する情報交換処理の説明図である。
【００８５】
（ａ）において、工程２の製品６の処理の直前に製品５の処理が予定されており、製品５の処理終了予定時刻が８０分であるから、工程２における製品６の処理開始可能時刻は８０分である。そこで、図１１のフローチャートのステップＳ５１５において行われるスケジュール変更処理では、工程１における製品６の処理終了予定時刻が７０分（＝８０分−１０分（＝工程間リードタイム））以前となるように工程１の生産スケジュールの変更が行なわれる。
【００８６】
（ｂ）において、工程２の製品４に関して、直前工程（工程１）の処理終了予定時刻は８０分であり、直後工程（工程３）の処理開始可能時刻は２２０分である。そこで、図１１のフローチャートのステップＳ５１５において行われるスケジュール変更処理では、工程２における製品４の処理開始予定時刻が９０分（＝８０分＋１０分（＝工程間リードタイム））以降で、且つ、２１０分（＝２２０分−１０分（＝工程間リードタイム））以前となるように工程２の生産スケジュールの変更が行なわれる。
【００８７】
図１５は、図１３に示す初期生産スケジュールが図１１のフローチャートのステップＳ５１５において行われるスケジュール変更処理によって変更されて得られた生産スケジュールを表す図表の一例である。横軸は工程１における製品（ここでは製品１）の処理を開始した時点を原点とする経過時間であり、縦方向には工程１〜工程４の生産スケジュールをこの順に記載している。ここで、各製品の処理時間は、白抜きの四角で表し、白抜きの四角内の数字は製品番号を表している。また、斜線付きの四角は段取り替えを表している。また、最下部の▲印は、製品１〜製品６の工程４における工程納期（工程４が最終工程である場合には納期となる）Ｔ１０〜Ｔ６０のタイミングを表している。
【００８８】
例えば、図１４（ａ）を用いて説明した工程１の製品６については、処理終了予定時刻が７０分（＝８０分−１０分（＝工程間リードタイム））以前となるように工程１の生産スケジュールの変更が行なわれている。また、図１４（ｂ）を用いて説明した工程２の製品４については、工程２における製品４の処理開始予定時刻が９０分（＝８０分＋１０分（＝工程間リードタイム））以降で、且つ、２１０分（＝２２０分−１０分（＝工程間リードタイム））以前となるように工程２の生産スケジュールの変更が行なわれている。更に、工程１〜工程４の段取り替えの回数が、初期スケジュールでは、それぞれ２回、３回、３回、１回であったが、図１５に示す変更後の生産スケジュールでは、それぞれ１回、２回、１回、１回と全体的に減少し、生産効率が向上されている。
【００８９】
一方、製品４については、工程１での処理終了予定時刻よりも工程２での処理開始予定時刻が早く、製品５については、工程２での処理終了予定時刻よりも工程３での処理開始予定時刻が早く実行不可能な生産スケジュールとなっている。
本来は、直後工程での処理開始予定時刻からの遅れが有ると工程間の生産スケジュールに不整合があることになる（すなわち、実行不可能な生産スケジュールとなる）が、「生産スケジュールを更新する過程で制約を満たす（すなわち、実行可能な）生産スケジュールを得る」方法を採用しているため、各製品の処理終了予定時刻の直後工程での処理開始予定時刻からの遅れが無いことを生産スケジュールの制約条件とはせずに、評価項目として評価関数に含めていることに起因している。
【００９０】
図１６は、図１３に示す初期生産スケジュールに対してスケジュール変更処理が施され最終的に得られた生産スケジュールを表す図表の一例である。横軸は工程１における製品（ここでは製品１）の処理を開始した時点を原点とする経過時間であり、縦方向には工程１〜工程４の生産スケジュールをこの順に記載している。ここで、各製品の処理時間は、白抜きの四角で表し、白抜きの四角内の数字は製品番号を表している。また、斜線付きの四角は段取り替えを表している。また、最下部の▲印は、製品１〜製品６の工程４における工程納期（工程４が最終工程である場合には納期となる）Ｔ１０〜Ｔ６０のタイミングを表している。
【００９１】
各工程１〜４での生産スケジュールが適正化され、全ての製品１〜６について工程４の工程納期Ｔ１０〜Ｔ６０に対する遅延が解消されている。また、生産効率を重視する工程である工程３では、段取り替えの回数が「０」となり、生産効率の高い生産スケジュールとなっている。
【００９２】
上述のように、スケジューラ１〜４によって、生産ラインを構成する４つの工程毎に複数（ここでは６つ）の製品の処理順序が決定され、制御装置２によって、スケジューラ１〜４に対して、スケジューラ１〜４間におけるデータの授受が指示されると共に、スケジューラ１〜４の処理の実行が指示されるため、効率的にライン全体の生産スケジュールが決定される。
【００９３】
また、スケジューラ１〜４において、評価部１１ａ１３〜１４ａ１３によって、予定時刻算出部１１ａ１２〜１４ａ１２により求められた各製品の処理開始予定時刻及び処理終了予定時刻を用いて工程別の生産スケジュールの生産効率が評価され、スケジュール変更部１１ａ１５〜１４ａ１５によって、評価部１１ａ１３〜１４ａ１３による評価結果（評価関数Ｅｉの値）に基づいて工程別に生産スケジュールが変更されため、各工程の生産効率に関して適切な生産スケジュールが生成される。
【００９４】
更に評価部１１ａ１３〜１４ａ１３によって、データ取得部１１ａ１１〜１４ａ１１により取得された処理開始可能時刻を用いて工程別の生産スケジュールの納期の達成度が評価され、スケジュール変更部１１ａ１５〜１４ａ１５によって、評価部１１ａ１３〜１４ａ１３による評価結果（評価関数Ｅｉの値）に基づいて工程別に生産スケジュールが変更されため、各工程の生産効率及び納期達成度に関して適切な生産スケジュールが生成される。
【００９５】
加えて、評価部１１ａ１３〜１４ａ１３によって、重み記憶部１１ａ２３〜１４ａ２３の重み情報を用いた重み付き加算を行う所定の評価関数Ｅｉの値を求めることによって生産スケジュールが評価されるため、簡単な計算で生産スケジュールの評価が行われる。
【００９６】
また、スケジューラ１〜４の重み設定部１１ａ１４〜１４ａ１４によって、重み記憶部１１ａ２３〜１４ａ２３に格納する重みが工程毎に設定されるため、工程の特徴に応じた適切な重みを設定することが可能となる。
【００９７】
更に、スケジュール変更部１１ａ１５〜１４ａ１５によって、生産スケジュールの変更回数Ｎｉがカウントされ、重み設定部１１ａ１４〜１４ａ１４によって、変更回数Ｎｉの増大に応じて納期の達成度の重みγｉが大きく設定されため、生産性及び納期に関して適切な生産スケジュールが得られる。
【００９８】
加えて、生産ラインを構成する複数の工程１〜４の内、１の工程（ここでは工程４）の重み設定部１４ａ１４によって、他の工程１〜３の重み設定部１１ａ１１４〜１３ａ１４と比較して、変更回数Ｎｉの増大に応じた納期の達成度の重みγｉがより早く増加される。そこで、工程４の重み設定部１４ａ１４が他の工程１〜３の重み設定部１１ａ１１４〜１３ａ１４と比較して変更回数Ｎｉの増大に応じた納期の達成度の重みγｉをより早く増加させるため、納期を達成可能な生産スケジュールが生成される。
【００９９】
なお、本発明は、以下の態様にも適用可能である。
【０１００】
（Ａ）本実施形態では、生産ラインが全製品の処理される工程の順序が同一である（フローショップ型という）生産ラインである場合について説明したが、製品の種類によって処理される工程の順序が異なる（ジョブショップ型という）生産ラインである場合にも本発明は適用可能である。以下、ジョブショップ型生産ラインに適用されるスケジューリング装置１’について説明する。ただし、上述のフローショップ型生産ラインに適用されるスケジューリング装置１と同一の構成については省略し、異なる箇所についてのみ説明する。
【０１０１】
図１７は、ジョブショップ型生産ラインに適用されるスケジューリング装置１’の構成図の一例である。スケジューリング装置１’は、４つの工程毎に６つの製品の処理順序を決定する４つのスケジューラ１１’〜１４’と、スケジューラ１１’〜１４’に対して、スケジューラ１１’〜１４’間におけるデータの授受を指示すると共に、スケジューラ１１’〜１４’の処理の実行を指示する制御装置２と、スケジューラ１１’〜１４’間で授受されるデータを格納するスケジュールＤＢ４を備えている。スケジューラ１１’〜１４’は、各製品の処理開始予定時刻、処理終了予定時刻及び処理開始可能時刻をスケジュールＤＢ４を介して授受する。つまり、各スケジューラ１１’〜１４’は、各製品の処理開始予定時刻及び処理終了予定時刻、処理開始可能時刻を書き込み、評価関数Ｅｉの値に基づいて生産スケジュールを変更する際に使用するデータである直前工程の各製品の処理終了予定時刻情報及び直後工程の各製品の処理開始可能時刻をスケジュールＤＢ４から読み出すことによって取得する。
【０１０２】
なお、製品の種類によって処理される工程の順序が異なる場合だけでなく、製品の種類によって処理されない（処理を省略される）工程が存在する場合にも図１７に示すスケジューリング装置１’は適用可能である。
【０１０３】
（Ｂ）本実施形態では、生産ラインが４つの工程からなる場合について説明したが、複数の工程からなる形態であればよい。生産ラインを構成する工程の数が多い程、効率的に適切な生産スケジュールが生成されるという本願発明の効果が更に顕在化する。
【０１０４】
（Ｃ）本実施形態では、生産スケジュールを決定する対象となる製品の個数が６個である場合について説明したが、複数の製品であればよい。製品の個数が多い程、効率的に適切な生産スケジュールが生成されるという本願発明の効果が更に顕在化する。
【０１０５】
（Ｄ）本実施形態では、スケジューラ１１〜１４が各製品の各工程での処理時間格納する処理時間記憶部１１ａ２２〜１４ａ２２を備える場合について説明したが、処理時間を製品の条件（重量、サイズ、処理条件等）に基づいて求める形態でもよい。
【０１０６】
（Ｅ）本実施形態では、スケジューラ１１〜１４のデータ出力部１１ａ１６〜１４ａ１６が処理終了予定時刻情報及び処理開始可能時刻情報を出力し、データ取得部１１ａ１１〜１４ａ１１が直前工程の処理終了予定時刻情報及び直後工程の処理開始可能時刻情報を取得する形態について説明したが、データ出力部１１ａ１６〜１４ａ１６が、処理終了予定時刻情報及び処理開始可能時刻情報のいずれか一方を出力し、データ取得部１１ａ１１〜１４ａ１１が直前工程の処理終了予定時刻情報及び直後工程の処理開始可能時刻情報のいずれか一方を取得する形態でもよい。この場合には処理が簡略化される。
【０１０７】
（Ｆ）本実施形態では、評価関数Ｅｉが段取り替え時間の総和、処理終了予定時刻の工程納期からの遅れ時間の総和、及び処理終了予定時刻の［（直後工程の処理開始予定時刻）−（工程間リードタイム）］からの遅れ時間の総和を用いて定義される場合について説明したが、段取り替え時間の総和、処理終了予定時刻の工程納期からの遅れ時間の総和、及び処理終了予定時刻の［（直後工程の処理開始予定時刻）−（工程間リードタイム）］からの遅れ時間の総和の少なくとも１つを用いて定義される形態でもよいし、他の評価指標を用いる形態でもよい。
【０１０８】
（Ｇ）本実施形態では、評価関数Ｅｉの重みαｉ、βｉが固定値である場合について説明したが、重みγｉと同様にスケジュール変更回数に応じて変更する形態でもよい。この場合には、より効率的に適正な生産スケジュールを求めることが可能となる。
【０１０９】
（Ｈ）本実施形態では、初期生産スケジュールが初期スケジュール生成部１１ａ１０〜１４ａ１０によって生成される場合について説明したが、予め所定のルールに則って生成されて格納されており、格納された初期生産スケジュールを読み出す形態でもよい。
【０１１０】
【発明の効果】
請求項１に記載の発明によれば、工程別スケジューリング手段によって、生産ラインを構成する所定数の工程毎に複数の製品の処理順序が決定され、制御手段によって、工程別スケジューリング手段に対して、工程別スケジューリング手段間におけるデータの授受が指示されると共に、工程スケジューリング手段の処理の実行が指示されるため、効率的にライン全体の生産スケジュールを決定できる。
【０１１１】
また、各工程別スケジューリング手段において、評価部によって、予定時刻算出部により求められた各製品の処理開始予定時刻及び処理終了予定時刻を用いて工程別生産スケジュールの生産効率が評価され、工程別生産スケジュール変更部によって、評価部による評価結果に基づいて工程別生産スケジュールが変更されため、各工程の生産効率に関して適切な生産スケジュールを生成できる。
【０１１２】
請求項２に記載の発明によれば、評価部によって、データ取得部により取得された処理開始可能時刻を用いて工程別生産スケジュールの納期の達成度が評価され、工程別生産スケジュール変更部によって、評価部による評価結果に基づいて工程別生産スケジュールが変更されため、各工程の生産効率及び納期達成度に関して適切な生産スケジュールを生成できる。
【０１１３】
請求項３に記載の発明によれば、評価部によって、重み記憶部の重み情報を用いた重み付き加算を行う所定の評価関数の値を求めることによって生産スケジュールが評価されるため、簡単な計算で生産スケジュールの評価を行うことができる。
【０１１４】
請求項４に記載の発明によれば、工程別スケジューリング手段の重み設定部によって、重み記憶部に格納する重みが工程毎に設定されるため、工程の特徴に応じた適切な重みを設定することができる。
【０１１５】
請求項５に記載の発明によれば、工程別生産スケジュール変更部によって、生産スケジュールの変更回数がカウントされ、重み設定部によって、変更回数の増大に応じて納期の達成度の重みが大きく設定されため、生産性及び納期に関して適切な生産スケジュールを得ることができる。
【０１１６】
請求項６に記載の発明によれば、生産ラインを構成する複数の工程の内、１の工程の重み設定部によって、他の工程の重み設定部と比較して、変更回数の増大に応じた納期の達成度の重みがより早く増加される。そこで、最終工程の重み設定部が他の工程の重み設定部と比較して変更回数の増大に応じた納期の達成度の重みをより早く増加させる場合には、納期を達成可能な生産スケジュールを生成できる。
【０１１７】
請求項７に記載の発明によれば、工程別スケジューリング手段によって、生産ラインを構成する所定数の工程毎に複数の製品の処理順序が決定され、制御手段によって、工程別スケジューリング手段に対して、工程別スケジューリング手段間におけるデータの授受が指示されると共に、工程スケジューリング手段の処理の実行が指示されるため、効率的にライン全体の生産スケジュールを決定できる。
【０１１８】
また、各工程別スケジューリング手段において、評価部によって、予定時刻算出部により求められた各製品の処理開始予定時刻及び処理終了予定時刻を用いて工程別生産スケジュールの生産効率が評価され、工程別生産スケジュール変更部によって、評価部による評価結果に基づいて工程別生産スケジュールが変更されため、各工程の生産効率に関して適切な生産スケジュールを生成できる。
【図面の簡単な説明】
【図１】本発明に係るスケジューリング装置の構成図の一例である。
【図２】スケジューラのハード構成図の一例である。
【図３】スケジューラの制御部の機能構成図の一例である。
【図４】後工程納期の説明図の一例である。
【図５】後工程処理可能時刻の説明図の一例である。
【図６】係数Ｋｉの重みγｉ及び生産スケジュールに及ぼす影響についての説明図の一例である。
【図７】制御装置のハード構成図の一例である。
【図８】制御装置の制御部の機能構成図の一例である。
【図９】制御装置の制御部の処理の概要を表すフローチャートの一例である。
【図１０】図９のステップＳ１及びステップＳ３に対応するスケジューラの処理を表すフローチャートの一例である。
【図１１】図９のステップＳ５〜Ｓ１１に対応するスケジューラの処理を表すフローチャートの一例である。
【図１２】段取り替えの要否を表す図表の一例である。
【図１３】図１０のフローチャートのステップＳ１０１において生成される初期生産スケジュールを表す図表の一例である。
【図１４】図１０のフローチャートのステップＳ１０３において行われる情報交換処理の説明図の一例である。
【図１５】図１３に示す初期生産スケジュールが図１１のフローチャートのステップＳ５１５において行われるスケジュール変更処理によって変更されて得られた生産スケジュールを表す図表の一例である。
【図１６】図１３に示す初期生産スケジュールに対してスケジュール変更処理が施され最終的に得られた生産スケジュールを表す図表の一例である。
【図１７】ジョブショップ型生産ラインに適用されるスケジューリング装置の構成図の一例である。
【符号の説明】
１ スケジューリング装置
１１〜１４ スケジューラ（工程別スケジューリング手段）
１１ａ〜１４ａ 制御部
１１ａ１〜１４ａ１ ＣＰＵ
１１ａ１０〜１４ａ１０ 初期スケジュール生成部
１１ａ１１〜１４ａ１１ データ取得部
１１ａ１２〜１４ａ１２ 予定時刻算出部
１１ａ１３〜１４ａ１３ 評価部
１１ａ１４〜１４ａ１４ 重み設定部
１１ａ１５〜１４ａ１５ スケジュール変更部
１１ａ１６〜１４ａ１６ データ出力部
１１ａ２〜１４ａ２ ＲＡＭ
１１ａ２１〜１４ａ２１ スケジュール記憶部（工程別スケジュール記憶部）
１１ａ２２〜１４ａ２２ 処理時間記憶部
１１ａ２３〜１４ａ２３ 重み記憶部
２ 制御装置（制御手段）
２ａ 制御部
２ａ１ ＣＰＵ
２ａ１１ 処理実行制御部
２ａ１２ 入出力制御部
２ａ２ ＲＡＭ[0001]
BACKGROUND OF THE INVENTION
The present invention comprises a predetermined number of processes of two or more, and the preceding and following processes are set in advance for each of the predetermined number of processes, and the manufacturing conditions in at least one of the predetermined number of processes are different from each other. The present invention relates to a scheduling device and a scheduling program for determining a production schedule for each process, which is a processing order of a plurality of products in each process of a production line for manufacturing a kind of product.
[0002]
[Prior art]
Conventionally, when a plurality of types of products having different manufacturing conditions in at least one process are manufactured in a production line consisting of a plurality of processes, the production schedule for each process, which is the processing order of products in each process, is The whole is modeled and regarded as one planning problem, and is processed (that is, generated or determined) all at once by one scheduler (an apparatus comprising a computer or the like that generates a production schedule).
[0003]
For example, the operation of expressing the production schedule of the entire production line as a matrix (matrix) in which product identification information (for example, product numbers) is stored in the order of the product processing order for each process, and replacing the product numbers in the matrix with “ There is a method performed using a “combinatorial optimization method”. However, when such a method is used, if the number of products to be processed and the number of processes in the production line increase, the amount of calculation required for the processing increases dramatically, which is a cause of impairing practicality. .
[0004]
Therefore, in recent years, “distributed scheduling” has been proposed in which one scheduler generates a production schedule for each process and adjusts the production schedule of the entire production line by exchanging information between the schedulers (for example, Non-patent document 1).
[0005]
This method has the following characteristics.
(1) One scheduler generates a production schedule for each process.
(2) Each scheduler obtains the processing order of each product, the scheduled processing start time, and the scheduled processing end time as the production schedule of its own process.
(3) Each scheduler exchanges information with the scheduler of the immediately preceding and immediately following processes, and acquires the “scheduled process end time of the immediately preceding process” and “scheduled process start time of the immediately following process” for each product. To do.
(4) Each scheduler uses a SA (Simulated Annealing) method to change the processing order of products so as to optimize an evaluation function that is a weighted addition of the following evaluation items.
a) Number of set-up operations (for example, roll exchange operation in a rolling process in a steel production line) that occurs when different types of products are continuously processed: production efficiency improves as the number of set-up operations decreases.
b) Process delivery date at the scheduled processing end time of each product (a virtual delivery date calculated from the delivery delivery date and the average lead time between the processes, and for the purpose of generating a production schedule that takes into account the delivery date in each process. Delay from the introduction: The smaller the delay from the process delivery date, the better the production schedule in terms of delivery date management.
c) Delay from the scheduled process start time in the process immediately after the scheduled process end time for each product: Originally, if there is a delay from the scheduled process start time in the immediately following process, the production schedule between the processes is inconsistent. However, it adopts a method of “obtaining a production schedule that satisfies the constraints (ie, can be executed) in the process of updating the production schedule”. Therefore, it is included in the evaluation function as an evaluation item without being a constraint condition of the production schedule. The restriction is that the scheduled process start time of each product is after the scheduled process end time of the immediately preceding process.
(5) The evaluation function is optimized by repeating (3) and (4). That is, the number of setup operations is small (production efficiency is good), the delay from the process delivery date is small (delivery date is ensured), and an executable production schedule is obtained.
[0006]
When the above-described distributed scheduling is used, it is possible to execute scheduler processes for each process in parallel, so that the processing speed can be increased. Moreover, since each scheduler is independent from each other, it is possible to add a unique condition to each process, and the change is easy. Furthermore, when a process in the production line is deleted or when a process is added, the corresponding scheduler can be deleted or added, so that a change in the production line can be flexibly handled.
[0007]
[Non-Patent Document 1]
Iron and Steel Association System Forum 6th Lecture Collection: “Distributed Collaborative Scheduling Method Based on Exploratory Combination Optimization”, Japan Iron and Steel Institute, February 2002
[0008]
[Problems to be solved by the invention]
However, in actual production line operations, there are a process that should place particular emphasis on productivity (so-called neck process) and a process that operates in synchronization with the neck process (non-neck process). In the scheduling method, a production schedule is generated without distinguishing between them. For example, a production schedule that is not preferable in actual operation may be generated, for example, a schedule of a neck process becomes a schedule with poor productivity. .
[0009]
In addition, each scheduler has a constraint that the scheduled process start time of each product is after the scheduled process end time of the immediately preceding process, and the scheduled process end time of each product is the scheduled process start time of the immediately following process. Since the production schedule is generated so as not to be late, if the delivery schedule is delayed in the subsequent process due to the inappropriate production schedule in the previous process, it is difficult to correct it. In some cases, a large amount of calculation time is required until an appropriate production schedule is obtained.
[0010]
The present invention has been made in view of the above problems, and an object thereof is to provide a scheduling device and a scheduling program capable of efficiently generating an appropriate production schedule.
[0011]
[Means for Solving the Problems]
The scheduling apparatus according to claim 1 includes a predetermined number of processes of two or more, and preceding and following processes are set in advance for each of the predetermined number of processes, and manufacturing in at least one of the predetermined number of processes. A scheduling device for determining a production schedule for each process, which is a processing order of a plurality of products in each process of a production line that manufactures a plurality of types of products having different conditions, wherein the plurality of products for each predetermined number of processes The predetermined number of process scheduling means for determining the processing order of the process and the process scheduling means are instructed to exchange data between the process scheduling means, and the process scheduling means is instructed to execute the process. Control means that each process scheduling means is a process order of products in its own process. The process schedule storage unit for storing the separate production schedule information and the data transfer instruction from the control means are received, and the process end scheduled time information of each product is acquired from the process-specific scheduling means immediately before the own process. By using the data acquisition unit, the process-specific production schedule information and the process end scheduled time information of the immediately preceding process, a scheduled time calculation unit that calculates a scheduled process start time and a scheduled process end time for each product, and the scheduled time calculation unit An evaluation unit that evaluates the production efficiency of the production schedule by process using the estimated process start time and process end scheduled time of each product obtained, and changes the production schedule by process based on the evaluation result by the evaluation unit And a process-by-process production schedule change section stored in the process schedule storage section in an update manner, And a data output unit for outputting the scheduled processing end time information of each product obtained by the scheduled time calculation unit to the scheduling means for each process immediately after the own process. It is characterized by.
[0012]
According to said structure, the process order of several products is determined for every predetermined number of processes which comprise a production line by the scheduling means according to a process, and the scheduling means according to a process with respect to the scheduling means according to a process by a control means Data exchange between them is instructed, and execution of the process of the process scheduling means is instructed. Here, in each process scheduling means, the process schedule storage section stores the production schedule information for each process, which is the processing order of the product in its own process, and the data acquisition section accepts the data transfer instruction from the control means. Thus, the scheduled process end time information of each product is acquired from the process-specific scheduling means of the process immediately before the own process. Further, the scheduled time calculation unit obtains the scheduled process start time and the scheduled process end time for each product using the production schedule information by process and the scheduled process end time information of the immediately preceding process, and the evaluation unit calculates the scheduled time calculation unit. The production efficiency of the production schedule for each process is evaluated using the estimated process start time and the estimated process end time of each product obtained by the above. Further, the process-specific production schedule change unit changes the process-specific production schedule based on the evaluation result by the evaluation unit, and stores it in an updated manner in the process schedule storage unit. In addition, when the data output unit receives an instruction to send / receive data from the control unit, the process end schedule of each product obtained by the scheduled time calculation unit is determined for the process-specific scheduling unit immediately after the own process. Time information is output.
[0013]
In this way, the processing order of a plurality of products is determined for each predetermined number of processes constituting the production line by the process-specific scheduling means, and the control means determines the process order scheduling means between the process-specific scheduling means. Since the transfer of data is instructed and the execution of the process of the process scheduling means is instructed, the production schedule for the entire line is efficiently determined.
[0014]
Further, in the scheduling means for each process, the evaluation unit evaluates the production efficiency of the production schedule for each process by using the scheduled process start time and the scheduled process end time of each product obtained by the scheduled time calculation unit, and the production by process. Since the schedule change unit changes the production schedule for each process based on the evaluation result by the evaluation unit, a production schedule appropriate for the production efficiency of each process is generated.
[0015]
The scheduling apparatus according to claim 2, wherein the data acquisition unit starts a process end scheduled time of a product processed immediately before each product in the immediately subsequent process from the process-specific scheduling unit in the process immediately after the self process. Obtaining the available time information, the evaluation unit evaluates the achievement degree of the delivery date of the production schedule according to the process using the process startable time acquired by the data acquisition unit, the data output unit, The scheduled processing end time of the product processed immediately before each product obtained by the scheduled time calculation unit is output as processing startable time information to the scheduling unit by process of the immediately preceding process.
[0016]
According to said structure, the process start possible time information which is the process end scheduled time of the product processed immediately before each product in the said immediately following process from the scheduling means according to the process immediately after a self process by the data acquisition part. Acquired and evaluated by the evaluation unit using the process start possible time acquired by the data acquisition unit, the degree of achievement of the delivery date of the production schedule for each process is evaluated, and the data output unit provides the process-specific scheduling means for the process immediately before the own process. On the other hand, the processing end scheduled time of the product processed immediately before each product obtained by the scheduled time calculation unit is output as processing start possible time information. In addition, since the evaluation unit evaluates the achievement of the delivery date of the production schedule for each process using the process startable time acquired by the data acquisition unit, an appropriate production schedule is efficiently generated.
[0017]
In this way, the evaluation unit evaluates the achievement of the delivery date of the production schedule by process using the process startable time acquired by the data acquisition unit, and the evaluation result by the evaluation unit is evaluated by the process production schedule change unit. Since the production schedule for each process is changed based on this, an appropriate production schedule is generated with respect to the production efficiency and delivery date achievement of each process.
[0018]
The scheduling apparatus according to claim 3, wherein the scheduling means for each process includes a weight storage unit that stores weight information used in the evaluation unit, and the evaluation unit uses the weight information of the weight storage unit. It is characterized by evaluating by obtaining a value of a predetermined evaluation function for performing weighted addition.
[0019]
According to the above configuration, the weight information used in the evaluation unit is stored in the weight storage unit of the scheduling means according to the process, and the evaluation unit performs weighted addition using the weight information of the weight storage unit. The production schedule is evaluated by obtaining the value of the evaluation function.
[0020]
In this way, since the evaluation unit evaluates the production schedule by obtaining the value of a predetermined evaluation function that performs weighted addition using the weight information of the weight storage unit, the production schedule can be evaluated by simple calculation. Done.
[0021]
The scheduling apparatus according to claim 4, wherein the process-specific scheduling unit includes a weight setting unit that sets a weight to be stored in the weight storage unit, and the weight setting unit sets a weight for each process. It is said.
[0022]
According to said structure, since the weight stored in a weight memory | storage part is set for every process by the weight setting part of the scheduling means according to process, it becomes possible to set the appropriate weight according to the characteristic of the process. . For example, in the case of a production bottleneck process (a bottleneck that defines the production amount of the production line), it is preferable to weight the production efficiency.
[0023]
The scheduling apparatus according to claim 5, wherein the process-specific production schedule change unit counts the number of times the production schedule is changed, and the weight setting unit sets the weight of the achievement degree of the delivery date according to the increase in the number of changes. It is characterized by a large setting.
[0024]
According to the above configuration, the production schedule change unit by process counts the number of changes in the production schedule, and the weight setting unit sets the weight of achievement of the delivery date in accordance with the increase in the number of changes. And an appropriate production schedule can be obtained with respect to delivery time.
[0025]
The scheduling apparatus according to claim 6, wherein, among the plurality of processes, the weight setting unit of one process compares the delivery date according to an increase in the number of changes compared to the weight setting unit of another process. It is characterized by a large increase in the weight of achievement degree.
[0026]
According to said structure, the achievement level of the delivery date according to the increase in the frequency | count of a change by the weight setting part of one process among the some processes which comprise a production line compared with the weight setting part of another process The weight of is increased faster. Therefore, for example, when the weight setting unit of the final process increases the weight of achievement degree of the delivery date according to the increase in the number of changes compared with the weight setting unit of the other process, a production schedule that can achieve the delivery date is obtained. Generated.
[0027]
The scheduling program according to claim 7, comprising a predetermined number of processes of two or more, wherein a preceding and following process is preset for each of the predetermined number of processes, and manufacturing in at least one of the predetermined number of processes A scheduling program for determining a production schedule for each process, which is a processing order of a plurality of products in each process of a production line for manufacturing a plurality of types of products having different conditions, and comprising a computer for each predetermined number of processes The predetermined number of process-by-process scheduling means for determining the processing order of the plurality of products, and the process-by-process scheduling means to send and receive data between the process-by-process scheduling means, Function as control means for instructing execution of processing, scheduling means for each process The process schedule storage unit for storing the production schedule information for each process, which is the processing order of the product in the own process, and the instruction for data transfer from the control means, and the process-specific scheduling means for the process immediately before the own process, Scheduled to obtain the scheduled processing start time and scheduled processing end time for each product using the data acquisition unit that acquires the scheduled processing end time information for each product, the production schedule information for each process, and the scheduled process end time information for the immediately preceding process. A time calculation unit, an evaluation unit that evaluates the production efficiency of the production schedule for each process using the scheduled process start time and the scheduled process end time of each product obtained by the scheduled time calculation unit, and an evaluation result by the evaluation unit The process-specific production schedule is changed and stored in the process schedule storage unit in an update manner. The processing end scheduled time information of each product obtained by the scheduled time calculating unit with respect to the scheduling unit according to the process immediately after the own process upon receiving an instruction to exchange data from the joule changing unit and the control unit It functions as a data output unit that outputs.
[0028]
According to the above program, the process order of a plurality of products is determined for each predetermined number of processes constituting the production line by the process-specific scheduling means, and the process-specific scheduling means is performed by the control means with respect to the process-specific scheduling means. Data exchange between them is instructed, and execution of the process of the process scheduling means is instructed. Here, in each process scheduling means, the process schedule storage section stores the production schedule information for each process, which is the processing order of the product in its own process, and the data acquisition section accepts the data transfer instruction from the control means. Thus, the scheduled process end time information of each product is acquired from the process-specific scheduling means of the process immediately before the own process. Further, the scheduled time calculation unit obtains the scheduled process start time and the scheduled process end time for each product using the production schedule information by process and the scheduled process end time information of the immediately preceding process, and the evaluation unit calculates the scheduled time calculation unit. The production efficiency of the production schedule for each process is evaluated using the estimated process start time and the estimated process end time of each product obtained by the above. Further, the process-specific production schedule change unit changes the process-specific production schedule based on the evaluation result by the evaluation unit, and stores it in an updated manner in the process schedule storage unit. In addition, when the data output unit receives an instruction to send / receive data from the control unit, the process end schedule of each product obtained by the scheduled time calculation unit is determined for the process-specific scheduling unit immediately after the own process. Time information is output.
[0029]
In this way, the processing order of a plurality of products is determined for each predetermined number of processes constituting the production line by the process-specific scheduling means, and the control means determines the process order scheduling means between the process-specific scheduling means. Since the transfer of data is instructed and the execution of the process of the process scheduling means is instructed, the production schedule for the entire line is efficiently determined.
[0030]
Further, in the scheduling means for each process, the evaluation unit evaluates the production efficiency of the production schedule for each process by using the scheduled process start time and the scheduled process end time of each product obtained by the scheduled time calculation unit, and the production by process. Since the schedule change unit changes the production schedule for each process based on the evaluation result by the evaluation unit, a production schedule appropriate for the production efficiency of each process is generated.
[0031]
DETAILED DESCRIPTION OF THE INVENTION
FIG. 1 is an example of a configuration diagram of a scheduling apparatus according to the present invention. The scheduling apparatus 1 includes a predetermined number of processes (here, four processes) of two or more, and preceding and following processes are set in advance for each of the four processes (here, process 1, process 2, process 3, process 4). A production line for manufacturing a plurality of types (here, six types) of products having different manufacturing conditions in at least one of the four steps (step 1 to step 4). The process-specific production schedule, which is the processing order of a plurality of products (here, six products) in each process, is determined.
[0032]
The scheduling apparatus 1 includes four schedulers (corresponding to scheduling means for each process) 11 to 14 that determine the processing order of six products for each of four processes, and between the schedulers 11 to 14 with respect to the schedulers 11 to 14. A control device 2 (corresponding to a control means) that instructs the execution of processing of the schedulers 11 to 14 as well as instructing data exchange. Here, the schedulers 11 to 14 and the control device 2 are communicably connected via a LAN 3.
[0033]
The schedulers 11 to 14 generate the production schedule of the own process using information from the schedulers 11 to 14 of the processes immediately before and immediately after the own process, and evaluate the generated production schedule from the viewpoint of securing the production efficiency and the delivery date. The evaluation is performed using the functions E1 to E4, and the production schedule is changed based on the evaluation result.
[0034]
The control device 2 instructs the exchange of data between the schedulers 11 to 14, and instructs the execution of the processing of the schedulers 11 to 14, and controls the processing of the entire scheduling device 1.
[0035]
FIG. 2 is an example of a hardware configuration diagram of the schedulers 11 to 14. Since all of the schedulers 11 to 14 have the same hardware configuration, the scheduler 12 will be described here for convenience. The scheduler 12 includes a personal computer or the like, and includes a control unit 12a that controls the overall operation of the scheduler 12, an operation unit 12b that receives external operations, a speaker 12c that outputs sound to the outside, and an image that is output to the outside. The network communication unit 12e that communicates with the other schedulers 12 to 14 and the control device 2 via the LAN 3 is connected via the bus BA12 that is a data transmission path.
[0036]
The control unit 12a controls the overall operation of the scheduler 12, and includes an information processing unit (CPU) 12a1, a RAM 12a2 that temporarily stores information during processing, and a ROM 12a3 that stores predetermined image information and the like in advance. And.
[0037]
The drawing processing unit 12d1 displays a required image on the monitor 12d in accordance with an image display instruction from the control unit 12a, and includes a video RAM and the like. The audio reproduction unit 12c1 outputs a predetermined message, BGM, or the like to the speaker 12c in accordance with an instruction from the control unit 12a. Of various data stored in the ROM 12a3, data that can be stored in a removable recording medium can be read by a driver such as a hard disk drive, an optical disk drive, a flexible disk drive, a silicon disk drive, or a cassette medium reader. In this case, the recording medium is, for example, a hard disk, an optical disk, a flexible disk, a CD, a DVD, or a semiconductor memory.
[0038]
The network communication unit 12e is for transmitting and receiving various data to and from the other schedulers 11, 13, and 14 and the control device 2 via a network including the LAN 3. The interface unit 12b1 is for exchanging data with the operation unit 12b. The control unit 12a performs various processes using various information transmitted from the other schedulers 11, 13, and 14 and the control device 2 via the network communication unit 12e.
[0039]
A part of the scheduling program of the present invention is recorded in the ROM 12a3, loaded onto the RAM 12a2, and the respective functions are realized by the CPU 12a1 sequentially executing the scheduling program on the RAM 12a2.
[0040]
FIG. 3 is an example of a functional configuration diagram of the control unit 12a. The CPU 12a1 receives a process execution instruction from the control device 2, and receives an initial schedule generation unit 12a10 that generates an initial value of the production schedule of its own process (step 2), and a data transfer instruction from the control device 2. The data acquisition unit 12a11 that acquires the scheduled processing end time information of each product from the scheduler 11 of the process immediately before the process (process 2) (process 1), the production schedule information of the process (process 2) and the process immediately before ( Using the scheduled process end time information in step 1), the scheduled process start time and the scheduled process end time for each product are calculated, and the estimated process start time for each product determined by the scheduled time calculator 12a12. And an evaluation unit 12a13 that evaluates the production efficiency of the production schedule of the own process (step 2) using the scheduled processing end time, and an evaluation unit Based on the evaluation result by the weight setting unit 12a14 and the evaluation unit 12a13 that sets the weight of the evaluation function E2 used in 2a13, the production schedule of the own process (step 2) is changed and updated to the schedule storage unit 12a21 described later The schedule change unit 12a15 (corresponding to the process-specific production schedule change unit) to be stored and the data transfer instruction from the control means 2 are received, and the scheduler of the process (process 3) immediately after the own process (process 2) 13 is provided with a data output unit 12a16 that outputs scheduled processing end time information of each product obtained by the scheduled time calculation unit 12a12.
[0041]
The initial schedule generation unit 12a10 receives a process execution instruction from the control device 2, and generates the process order of the process (process 2) by, for example, generating the process order of the products in the process at random using a random number or the like. An initial value of the schedule is generated and stored in the schedule storage unit 12a21.
[0042]
The data acquisition unit 12a11 receives the data transfer instruction from the control device 2, and the processing end schedule of each product is scheduled from the scheduler 11 (data output unit 11a16) of the process (process 1) immediately before the own process (process 2). Processing of products processed immediately before each product in the immediately following process (process 3) from the scheduler 13 (data output unit 13a16) in the process immediately following the own process (process 2) (process 3) while acquiring time information The process startable time information that is the scheduled end time is acquired.
[0043]
The scheduled time calculation unit 12a12 reads out the production schedule information of its own process (process 2) from the schedule storage unit 12a21 described later, and the production schedule information and the scheduled process end time information of the immediately preceding process (process 1) for each product. Using this, the scheduled process start time and the scheduled process end time are obtained. Specifically, a time obtained by adding an inter-process lead time such as a product transfer time from the previous process (process 1) to the self process (process 2) to the scheduled process end time in the previous process (process 1), The latest processing end time of the product processed immediately before in the step (step 2) is compared, and the later time is obtained as the processing start scheduled time. Then, the processing time, which is the time required for processing the product at the scheduled processing start time, is read from the processing time storage unit 12a22 described later and added to obtain the scheduled processing end time. However, if a setup change is necessary to process the product, the scheduled processing start time is delayed by the setup change time.
[0044]
Here, the setup change means that the product to be processed in the future from the manufacturing condition of the product to be processed immediately before because the manufacturing condition in the own process (process 2) of the product to be processed immediately before and the product to be processed in the future is different. This is the work required to change to a condition. For example, in the rolling process, it is a rolling roll replacement operation that occurs when products with different roll surface sections are processed, and in the plating process, for example, a plating tank switching operation that occurs when products with different plating types are processed. is there.
[0045]
The evaluation unit 12a13 evaluates the production efficiency of the production schedule of the own process (step 2) using the scheduled process start time and the scheduled process end time of each product obtained by the scheduled time calculation unit 12a12, and the data acquisition unit 12a11. Is used to evaluate the degree of achievement of the delivery date of the production schedule.
[0046]
Here, the evaluation is performed based on the value of the evaluation function Ei defined by the following equation (1).
[0047]

However, i = 1 to 4, i = 2 here, and the weights αi, βi, and γi are stored in the weight storage unit 12a23 described later. The first term of the evaluation function Ei is an evaluation item for evaluating the production efficiency, and the second and third terms are evaluation items for evaluating the achievement degree of the delivery date. When the delay times of the second term and the third term of the evaluation function Ei are less than “0”, they are handled as “0”.
[0048]
Here, an index for evaluating the achievement level of the delivery date used in the evaluation function Ei will be described with reference to FIGS. FIG. 4 is an example of an explanatory diagram of a post-process delivery date, and FIG. 5 is an example of an explanatory diagram of a post-process processable time. 4 and 5, the horizontal axis is time T, and a part of the production schedule of the process i and the process (i-1) which is the immediately preceding process and the process (i + 1) which is the immediately following process in the vertical direction. Are shown in the order of passing steps. Processing times J0 and J1 in the figure are processing times in the respective processes of the products P0 and P1, respectively. Further, here, for the sake of convenience, description will be made assuming that the lead time between processes is “0” (ignoring the lead time between processes).
[0049]
4 and 5, the time T0 is the process delivery time of the product P1 in the process i. Here, the process delivery date is a hypothetical delivery time calculated from the delivery delivery date and the average lead time between the processes, and is introduced for the purpose of generating a production schedule that takes the delivery delivery date into account for each process. Yes. Time TF1 is a scheduled processing end time of the product P1 in the process i (scheduled end timing of the processing time J1). Here, for the product P1 in the process i, the scheduled process end time TF1 is delayed by the time A with respect to the process delivery time T0.
[0050]
In FIG. 4, time T1 is the scheduled processing start time for the product P1 in step (i + 1). Here, for the product P1 in the process i, the scheduled process end time TF1 is delayed by the time B with respect to the scheduled process start time T1 of the immediately following process (i + 1). The conventional production schedule was evaluated using the delay time A of the scheduled process end time TF1 with respect to the process delivery time T0 and the delay time B of the scheduled process end time TF1 with respect to the scheduled process start time T1 of the immediately following process (i + 1). .
[0051]
In FIG. 5, the time T2 is the scheduled end time of the product P0 processed immediately before the product P1 in the step (i + 1) (because the processing of the product P1 can be started in the step (i + 1) from this time T2. , The process startable time of the product P1). Here, for the product P1 in the process i, the process end scheduled time TF1 is delayed by the time C with respect to the process start possible time T2 of the immediately subsequent process (i + 1). The production schedule of the present invention is evaluated using the delay time A of the scheduled process end time TF1 with respect to the process delivery time T0 and the delay time C of the scheduled process end time TF1 with respect to the process startable time T2 of the immediately following process (i + 1). .
[0052]
The delay time B represents the delay of the scheduled process end time TF1 with respect to the scheduled process start time T1 of the immediately subsequent step (i + 1). If this is not less than “0”, it cannot be an executable production schedule. On the other hand, the delay time C represents the delay of the scheduled process end time TF1 with respect to the process start possible time T2 of the immediately following process (i + 1), and the production efficiency of the process (i + 1) is made closer to “0”. Will improve. In other words, the delay time B prescribes an indispensable condition (a condition to be satisfied at the minimum) for generating an executable production schedule, while the delay time C prescribes a more severe delivery date condition. It is.
[0053]
Returning to the configuration diagram shown in FIG. The weight setting unit 12a14 sets the weights αi, βi, and γi (here, i = 2) of the evaluation function Ei defined by the above equation (1). Further, the weight setting unit 12a14 increases the weight γi of the evaluation item for evaluating the achievement degree of the delivery date as the number of schedule change times Ni obtained by the schedule change unit 12a15 increases. For example, the weight γi is obtained using the following equation (2).
[0054]
γi = M0 + M1 × [1-exp (−Ki × Ni)] (2)
However, the coefficients M0 and M1 are positive constants (for example, M0 = 1 and M1 = 2), and the coefficient Ki (i = 1 to 4) determines the increasing speed of the weight γi as the schedule change count Ni increases. As the coefficient Ki is larger, the weight γi increases faster (see FIG. 6A). For example, if the process is focused on production efficiency, the coefficient Ki is set to a small value, and if the process is focused on delivery time, an appropriate production schedule is generated if the coefficient Ki is set to a large value. The
[0055]
Here, the meaning of the coefficient Ki will be specifically described with reference to FIG. FIG. 6 is an example of an explanatory diagram about the influence of the coefficient Ki on the weight γi and the production schedule. (A) is a graph of the change of the weight γi accompanying the change of the coefficient Ki, and (b) is a diagram showing the influence of the value of the coefficient Ki on the production schedule.
[0056]
The horizontal axis of the graph of (a) is the schedule change count Ni (here, the schedule change count Ni1 of step i1, and the schedule change count Ni2 of step i2), and the vertical axis is the weight γi (here, the step i1). Weight γi1, weight γi2) of step i2. Here, the case where the coefficient Ki1 which is the coefficient Ki of the process i1 is larger than the coefficient Ki2 which is the coefficient Ki of the process i2 is illustrated. As the coefficient Ki increases, the weight γi increases (the increase rate is faster) with a smaller number of schedule changes Ni. Therefore, the weight γi1 of step i1 increases faster than the weight γi2 of step i2.
[0057]
In the figure of (b), the horizontal axis is time T, and a part of the production schedule generated by the scheduling device of the present invention for the process i1 and the process i2 that is the process immediately after that in the vertical direction and the process immediately after that is shown from the top. It is shown in the order of passing process below. Since the weight γi1 of the process i1 increases quickly, the evaluation regarding the achievement level of the delivery date is strict compared with the production efficiency, and conversely, since the speed of the weight γi2 of the process i2 increases slowly, compared with the achievement level of the delivery date. Evaluation regarding production efficiency is severe. Therefore, a schedule with good production efficiency is generated in step i2. In other words, if the process is focused on production efficiency, a small value of the coefficient Ki is set, and if the process is focused on delivery, a large value of the coefficient Ki is set to generate an appropriate production schedule. The
[0058]
Returning to the configuration diagram of FIG. The schedule change unit 12a15 changes the production schedule of the own process (step 2) based on the evaluation result by the evaluation unit 12a13, and stores it in the schedule storage unit 12a21 described later. Specifically, a production schedule for minimizing the value of the evaluation function Ei defined by the expression (1) is obtained and changed to the production schedule. As a method for obtaining a production schedule for minimizing the value of the evaluation function Ei, an optimization method such as a SA (Simulated Annealing) method, a GA (Genetic Algorithm), or a local search method can be used. Here, the SA method is used.
[0059]
The data output unit 12a16 accepts the data transfer instruction from the control means 2, and performs a scheduled time calculation unit for the scheduler 13 (data acquisition unit 13a11) of the process (process 3) immediately after the own process (process 2). 12a12 outputs the processing end scheduled time information of each product obtained by the scheduled time calculation unit 12a12 to the scheduler 11 (data acquisition unit 11a11) of the process (step 1) immediately before the own process (step 2). The process start possible time information, which is the scheduled process end time of the product processed immediately before each obtained product, is output.
[0060]
The RAM 12a2 includes a schedule storage unit (corresponding to a process-specific schedule storage unit) 12a21 for renewably storing production schedule information that is the processing order of products in its own process (process 2), and each product in its own process (process 2). The processing time storage unit 12a22 that stores the processing time (time required for processing) information and the weight storage unit 12a23 that stores the weight information set by the weight setting unit 12a14 in an update manner.
[0061]
The schedule storage unit 12a21 stores production schedule information, which is the processing order of products in its own process (step 2), in an updated manner, and stores the initial value of the production schedule generated by the initial schedule generation unit 12a10. It is updated when the production schedule is changed by the schedule changing unit 12a15. The initial value of the production schedule may be set in advance by accepting an input from the outside, for example.
[0062]
The processing time storage unit 12a22 stores processing time information for each product used in the scheduled time calculation unit 12a12 in its own process (process 2). The processing time information may be set in advance by receiving input from the outside, or may be set by calculating from conditions such as the weight and size of the product.
[0063]
The weight storage unit 12a23 stores the weight information set by the weight setting unit 12a14 in an update manner. Specifically, the values of the weights αi, βi, and γi of the evaluation function Ei are stored. Here, the weights αi and βi are constants, and the weight γi is a variable whose value changes according to the number of schedule changes Ni in accordance with the above equation (2).
[0064]
FIG. 7 is an example of a hardware configuration diagram of the control device 2. The control device 2 is composed of a personal computer or the like, and controls the overall operation of the control device 2; an operation unit 2b that accepts external operations; a speaker 2c that outputs sound to the outside; A monitor 2d that outputs data and a network communication unit 2e that communicates with the schedulers 11 to 142 via the LAN 3 are connected via a bus BA2 that is a data transmission path.
[0065]
The control unit 2a controls the entire operation of the control device 2, and includes an information processing unit (CPU) 2a1, a RAM 2a2 for temporarily storing information during processing, and predetermined image information and the like are stored in advance. ROM 2a3.
[0066]
The drawing processing unit 2d1 displays a required image on the monitor 2d in accordance with an image display instruction from the control unit 2a, and includes a video RAM and the like. The audio reproduction unit 2c1 outputs a predetermined message, BGM, or the like to the speaker 2c in accordance with an instruction from the control unit 2a. Of various data stored in the ROM 2a3, data that can be stored in a removable recording medium can be read by a driver such as a hard disk drive, an optical disk drive, a flexible disk drive, a silicon disk drive, or a cassette medium reader. In this case, the recording medium is, for example, a hard disk, an optical disk, a flexible disk, a CD, a DVD, or a semiconductor memory.
[0067]
The network communication unit 2e is for transmitting and receiving various data to and from the schedulers 11 to 14 via a network composed of the LAN 3. The interface unit 2b1 is for exchanging data with the operation unit 2b. The control unit 2a performs various processes using various information transmitted from the schedulers 11 to 14 via the network communication unit 2e.
[0068]
A part of the scheduling program of the present invention is recorded in the ROM 2a3, loaded onto the RAM 2a2, and the respective functions are realized by the CPU 2a1 sequentially executing the scheduling program on the RAM 2a2.
[0069]
FIG. 8 is an example of a functional configuration diagram of the control unit 2a. The CPU 2a1 includes a process execution control unit 2a11 that instructs execution of the processes of the schedulers 11 to 14, and an input / output control unit 2a12 that instructs the schedulers 11 to 14 to exchange data between the schedulers 11 to 14.
[0070]
The process execution control unit 2a11 is for the initial schedule generation units 11a10 to 14a10, the scheduled time calculation units 11a12 to 14a12, the evaluation units 11a13 to 14a13, the weight setting units 11a14 to 14a14, and the schedule change units 11a15 to 14a15 of the schedulers 11 to 14. Instructs execution of processing. Since each of the schedulers 11 to 14 performs processing independently and in parallel, the process execution control unit 2a11 adjusts the execution timing of the process and evaluates the evaluation function Ei (i = 1) of the schedulers 11 to 14. The end determination is performed using the values of ˜4).
[0071]
The input / output control unit 2a12 instructs the data acquisition units 11a11 to 14a11 of the schedulers 11 to 14 to acquire data, and also instructs the data output units 11a16 to 14a16 to output data. It controls the exchange of data.
[0072]
FIG. 9 is an example of a flowchart showing an outline of processing of the control unit 2a. First, the process execution control unit 2a11 of the control unit 2a outputs instruction information for generating an initial production schedule to the initial schedule generation units 11a10 to 14a10 of the schedulers 11 to 14, and then the schedulers 11 to 14 The scheduled time calculation units 11a12 to 14a12, the evaluation units 11a13 to 14a13, and the schedule change units 11a15 to 14a15 are sequentially instructed to execute processing (step S1). Here, the processing instruction performed in step S1 is referred to as an initial schedule processing instruction.
[0073]
And the instruction information to the effect of executing the process from the process execution control unit 2a11 of the control unit 2a of the control unit 2a is received, and thereby, the data acquisition units 11a11 to 14a11 and the data output units 11a16 to 14a16 of the schedulers 11 to 14 are received. In response to this, the data transfer instruction information is output (step S3). Here, the processing instruction performed in step S3 is referred to as an information exchange processing instruction.
[0074]
Next, the process execution control unit 2a11 of the control unit 2a instructs the scheduled time calculation units 11a12 to 14a12, the evaluation units 11a13 to 14a13, and the schedule change units 11a15 to 14a15 of the schedulers 11 to 14 to execute processing sequentially. (Step S5). Here, the processing instruction performed in step S5 is referred to as a schedule change processing instruction.
[0075]
Then, the input / output control unit 2a12 of the control unit 2a gives the same information exchange processing instruction as that in step S3 (step S7). Next, an end determination process is performed by the process execution control unit 2a11 of the control unit 2a using the value of the evaluation function Ei (i = 1 to 4) obtained by the evaluation units 11a13 to 14a13 of the schedulers 11 to 14 according to the instruction in step S5. Performed (step S9). The end determination process is, for example, that all values of the evaluation function Ei (i = 1 to 4) are predetermined values (for example, 1 ) It is determined that the process is terminated when
[0076]
If it is determined in step S9 that the process is to be terminated, the process is terminated. When it is determined in step S9 that the process is not to be ended, the process execution control unit 2a11 of the control unit 2a gives instruction information for changing the weight γi to the weight setting units 11a14 to 14a14 of the schedulers 11 to 14. Is output (step S11), the process returns to step S5, and the processing from step S5 to step S9 is repeatedly executed.
[0077]
FIG. 10 is an example of a flowchart showing the processing of the schedulers 11 to 14 corresponding to step S1 and step S3 of FIG. Here, for convenience, the scheduler 12 will be described. First, the initial schedule generation unit 12a10 receives instruction information for generating an initial production schedule from the process execution control unit 2a11 of the control unit 2a, and generates an initial production schedule (step S101). Next, the scheduled time calculation unit 12a12 receives instruction information for executing the process from the process execution control unit 2a11 of the control unit 2a, and obtains the scheduled process start time and the scheduled process end time (step S103). Then, the data output unit 12a16 accepts the instruction information for outputting the data from the input / output control unit 2a12 of the control unit 2a, and the process end scheduled time information and the process start possible time information are output (step ST5, 7) The process is terminated.
[0078]
FIG. 11 is an example of a flowchart showing processing of the schedulers 11 to 14 corresponding to steps S5 to S11 of FIG. Here, for convenience, the scheduler 12 will be described. First, the data acquisition unit 12a11 receives instruction information to acquire data from the input / output control unit 2a12 of the control unit 2a, and the process end scheduled time information and the immediately following process in the immediately preceding process (process 1) of each product. The process startable time information of (Step 3) is acquired (Steps S501 and S503). Then, the scheduled time calculation unit 12a12 receives the instruction information for executing the process from the process execution control unit 2a11 of the control unit 2a, and reads the production schedule information of the own process (process 2) from the schedule storage unit 12a21. The process start scheduled time and the process end scheduled time are obtained (steps S505 and 507).
[0079]
Next, the evaluation unit 12a13 receives instruction information to execute the process from the process execution control unit 2a11 of the control unit 2a, and obtains the value of the evaluation function Ei (i = 2) (step S511). Then, it is determined whether or not a predetermined end condition (for example, the value of the evaluation function Ei (i = 2) is decreased three times or the schedule is updated three times) is satisfied (step S513). When it is determined that the end condition is not satisfied, the schedule change unit 11a15 receives instruction information to execute the process from the process execution control unit 2a11 of the control unit 2a, and the production schedule is changed ( Step S515). Then, the weight setting unit 12a14 accepts instruction information for executing the process from the process execution control unit 2a11 of the control unit 2a, the weight γi is changed (step S516), the process returns to step S501, and from step S501 The process of step S513 is repeatedly executed.
[0080]
If it is determined in step S513 that the end condition is satisfied, the data output unit 12a16 receives an instruction to send / receive data from the input / output control unit 2a12 of the control unit 2, and the processing end scheduled time of each product Then, the process startable time is output (steps S517 and 519), and the process ends.
[0081]
Here, an example of the production schedule generated by the scheduling device 1 will be described with reference to FIGS. Here, a production schedule when products 1 to 6 are processed in the order of steps 1 to 4 will be described. FIG. 12 is an example of a chart showing the necessity of setup change. (A)-(d) is a chart showing the necessity of stage change of process 1-process 4, respectively. Whether or not the setup change is necessary is determined depending on the type of the product processed before and the product processed immediately thereafter. In each chart, each row is a product processed before and each column is a product processed later. Here, a cross indicates that a setup change is necessary, and a circle indicates that a setup change is not necessary. For example, in the process 1, when the product 4 is processed after the product 1, the setup change is necessary before the processing of the product 4 is started, and when the product 2 is processed after the product 1, the processing of the product 2 is started. No setup change is required before
[0082]
FIG. 13 is an example of a chart representing the initial production schedule generated in step S101 of the flowchart of FIG. The abscissa is the elapsed time with the origin at the time when processing of the product in the process 1 (product 1 in this case) is started, and the production schedule of the processes 1 to 4 is described in this order in the vertical direction. Here, the processing time of each product is represented by a white square, and the number in the white square represents a product number. In addition, a hatched square represents a setup change. In addition, the ▲ mark at the bottom represents the timing of process delivery times T10 to T60 in the process 4 of the products 1 to 6 (the delivery date is when the process 4 is the final process).
[0083]
For example, in process 2, product 5, product 6, product 3, product 1, product 4, and product 2 are processed in this order, and a waiting time of 50 minutes occurs between the end of processing of product 5 and the start of processing of product 6. Therefore, a setup change occurs between the processing of the product 6 and the product 3, the product 1 and the product 4, and the product 4 and the product 2 (see FIG. 12B). In this initial schedule, the scheduled process completion time is delayed with respect to the process delivery date of process 4 for all products (product 1 to product 6), and the process delivery time delay occurs.
[0084]
FIG. 14 is an example of an explanatory diagram of the information exchange process performed in step S103 of the flowchart of FIG. The horizontal axis is the elapsed time starting from the point of time when the processing of the product (product 1 in this case) in process 1 is started, and the production schedule of process 1 and process 2 (or processes 1 to 3) is shown in the vertical direction. They are listed in this order. (A) is explanatory drawing of the information exchange process regarding the product 6 of the process 1, (b) is explanatory drawing of the information exchange process regarding the product 4 of the process 2. FIG.
[0085]
In (a), the processing of the product 5 is scheduled immediately before the processing of the product 6 in the step 2, and the scheduled processing end time of the product 5 is 80 minutes. 80 minutes. Therefore, in the schedule change process performed in step S515 in the flowchart of FIG. 11, the scheduled process end time of the product 6 in the process 1 is 70 minutes (= 80 minutes−10 minutes (= inter-process lead time)) or earlier. The production schedule in step 1 is changed.
[0086]
In (b), for the product 4 in step 2, the scheduled end time for the immediately preceding step (step 1) is 80 minutes, and the possible start time for the immediately following step (step 3) is 220 minutes. Therefore, in the schedule change process performed in step S515 of the flowchart of FIG. 11, the scheduled process start time of the product 4 in the process 2 is 90 minutes (= 80 minutes + 10 minutes (= inter-process lead time)) and 210. The production schedule of process 2 is changed so as to be before minutes (= 220 minutes-10 minutes (= inter-process lead time)).
[0087]
FIG. 15 is an example of a chart showing a production schedule obtained by changing the initial production schedule shown in FIG. 13 by the schedule change process performed in step S515 of the flowchart of FIG. The abscissa is the elapsed time with the origin at the time when processing of the product in the process 1 (product 1 in this case) is started, and the production schedule of the processes 1 to 4 is described in this order in the vertical direction. Here, the processing time of each product is represented by a white square, and the number in the white square represents a product number. In addition, a hatched square represents a setup change. In addition, the ▲ mark at the bottom represents the timing of process delivery times T10 to T60 in the process 4 of the products 1 to 6 (the delivery date is when the process 4 is the final process).
[0088]
For example, for the product 6 in the process 1 described with reference to FIG. 14A, the process end time is 70 minutes (= 80 minutes-10 minutes (= inter-process lead time)) before the process end scheduled time. The production schedule has been changed. In addition, for the product 4 in the process 2 described with reference to FIG. 14B, the scheduled processing start time of the product 4 in the process 2 is 90 minutes (= 80 minutes + 10 minutes (= inter-process lead time)) or later. In addition, the production schedule of the process 2 is changed so as to be before 210 minutes (= 220 minutes−10 minutes (= inter-process lead time)). Furthermore, the number of setup changes in step 1 to step 4 was 2, 3, 3, and 1 in the initial schedule, respectively, but in the changed production schedule shown in FIG. The production efficiency has been improved by reducing the total number of times twice, once, and once.
[0089]
On the other hand, for product 4, the scheduled process start time in process 2 is earlier than the scheduled process end time in process 1, and for product 5, the scheduled process end time in process 3 is scheduled to be greater than the scheduled process end time in process 2. The production schedule is too early to execute.
Originally, if there is a delay from the scheduled processing start time in the next process, the production schedule between the processes is inconsistent (that is, the production schedule becomes infeasible). The production schedule that there is no delay from the scheduled processing start time in the process immediately after the scheduled processing end time of each product is adopted because the method of obtaining a production schedule that satisfies the constraints in the process (that is, executable) is obtained. This is due to the fact that it is included in the evaluation function as an evaluation item without being a constraint condition.
[0090]
FIG. 16 is an example of a chart showing a production schedule finally obtained by performing a schedule change process on the initial production schedule shown in FIG. The abscissa is the elapsed time with the origin at the time when processing of the product in the process 1 (product 1 in this case) is started, and the production schedule of the processes 1 to 4 is described in this order in the vertical direction. Here, the processing time of each product is represented by a white square, and the number in the white square represents a product number. In addition, a hatched square represents a setup change. In addition, the ▲ mark at the bottom represents the timing of process delivery times T10 to T60 in the process 4 of the products 1 to 6 (the delivery date is when the process 4 is the final process).
[0091]
The production schedule in each process 1-4 is optimized, and the delay with respect to process delivery date T10-T60 of process 4 is eliminated for all products 1-6. Further, in step 3, which is a step emphasizing production efficiency, the number of setup changes is “0”, and the production schedule is high in production efficiency.
[0092]
As described above, the schedulers 1 to 4 determine the processing order of a plurality of (here, six) products for each of the four processes constituting the production line. Since the data transfer between the schedulers 1 to 4 is instructed and the execution of the processes of the schedulers 1 to 4 is instructed, the production schedule for the entire line is efficiently determined.
[0093]
Further, in the schedulers 1 to 4, the evaluation units 11a13 to 14a13 use the scheduled processing start time and the scheduled processing end time of each product obtained by the scheduled time calculation units 11a12 to 14a12 to improve the production efficiency of the production schedule for each process. Since the production schedule is changed for each process based on the evaluation result (value of the evaluation function Ei) by the evaluation units 11a13 to 14a13, the schedule change unit 11a15 to 14a15 generates an appropriate production schedule for the production efficiency of each process. Is done.
[0094]
Further, the achievement of the delivery date of the production schedule for each process is evaluated by the evaluation units 11a13 to 14a13 using the process startable time acquired by the data acquisition units 11a11 to 14a11, and the evaluation unit 11a13 is evaluated by the schedule change units 11a15 to 14a15. Since the production schedule is changed for each process based on the evaluation result (value of the evaluation function Ei) by ˜14a13, an appropriate production schedule is generated with respect to the production efficiency and delivery date achievement of each process.
[0095]
In addition, since the evaluation unit 11a13 to 14a13 evaluates the production schedule by obtaining the value of a predetermined evaluation function Ei that performs weighted addition using the weight information of the weight storage units 11a23 to 14a23, simple calculation The production schedule is evaluated.
[0096]
Further, since the weights stored in the weight storage units 11a23 to 14a23 are set for each process by the weight setting units 11a14 to 14a14 of the schedulers 1 to 4, it is possible to set an appropriate weight according to the feature of the process. Become.
[0097]
Further, the schedule change unit 11a15 to 14a15 counts the production schedule change count Ni, and the weight setting unit 11a14 to 14a14 sets the delivery date achievement degree weight γi in accordance with the increase in the change count Ni. Appropriate production schedule can be obtained in terms of performance and delivery time.
[0098]
In addition, among the plurality of steps 1 to 4 constituting the production line, the weight setting unit 14a14 of one step (here, step 4) is compared with the weight setting units 11a114 to 13a14 of the other steps 1 to 3. The weight γi of the achievement degree of the delivery date corresponding to the increase in the number of changes Ni is increased more quickly. Therefore, since the weight setting unit 14a14 in step 4 increases the weight γi of the delivery date achievement degree according to the increase in the number of changes Ni faster than the weight setting units 11a114 to 13a14 in other steps 1 to 3, the delivery date A production schedule that can achieve the above is generated.
[0099]
In addition, this invention is applicable also to the following aspects.
[0100]
(A) In the present embodiment, the case where the production line is a production line in which the order of processes for all products is the same (referred to as a flow shop type) has been described. However, the order of the processes to be processed according to the type of product The present invention is also applicable when the production lines are different (called job shop type). Hereinafter, the scheduling apparatus 1 ′ applied to the job shop type production line will be described. However, the same configuration as that of the scheduling device 1 applied to the above-described flow shop type production line is omitted, and only different portions will be described.
[0101]
FIG. 17 is an example of a configuration diagram of a scheduling apparatus 1 ′ applied to a job shop type production line. The scheduling apparatus 1 ′ has four schedulers 11 ′ to 14 ′ that determine the processing order of six products for every four processes, and the scheduler 11 ′ to 14 ′, and the data of the scheduler 11 ′ to 14 ′. In addition to instructing the transfer, the control device 2 that instructs the execution of the processes of the schedulers 11 ′ to 14 ′ and the schedule DB 4 that stores data transferred between the schedulers 11 ′ to 14 ′ are provided. The schedulers 11 ′ to 14 ′ exchange the scheduled process start time, the scheduled process end time, and the process startable time of each product via the schedule DB 4. That is, each of the schedulers 11 ′ to 14 ′ is data used when writing the scheduled process start time, the scheduled process end time, and the process startable time of each product, and changing the production schedule based on the value of the evaluation function Ei. The processing end scheduled time information of each product in a certain immediately preceding process and the processing start possible time of each product in the immediately following process are acquired by reading from the schedule DB 4.
[0102]
Note that the scheduling apparatus 1 ′ shown in FIG. 17 is applicable not only when the order of processes to be processed differs depending on the type of product, but also when there are processes that are not processed (the process is omitted) depending on the type of product. It is.
[0103]
(B) In this embodiment, although the case where a production line consists of four processes was demonstrated, what is necessary is just the form which consists of a some process. As the number of processes constituting the production line increases, the effect of the present invention that an appropriate production schedule is efficiently generated becomes more apparent.
[0104]
(C) In this embodiment, the case where the number of products for which the production schedule is determined is six has been described, but a plurality of products may be used. As the number of products increases, the effect of the present invention that an appropriate production schedule is efficiently generated becomes more apparent.
[0105]
(D) In the present embodiment, the case where the schedulers 11 to 14 include the processing time storage units 11a22 to 14a22 for storing the processing time in each process of each product has been described. However, the processing time is determined based on the product condition (weight, size, It may be determined based on the processing conditions).
[0106]
(E) In the present embodiment, the data output units 11a16 to 14a16 of the schedulers 11 to 14 output the scheduled process end time information and the process startable time information, and the data acquisition units 11a11 to 14a11 include the scheduled process end time information of the immediately preceding process. However, the data output units 11a16 to 14a16 output either one of the scheduled process end time information and the process startable time information, and the data acquisition units 11a11 to 11a11. 14a11 may acquire one of the process end scheduled time information of the immediately preceding process and the process start possible time information of the immediately following process. In this case, the processing is simplified.
[0107]
(F) In this embodiment, the evaluation function Ei is the sum of the setup change times, the sum of the delay times from the process delivery date of the scheduled process end time, and the scheduled process end time [(scheduled process start time of the immediately following process) − ( In the above description, the sum of the delay times from the process delivery time, the sum of the delay times from the process delivery time, and the scheduled processing end time It may be defined using at least one of the total delay times from [(scheduled process start time of the immediately following process) − (inter-process lead time)], or may be a form using another evaluation index.
[0108]
(G) In the present embodiment, the case where the weights αi and βi of the evaluation function Ei are fixed values has been described. However, the weight may be changed according to the number of schedule changes as with the weight γi. In this case, an appropriate production schedule can be obtained more efficiently.
[0109]
(H) In the present embodiment, the case where the initial production schedule is generated by the initial schedule generation units 11a10 to 14a10 has been described. However, the initial production schedule is generated and stored in advance according to a predetermined rule. May be read.
[0110]
【The invention's effect】
According to the first aspect of the present invention, the process order of a plurality of products is determined for each of a predetermined number of processes constituting the production line by the process scheduling means, and the process means for the process scheduling means. Data transfer between the process scheduling means is instructed, and execution of the process of the process scheduling means is instructed, so that the production schedule for the entire line can be determined efficiently.
[0111]
Further, in the scheduling means for each process, the evaluation unit evaluates the production efficiency of the production schedule for each process by using the scheduled process start time and the scheduled process end time of each product obtained by the scheduled time calculation unit, and the production by process. Since the schedule change unit changes the production schedule for each process based on the evaluation result by the evaluation unit, an appropriate production schedule can be generated with respect to the production efficiency of each process.
[0112]
According to the invention described in claim 2, the achievement of the delivery date of the production schedule by process is evaluated by the evaluation unit using the process startable time acquired by the data acquisition unit, and the production schedule change unit by process Since the production schedule for each process is changed based on the evaluation result by the evaluation unit, an appropriate production schedule can be generated with respect to the production efficiency and delivery date achievement of each process.
[0113]
According to the invention described in claim 3, since the evaluation unit evaluates the production schedule by obtaining a value of a predetermined evaluation function for performing weighted addition using the weight information of the weight storage unit, a simple calculation is performed. Can be used to evaluate production schedules.
[0114]
According to the fourth aspect of the present invention, since the weight to be stored in the weight storage unit is set for each process by the weight setting unit of the scheduling means for each process, an appropriate weight according to the feature of the process is set. Can do.
[0115]
According to the invention described in claim 5, the number of times of change of the production schedule is counted by the production schedule change unit by process, and the weight of the achievement degree of the delivery date is set large according to the increase of the number of changes by the weight setting unit. Therefore, it is possible to obtain an appropriate production schedule with respect to productivity and delivery date.
[0116]
According to the sixth aspect of the present invention, the weight setting unit of one process among the plurality of processes constituting the production line responds to an increase in the number of changes compared to the weight setting unit of other processes. The weight of achievement of delivery date is increased more quickly. Therefore, when the weight setting unit of the final process increases the weight of achievement of the delivery date according to the increase in the number of changes compared with the weight setting unit of the other process, the production schedule that can achieve the delivery date is set. Can be generated.
[0117]
According to the invention described in claim 7, the processing order of a plurality of products is determined for each of a predetermined number of processes constituting the production line by the process-specific scheduling means, and the control means determines the process order for the process-specific scheduling means. Data transfer between the process scheduling means is instructed, and execution of the process of the process scheduling means is instructed, so that the production schedule for the entire line can be determined efficiently.
[0118]
Further, in the scheduling means for each process, the evaluation unit evaluates the production efficiency of the production schedule for each process by using the scheduled process start time and the scheduled process end time of each product obtained by the scheduled time calculation unit, and the production by process. Since the schedule change unit changes the production schedule for each process based on the evaluation result by the evaluation unit, an appropriate production schedule can be generated with respect to the production efficiency of each process.
[Brief description of the drawings]
FIG. 1 is an example of a configuration diagram of a scheduling apparatus according to the present invention.
FIG. 2 is an example of a hardware configuration diagram of a scheduler.
FIG. 3 is an example of a functional configuration diagram of a control unit of a scheduler.
FIG. 4 is an example of an explanatory diagram of a post-process delivery date.
FIG. 5 is an example of an explanatory diagram of a post-process processable time.
FIG. 6 is an example of an explanatory diagram about an influence of a coefficient Ki on a weight γi and a production schedule.
FIG. 7 is an example of a hardware configuration diagram of a control device.
FIG. 8 is an example of a functional configuration diagram of a control unit of the control device.
FIG. 9 is an example of a flowchart showing an outline of processing of a control unit of the control device.
10 is an example of a flowchart showing processing of a scheduler corresponding to steps S1 and S3 in FIG.
FIG. 11 is an example of a flowchart showing processing of a scheduler corresponding to steps S5 to S11 of FIG.
FIG. 12 is an example of a chart showing whether or not setup change is necessary.
13 is an example of a chart representing an initial production schedule generated in step S101 of the flowchart of FIG.
FIG. 14 is an example of an explanatory diagram of an information exchange process performed in step S103 of the flowchart of FIG.
15 is an example of a chart showing a production schedule obtained by changing the initial production schedule shown in FIG. 13 by the schedule change process performed in step S515 of the flowchart of FIG.
16 is an example of a chart showing a production schedule finally obtained by performing a schedule change process on the initial production schedule shown in FIG. 13;
FIG. 17 is an example of a configuration diagram of a scheduling apparatus applied to a job shop type production line.
[Explanation of symbols]
1 Scheduling device
11-14 scheduler (scheduling means by process)
11a to 14a control unit
11a1-14a1 CPU
11a10-14a10 initial schedule generation part
11a11-14a11 data acquisition part
11a12-14a12 scheduled time calculation part
11a13-14a13 evaluation part
11a14-14a14 Weight setting unit
11a15-14a15 schedule change part
11a16-14a16 data output part
11a2-14a2 RAM
11a21-14a21 Schedule storage unit (process-specific schedule storage unit)
11a22-14a22 processing time storage unit
11a23-14a23 Weight storage unit
2 Control device (control means)
2a Control unit
2a1 CPU
2a11 Process execution control unit
2a12 Input / output control unit
2a2 RAM

Claims (7)

A plurality of types of products having two or more predetermined numbers of processes, in which preceding and following processes are set in advance for each of the predetermined number of processes, and manufacturing conditions in different manufacturing conditions in at least one of the predetermined number of processes. A scheduling device that determines a production schedule for each process, which is a processing order of a plurality of products in each process of a production line to be manufactured,
The predetermined number of process-specific scheduling means for determining the processing order of the plurality of products for each of the predetermined number of processes;
Instructing the process scheduling means to exchange data between the process scheduling means, and a control means to instruct execution of the process of the process scheduling means,
Each process scheduling means, a process schedule storage unit that stores process-specific production schedule information that is the processing order of products in its own process,
A data acquisition unit that receives an instruction to send and receive data from the control means, and acquires process end scheduled time information of each product from the process-specific scheduling means immediately before the own process;
Using the production schedule information for each process and the scheduled process end time information of the immediately preceding process, a scheduled time calculation unit for obtaining a scheduled process start time and a scheduled process end time for each product;
An evaluation unit that evaluates the production efficiency of the production schedule according to the process using the scheduled process start time and the scheduled process end time of each product obtained by the scheduled time calculation unit;
Based on the evaluation result by the evaluation unit, the production schedule by process is changed, and the production schedule change unit by process is updated and stored in the process schedule storage unit;
A data output that receives an instruction to send / receive data from the control means and outputs the scheduled processing end time information of each product obtained by the scheduled time calculation unit to the process-specific scheduling means immediately after the own process A scheduling apparatus. The data acquisition unit acquires process start possible time information that is a process end scheduled time of a product processed immediately before each product in the immediately subsequent process from the process-specific scheduling unit immediately after the own process,
The evaluation unit evaluates the achievement degree of the delivery date of the production schedule according to the process using the process startable time acquired by the data acquisition unit,
The data output unit uses the process-by-process scheduling means of the process immediately before its own process as the process start possible time information that is the process end scheduled time of the product processed immediately before each product obtained by the scheduled time calculation unit. The scheduling apparatus according to claim 1, wherein the scheduling apparatus outputs the scheduling apparatus. The scheduling means for each process includes a weight storage unit that stores weight information used in the evaluation unit,
The scheduling apparatus according to claim 1, wherein the evaluation unit performs evaluation by obtaining a value of a predetermined evaluation function for performing weighted addition using weight information of the weight storage unit. The scheduling means for each process includes a weight setting unit that sets a weight to be stored in the weight storage unit,
The scheduling apparatus according to claim 3, wherein the weight setting unit sets a weight for each process. The process-specific production schedule changing unit counts the number of times the production schedule is changed,
The scheduling apparatus according to claim 4, wherein the weight setting unit sets the weight of the achievement degree of the delivery date to a large value in accordance with the increase in the number of changes. Among the plurality of steps, the weight setting unit of one step increases the weight of the achievement degree of the delivery date according to the increase in the number of changes compared to the weight setting unit of another step. 6. The scheduling apparatus according to claim 4, wherein the scheduling apparatus is large. A plurality of types of products having two or more predetermined numbers of processes, in which preceding and following processes are set in advance for each of the predetermined number of processes, and manufacturing conditions in different manufacturing conditions in at least one of the predetermined number of processes. A scheduling program for determining a production schedule for each process, which is a processing order of a plurality of products in each process of a production line to be manufactured, wherein the computer determines a processing order of the plurality of products for each predetermined number of processes. The predetermined number of process-by-process scheduling means,
Instructing the process scheduling means to exchange data between the process scheduling means and function as a control means to instruct execution of the process of the process scheduling means,
Each process scheduling means, a process schedule storage unit that stores process-specific production schedule information that is the processing order of products in its own process,
A data acquisition unit that receives an instruction to send and receive data from the control means, and acquires process end scheduled time information of each product from the process-specific scheduling means immediately before the own process;
Using the production schedule information for each process and the scheduled process end time information of the immediately preceding process, a scheduled time calculation unit for obtaining a scheduled process start time and a scheduled process end time for each product;
An evaluation unit that evaluates the production efficiency of the production schedule according to the process using the scheduled process start time and the scheduled process end time of each product obtained by the scheduled time calculation unit;
Based on the evaluation result by the evaluation unit, the production schedule by process is changed, and the production schedule change unit by process is updated and stored in the process schedule storage unit;
A data output that receives an instruction to send / receive data from the control means and outputs the scheduled processing end time information of each product obtained by the scheduled time calculation unit to the process-specific scheduling means immediately after the own process A scheduling program that functions as a section.

Images