JP4430282B2 - Work schedule creation support system - Google Patents

Description

ここで、ｆ_type（ｘ）は、割付条件の種類ごとに、勤務表ｘに対する割付条件違反のペナルティ値を求める関数である。ペナルティ値の計算方法の例を以下に示す。
【００６８】
まず、勤務パターン条件のペナルティ値の計算方法としては、例えば「病棟の全職員について準夜−深夜のならびを回避する（重み１００）」という条件があるとき、勤務表中に準夜−深夜の並びになっている個所が５個所あるならば、５×１００＝５００をペナルティ値とすることができる。
【００６９】
また、勤務供給条件として、「職員Ａの１ヶ月間の準夜勤務を下限４回とする（重み５０）」という条件があるとき、勤務表中の職員Ａの準夜勤務の回数合計が２回ならば、職員Ａの準夜勤務は条件で指定された回数を２回下回っているので、この勤務供給条件に対するペナルティ値は、２×５０＝１００となる。
【００７０】
ここでは、勤務パターン条件と勤務供給条件におけるペナルティ値の計算方法の一例を述べたが、他の条件についても条件に違反する度合いが大きいほど大きな値を与えるような計算方法を定めて計算を行ってよい。
【００７１】
なお、上記の勤務パターン条件、勤務供給条件についても計算方法は上記以外の方法も考えられる。例えば、勤務供給条件のペナルティ値の計算を例にとれば、下限の条件で指定された回数（４回）を下回った量（２回）の二乗に対して重みを掛けた値をペナルティ値とする（ペナルティ値は、２²×５０＝２００となる）方法などが考えられる。
【００７２】
一方、追加条件の違反度を示す追加ペナルティ関数ｐ（ｘ）は、以下のように定義される。
【００７３】
【数２】

ここで、ｐ_i（ｘ）は勤務表ｘに対する追加条件ｉに対する追加条件ペナルティ値を求める関数である。この関数の一例を示すと以下のようになる。
【００７４】
【数３】

ここで、αは追加条件を評価値に反映させる度合いを示す定数、ｔ_iは追加条件ｉの修正試行回数、ｇ_i（ｘ）は勤務表ｘに対する追加条件違反の度合いを示す関数である。
【００７５】
初期割付処理のときには、追加条件はまだ入力されていないので、追加条件記憶部８には追加条件が存在しない。つまり、いかなる勤務表ｘに対してもｐ（ｘ）＝０となる。一方、追加条件記憶部８に追加条件が登録されている場合には、それらの追加条件のうち追加条件違反状態のものに対して追加ペナルティ値が計算される。ここでの追加ペナルティ値の計算方法は、目的関数の場合と同様、追加条件に違反している度合いが大きいほど大きな値をとるような方法であればよい。もちろん、目的関数と同様の計算方法を使用してもよい。
【００７６】
ここで、αの値は、修正試行回数の増加に伴ってその追加条件に対するペナルティ値が他の割付条件のペナルティ値に近づくような値を適当に定めればよい。例えば、割付条件の強さの平均の１／１０程度にすればよい。但し、この値に限定するものではなく、例えば、前回の反復の際に得られた勤務表の評価値に基づいて決めることも可能である。
【００７７】
また、追加条件ごとに異なるαの値を設定することもできる。例えば、違反した割付条件が追加条件となっている場合、その割付条件の重みを基準に設定（例えば、対応割付条件の重み値の１／１０）とすれば、各追加条件のαの値は、対応する割付条件の重み値によって異なってくる。また、割付条件とは独立させて、αの値をどの追加条件の違反を優先的に解消させるかという優先度として用いることもできる。
【００７８】
ここで、評価値算出の一例として、図７に示すような３種類の追加条件が追加条件記憶部８に登録されているとき、図２に示す勤務表に対するペナルティ値の計算方法の例を以下に示す。なお、α＝１０とする。
【００７９】
勤務表は、追加条件「職員「加藤」の２日〜３日の準夜−深夜の並びを回避する」に違反している。よって、この追加条件は追加条件違反状態である。この追加条件に対する違反の度合いｇ_i（ｘ）は、違反が発生している場合は１、していない場合は０の値を取るとすると、この場合はｇ_i（ｘ）＝１となる。また、修正試行回数ｔ_i＝１なので、この追加条件に対する追加条件ペナルティ値は、ｐ_i（ｘ）＝１０・１・１＝１０となる。それ以外の２つの追加条件は、図で示された勤務表ではすでに解消されている。従って、各追加条件ペナルティ値は０となる。これより、全ての追加条件に対する追加ペナルティ関数の値はｐ（ｘ）＝１０＋０＋０＝１０となる。
【００８０】
追加ペナルティ関数により得られる追加ペナルティ値ｐ（ｘ）は、上記式から明らかなように、追加条件違反状態の追加条件が存在するとき、各ｐ_i（ｘ）に修正試行回数ｔ_iを乗算して算出される。従って、割付処理を繰り返し行っているのにもかかわらず追加条件違反状態が解消されない状態が継続すると、追加ペナルティ値ｐ（ｘ）は増加していく。修正試行回数ｔ_iは、全ての条件違反が解消されていなければ処理の繰り返しにより図６のステップ５０３で加算される値なので、違反状態である追加条件の違反度合いを示すパラメータの１つであるということができる。一方、目的関数により得られるペナルティ値ｆ（ｘ）は、修正試行回数（反復回数）に依存しない。すなわち、割付処理が繰り返し行われると、評価値に対する追加ペナルティ値が占める割合が大きくなり、これに伴い評価値自体も大きくなってしまう。本実施の形態における割付実行部１６は、評価値計算部６から得られる評価値がなるべく小さくなるように勤務表マトリクスの各要素値を決定するので、結果的に割付条件に対する違反より追加条件、すなわち勤務作成者により入力指定された条件の違反を優先的に解消するように作用する。ステップ５０２において追加条件違反状態の追加条件が複数存在する場合、修正実行部１８は、そのうち一つの追加条件を自動選択するが、いずれの追加条件を選択しても、その選択された追加条件の修正試行回数が１加算されるので、各追加条件の追加条件ペナルティ値ｐ_i（ｘ）の総和により得られる追加ペナルティ値ｐ（ｘ）は大きくなる。従って、修正実行部１８が修正試行回数を加算することになる追加条件をランダムに選択しても問題はない。
【００８１】
また、修正割付処理においてマトリクスの要素値変更処理（ステップ５０８）が繰り返し行われることによって、条件違反状態でなくなった追加条件も条件違反状態となってしまう可能性もある。しかしながら、このような場合も、割付実行部１６は、修正試行回数を増やし（ステップ５１８，５０３）、マトリクスの要素値変更処理（ステップ５０８）を改めて行うことにより復活した条件違反を再度解消するように作用する。
【００８２】
修正実行部１８では、評価値計算部６から得られる評価値がなるべく小さくなるように勤務表マトリクスの各要素値を決定する手法として山登り法等の所定のアルゴリズムを用いているが、たとえこのようなアルゴリズムを用いたとしても、特定の状況下では、割付処理を繰り返し行っても評価値を小さくできない可能性がある。そこで、本実施の形態では、ステップ５０３で選択した追加条件の修正試行回数が予め設定した規定回数を超過した場合には（ステップ５０４）、その追加条件に従った勤務表の変更はできないものとみなして、選択した追加条件を追加条件記憶部８から削除する（ステップ５１７）。追加条件を削除した後、その他に条件違反状態の追加条件が存在しなければ、修正割付処理を終了し、解消されていなければ、ステップ５０２に戻って解消されていない条件違反が解消するまで処理を反復して行う（ステップ５１８）。
【００８３】
また、本実施の形態では、修正割付処理の途中で所定のアルゴリズムを変更できるようにした。すなわち、山登り法等採用しているアルゴリズムで評価値を小さくする際に限界に達しても、整数計画法等他のアルゴリズムに変更することにより、評価値を小さくできる可能性があるからである。このアルゴリズムの変更は、勤務表作成者からの指示に従い変更するようにしてもよいし、所定回数以上反復しても評価値が小さくならないときに、修正実行部１８が自動的に変更するようにしてもよい。
【００８４】
なお、本実施の形態では、評価値の小さい方が改善され評価の高い勤務表が得られるものとして説明した。つまり、評価値計算部６から得られる評価値がなるべく小さくなるように勤務表マトリクスの各要素値を決定するようにしたので、条件違反しているときにはペナルティ値を加算するようにした。しかし、この大小関係を逆にしてもよいことは言うまでもない。
【００８５】
以下、本実施の形態における勤務表の作成処理について具体例をあげて説明する。ここでは、具体的な処理の例として、図８で示す前提のもとに、実際に修正を行う過程の例を図９，１２に示す。この例では、修正割付の過程を端的に示すために、職員４名、４日間の勤務表を例として用いた。
【００８６】
図９（ａ）には、初期割付処理により作成され、表示された勤務表が示されている（図３のステップ１００，２００）。この勤務表では、職員Ｂの勤務状況が割付条件のうち「深夜−深夜の並びを回避する（重み９０）」という勤務パターン条件に違反している。この違反箇所は反転表示されているので、作成者は、修正すべき勤務状況を容易に認識できる。作成者は、その違反箇所をクリック操作することで修正指示を入力する（図３のステップ３００）。この操作に応じて修正割付処理（図３のステップ５００）が開始される。
【００８７】
修正割付処理では、作成者により入力指定された箇所に対応する割付条件を追加条件として追加条件記憶部８に登録する（図６のステップ５０１）。この初期登録時での修正試行回数は、図９（ｂ）に示すように０である。しかしながら、追加条件はこの時点では１つのみなので、この追加条件が選択されることにより（図６のステップ５０２）、その追加条件の修正試行回数はすぐに加算され１になる（図６のステップ５０３）。図９（ｃ）は、図９（ａ）を転記した図であるが、目的関数ｆ（ｘ）の値は上記式（２）に従い９０、追加ペナルティ関数ｐ（ｘ）の値はα＝１０とすると上記式（３），（４）に従い１０となるので、この勤務表における評価値、すなわち評価関数Ｅ（ｘ）の値は上記式（１）に従い９０＋１０＝１００となる（図６のステップ５０６）。
【００８８】
ここで、図８に示した割付時の勤務表マトリクスの変更方法に従い、図６のステップ５０８〜５１６を繰り返し行うことで勤務表マトリクスの要素値を変更する。この処理では、評価値の小さい勤務表になるように要素値を変更するが、この例では、評価値の小さい勤務表へ変更できず、初期割付により作成した勤務表がそのまま残る。この結果を示した例が図９（ｄ）になる。
【００８９】
上記処理では、所定回数又は所定時間、勤務表マトリクスの要素値の変更を繰り返したにもかかわらず追加条件が解消できなかったので（図６のステップ５１５，５１６，５１８）、図６のステップ５０２に戻る。ここで、追加条件記憶部８に登録されている追加条件は１つのみなので、その追加条件が再度選択され、その修正試行回数は更に１加算され２になる（図６のステップ５０３）。
【００９０】
そして、図９（ｄ）に示した勤務表における評価値が計算されることになる（図６のステップ５０６）。この勤務表における目的関数値は９０と変わらないが、追加ペナルティ値は修正試行回数が２となったことで２０となる。よって、この勤務表における評価値は上記式（１）に従い９０＋２０＝１１０となる。このように、同じ勤務表であっても処理の繰り返しに伴い追加ペナルティ値が増えることにより評価値が大きくなる。
【００９１】
ここで、上記と同様に、図６のステップ５０８〜５１６を繰り返し行うことで勤務表マトリクスの要素値を変更する。ここでの処理では、図８に示した割付時の勤務表マトリクスの変更方法に従い、図１０（ｅ）に示した矢印のように職員Ｂと職員Ｃの２日の勤務状況を入れ替えてみたとする（図６のステップ５０８）。入れ替えた後の勤務表を図１０（ｆ）に示す。この入れ替えにより追加条件は解消されるが、今度は職員Ｃの勤務状況が割付条件のうち「休み−深夜の並びを回避する（重み１００）」という４番目の勤務パターン条件に違反することになる。この変更した勤務表における目的関数値は１００と増えるが、追加ペナルティ値は違反している追加条件がないので０となる。これにより、変更後の勤務表における評価値は上記式（１）に従い１００＋０＝１００となる（図６のステップ５０９）。従って、変更後の評価値の方が小さくなるので、この勤務表を記憶する（図６のステップ５１２）。
【００９２】
更に、図６のステップ５０８に戻り、図８に示した割付時の勤務表マトリクスの変更方法に従い、今度は図１０（ｆ）に示した矢印のように職員Ｂと職員Ｃの１日の勤務状況を入れ替えてみたとする。入れ替えた後の勤務表を図１０（ｇ）に示す。この入れ替えにより違反する割付条件はなくなり、かつ追加条件もない。すなわち、変更後の勤務表における目的関数値、追加ペナルティ値共に０となり、この結果、変更後の勤務表における評価値は上記式（１）に従い０となる（図６のステップ５０９）。従って、変更後の評価値の方が小さくなるので、この勤務表を記憶する（図６のステップ５１２）。
【００９３】
更に、図６のステップ５０８に戻り、勤務マトリクスの要素値を変更し、その変更前後の評価値を比較しても評価値０の勤務表を改善することはできない。そして、所定回数又は所定時間経過後、図６のステップ５１８において追加条件が全て解消されていることが確認されると、修正割付処理は終了する。この修正割付処理において作成される勤務表を図１０（ｈ）に示す。なお、図１０（ｈ）は図１０（ｇ）を転記した図である。
【００９４】
このようにして作成された勤務表が画面表示されると（図３のステップ２００）、作成者は、反転表示部分がないことによりこの勤務表はいずれの割付条件にも違反していないことを認識できる。この勤務表でよければ、作成者は、修正指示を入力せずに勤務表作成処理を終了させる（図３のステップ５００）。なお、前述したように、本実施の形態では、違反箇所がなくても割り付けられた内容を変更したければ、該当する箇所をクリックすることで変更することは可能である。
【００９５】
本来、この程度のサイズの勤務表であれば、初期割付だけで十分に良い勤務表が得られる可能性が高く、後から修正する必要性は少ない。しかし、実際に用いられる大きい勤務表では、初期割付で得られた勤務表に対して何らかの修正が必要となることは最初に説明した通りである。ここで例示する処理は、サイズが大きい勤務表に対してもそのまま使用できるものであり、修正過程の説明を平易に行うために、その方法を小さいサイズの勤務表において説明するものである。また、割付処理における所定のアルゴリズムとして、勤務表マトリクスの変更方法に「職員順、日付順に同一日の２名の職員の勤務を交換する」という方法を例として用いた。修正実行部１８の説明でも述べたように、ここで用いるアルゴリズムは初期割付で用いるアルゴリズムとは別のものであってもよい。
【００９６】
最後に、本実施の形態における勤務表作成支援システムに対するユーザインタフェイスを確認すると、勤務表作成者は、本システムを起動して勤務表を作成する。ここで作成され表示される勤務表というのは、初期割付処理により作成された勤務表であり、前述したように通常は条件違反が発生している。ここで、勤務表作成者は、警告表示を参照するなどして解消したいと考える条件違反箇所をマウスクリックにより指定する。マウスクリックする箇所を具体的に言えば、勤務表上における反転表示部分あるいは図５に示した警告メッセージである。もちろん、違反していない部分も指定可能であることは前述したとおりである。このマウスクリックに応じて修正割付処理が実行される。この結果、修正された勤務表が表示される。修正後もまだ条件違反が残っているなどの理由で更に勤務表を修正したい場合、勤務表作成者は、上記と同様にその修正箇所をマウスクリックにより指定する。このような作成された勤務表に対し修正箇所をマウスクリックにより指定することで勤務表を改善することができる。
【００９７】
以上のように、本実施の形態によれば、勤務表作成の際の修正に関して、勤務表作成者により入力指定された要素の要素値を効果的に自動修正することができるので、勤務表作成者は、修正したいと考える勤務状況部分を指定するだけでよく、効果的に勤務表を修正することができる。
【００９８】
なお、本実施の形態は、条件違反等により変更すべき要素値を自動的に修正することで勤務表作成者にかかる負担を軽減するものである。しかし、勤務表作成者による要素値の設定を否定するものではなく、従来と同様に各要素に所望の要素値を手動により入力設定できるようにしてもよい。また、本実施の形態では、条件違反を解消するために勤務表マトリクスの要素値変更をランダムに行っている（図６のステップ５０８）。つまり、各要素値は条件違反の有無に関係なく直前の勤務表と異なる場合がある。このため、勤務表作成者が手動で設定した要素値も割付処理の反復で変更されてしまう可能性がある。これを避けるには、割付条件に対する重みを設定変更できる機能を設けておき、要素値を変更させたくない要素に対する重みを極めて大きい値に設定しておけば、評価値が小さくなるように勤務表マトリクスを作成する割付実行部１６は、その要素値が変更するような勤務表マトリクスを採用しない（図６のステップ５１１，５１３）。なお、勤務表作成者により手動で要素値が入力設定されたときは、その要素値を割付条件に自動登録し、その際に設定する重みを極めて大きい値に設定するよう自動処理するようにしてもよい。
【００９９】
また、上記実施の形態においては、看護婦の勤務表の作成支援システムを実現するものであったが、本発明はこれに限定されず、例えば警備員、パイロット、タクシードライバーなどの交代制の勤務形態をもつ職種の勤務表作成にあたっても同様に適用可能である。
【０１００】
【発明の効果】
本発明によれば、勤務表作成者は勤務表の修正を行う場合に、修正したいと考える個所を指示するだけでよく、修正に際してその個所の値をどんな値に変更すべきか、またその変更に伴って他の個所を派生的にどのように変更する必要があるかについて指示する必要がないため、勤務表修正の負担を大幅に軽減することができる。また、修正したい違反に対して追加ペナルティ値を与えるので、修正指示に伴う勤務表の変更箇所を少なく抑えることができ、勤務表作成者は、修正を視覚的に理解し易く、徐々に満足する勤務表に導くことができる。また、修正したい状態に対してペナルティ値を与えることで評価値を計算し勤務表の修正を行うため、その修正には最初に勤務表を自動作成するためのアルゴリズムをそのまま用いることもでき、その場合には修正に特化したルールを用意する必要がないというメリットがある。
【０１０１】
また、割付処理を反復して行う際に、割付処理の反復回数に応じた加重を課して追加ペナルティ値を再設定して評価値を計算するようにしたので、追加条件違反を優先的に解消する勤務表を作成することができる。
【０１０２】
また、割付処理を繰り返し行っても評価値を小さくできなくなったときに、採用しているアルゴリズムを他のアルゴリズムに変更できるようにしたので、評価値がより小さくなる改善された勤務表を作成することができる可能性がある。
【０１０３】
また、評価値計算手段により計算される評価値に反映させる追加ペナルティ値の度合いを追加条件毎に設定できるようにしたので、違反を解消させたい追加条件に優先度を持たせることができる。
【図面の簡単な説明】
【図１】 本発明に係る勤務表作成支援システムの一実施の形態を示した機能ブロック構成図である。
【図２】 本実施の形態において作成される勤務表の一例を示した図である。
【図３】 本実施の形態における勤務表作成処理の全体の流れを示したフローチャートである。
【図４】 本実施の形態における初期割付処理を示したフローチャートである。
【図５】 本実施の形態における警告表示例を示した図である。
【図６】 本実施の形態における修正割付処理を示したフローチャートである。
【図７】 本実施の形態における追加条件記憶部に登録される追加条件の例を示した図である。
【図８】 本実施の形態における修正割付処理を説明するための前提条件を示した図である。
【図９】 図８に示した前提条件に基づく修正割付処理による勤務表の遷移を示した図である。
【図１０】 図９に続く勤務表の遷移を示した図である。
【符号の説明】
２ 割付条件記述部、４ 入力部、６ 評価値計算部、８ 追加条件記憶部、１０ 勤務表作成処理部、１２ 表示処理部、１４ 勤務表保存部、１６ 割付実行部、１８ 修正実行部、２０ 違反判定部、２２ 違反記憶部、２４ 警告表示部。[0001]
BACKGROUND OF THE INVENTION
The present invention provides a work schedule creation support system for creating a work schedule (work schedule) for nurses and guards, and in particular, automatically corrects a location specified by the creator in the work schedule being created, and provides a new The present invention relates to a work schedule creation support system capable of presenting a work schedule.
[0002]
[Prior art]
In a hospital, for example, a nurse work schedule is created for each ward. The work schedule is prepared by a lady chief, etc., but various restrictions must be taken into account when preparing the work schedule. In other words, the work table creator needs to prepare so as to satisfy many conditions such as requests for work of nurses such as paid leave, various events, requests for qualifications and abilities. A schedule represented by a work schedule is usually expressed in a two-dimensional matrix of workers and work days, but each element on the two-dimensional matrix contains other elements in the vertical and horizontal directions (the same work day). Element values set for other workers or other working days of the same worker) (ie, work divisions such as day shift, night shift, and holiday), and further reference to the aggregate value of each element value, for each constraint condition Appropriate element values must be assigned while adjusting so as not to violate.
[0003]
However, it is usually difficult to create a perfect work schedule that satisfies all the conditions from the beginning. Therefore, when an actual headmaster creates a work schedule, the work schedule is completed for the time being, and corrections are made manually so as to eliminate conditions that violate the work schedule. As described above, in the past, a great deal of burden and labor is required to create a work schedule reflecting many conditions.
[0004]
In order to reduce the burden required for creating such work schedules, various support systems for automatically creating work schedules by computers have been proposed. This type of system generally uses either mathematical programming techniques or knowledge engineering techniques, but in any case, the conditions considered by the creator such as the head of a woman are expressed in a computer by some model. There is a need to. For example, in Japanese Patent Laid-Open No. Hei 4-15865, the creator expresses the constraint conditions by a knowledge base model and looks at the schedule table automatically created with the knowledge base set first, and the creator uses the priority of each constraint condition as a guideline for change. Proposals have been made to improve the knowledge base by hand, and to obtain a better solution at the next automatic creation.
[0005]
[Problems to be solved by the invention]
However, the conditions for creating the work schedule are very complex, and it is difficult to create a work schedule that satisfies the conditions in a practical time. Therefore, in order to more reflect the conditions that humans think, a practical system must have a function for correcting the automatically created work schedule later. Also in the above-described conventional example, the schedule table is modified by changing one or more elements in the automatically created schedule table to another value explicitly specified by the creator. As described above, many constraint conditions are set for creating a schedule table and a work table. By changing one element value of the work schedule, one of the constraint condition violations may be resolved, but another violation of the other constraint conditions may occur. For example, if you violate the condition that the number of night shift workers on a certain work day has not reached the specified number, and change the work category of Mr. A to night shift, it will be said that Mr. A's work status will not be continued in this time. There is a possibility of violating the condition and the condition that the predetermined number of night shifts per month is not exceeded. Furthermore, if the night shift of Mr. A's other work day is changed to a day shift in order to eliminate the violation of Mr. A's duty, there is a possibility that the number of night shift workers on the changed work day may not reach the predetermined number. .
[0006]
In other words, since many of the constraints related to work schedule creation are related to multiple elements of the work schedule, generally, when the value of one element is changed, the values of other elements are also changed at the same time. Often there is a need. For this reason, it cannot be known whether or not the element change determined first is appropriate unless other element changes accompanying the element change are made. However, it is not easy to know how to change the element change. In addition, when there are a plurality of candidate element values to be changed, it may not be easy to specify which element value should be selected.
[0007]
For this reason, it is necessary for the work schedule creator to perform various element changes in order to eliminate one “condition to be corrected” in the created work schedule. It has been difficult to create a satisfactory work schedule.
[0008]
The present invention has been made to solve the above-described problems, and the purpose of the correction is to indicate the work status that the creator wants to correct with respect to the correction at the time of creating the work schedule, and the work status Another object of the present invention is to provide a work schedule creation support system capable of automatically automatically and effectively correcting the element values set for other elements in association with the correction.
[0009]
[Means for Solving the Problems]
In order to achieve the above purpose, the work schedule creation support system according to the present invention is a work schedule creation support system that creates a work schedule including a two-dimensional matrix representing the work status of each worker. An allocation condition storage means for storing a creation condition for creating, a penalty value indicating a degree of condition violation with respect to the creation condition for the work table is calculated, and according to a predetermined algorithm so that the evaluation based on the penalty value is high An initial assignment processing means for creating a work schedule by executing an initial assignment process for assigning each work division on the two-dimensional matrix; a warning display means for displaying a warning of a condition violation with respect to the creation condition for the created work schedule; Additional condition storage means for storing additional conditions when correcting the created work schedule; Any violation of the conditions displayed in the warning The work schedule creator Specify input Is set in the additional condition storage means as the additional condition to eliminate the condition violation Input means and , Work A predetermined algorithm is calculated so that a penalty value indicating a violation degree with respect to the creation condition and an additional penalty value indicating a condition violation degree with respect to the additional condition are calculated for the service table, and the evaluation based on the penalty value and the additional penalty value is increased. And a modified assignment processing means for creating a work schedule by executing a modified assignment process for changing each work category on the two-dimensional matrix assigned by the initial assignment processing means. The correction allocation processing means resets an additional penalty value that imposes a weight on the additional penalty value for the additional condition if the condition violation for the additional condition is not resolved in the work schedule created by the correction allocation process. The correction allocation process is executed again so that the evaluation based on the penalty value and the additional penalty value is high. It is characterized by doing.
[0010]
According to the above configuration, when the input means indicates the location of the condition violation on the work schedule or the condition that the creator wants to correct, but the condition is not violated, the first allocation condition is as much as possible. The work schedule can be modified to match At this time, the work schedule creator does not need to change the element values for each element of the work schedule, and the burden on the creator can be greatly reduced and his intention reflected in the work schedule. Can be made.
[0011]
Further, the correction assignment processing means, when creating the work schedule, the additional condition stored in the additional condition storage means Against Until the violation of conditions is resolved Correction Repeat the allocation process, Correction In an iterative execution process of the allocation process, an additional penalty value with a weight corresponding to the number of iterations is reset and an evaluation value is calculated.
[0015]
The work schedule creation support system according to the present invention is a work schedule creation support system for creating a work schedule including a two-dimensional matrix representing the work status of each worker, and an allocation condition for storing creation conditions for creating the work schedule Initial value for assigning each work category on the two-dimensional matrix in accordance with a predetermined algorithm so as to calculate a penalty value indicating a degree of condition violation with respect to the creation condition for the work table and the work table, and to increase the evaluation based on the penalty value Initial assignment processing means for creating work schedules by executing assignment processing, warning display means for displaying warnings of violations of the conditions for the created conditions for the created work schedules, and additions for correcting the created work schedules The additional condition storage means for storing the condition, and the work schedule creator creates any condition violation among the condition violations displayed in the warning. Input means for setting the additional condition storage means as an additional condition to eliminate the violation of the condition by specifying the force, a penalty value indicating a violation degree with respect to the creation condition for the work schedule, and a condition violation degree with respect to the additional condition A correction is made to calculate an additional penalty value indicating the change and change each work division on the two-dimensional matrix assigned by the initial assignment processing means according to a predetermined algorithm so that the evaluation based on the penalty value and the additional penalty value is high A modified allocation processing means for creating a work schedule by executing allocation processing; The warning display means includes On the work schedule that has violated the conditions against the preparation conditions for the created work schedule Specify work status part To violate the conditions Display a warning, The input means sets, in the additional condition storage means, as an additional condition that the condition violation of the work status portion specified as input among the work status portions displayed as warnings by the warning display means is eliminated. It is characterized by doing.
[0016]
According to this configuration, when the location of the warning display is specified in the input means for what the work schedule creator wants to correct, an additional condition is configured from the condition violation that is the basis of the warning display. Therefore, it is possible to more easily input additional conditions that the work schedule creator thinks necessary.
[0017]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.
[0018]
FIG. 1 is a functional block configuration diagram showing an embodiment of a work schedule creation support system according to the present invention. The work schedule creation support system in the present embodiment includes an allocation condition description section 2, an input section 4, an evaluation value calculation section 6, an additional condition storage section 8, a work schedule creation processing section 10, a display processing section 12, and a work schedule storage section. 14. The work schedule creation processing unit 10 includes an allocation execution unit 16 and a correction execution unit 18, and the display processing unit 12 includes a violation determination unit 20, a violation storage unit 22, and a warning display unit 24.
[0019]
The allocation condition description unit 2 stores in advance a creation condition for creating a work schedule, in other words, an assignment condition for assigning work categories on a two-dimensional matrix of the work schedule. The input unit 4 inputs and sets the allocation conditions to be stored in the allocation condition description unit 2 before creating the work schedule or additionally. In addition, an input of conditions to be added when the work schedule is corrected, and a correction input for a two-dimensional matrix of the work schedule (hereinafter, “work schedule matrix”) are directly accepted. The additional condition storage unit 8 stores additional conditions input and designated by the work schedule creator via the input unit 4. The number of correction trials executed by the correction execution unit 18 is recorded for each additional condition. The evaluation value calculation unit 6 violates how much the work table created by the work table creation processing unit 10 violates the allocation conditions set and registered in the allocation condition description unit 2 and the additional conditions stored in the additional condition storage unit 8. Or an evaluation value indicating the degree of violation of the condition is calculated.
[0020]
Based on the allocation conditions set and registered in the allocation condition description section 2 and the additional conditions stored in the additional condition storage section 8, the work schedule creation processing section 10 assigns each work category on the two-dimensional matrix according to a predetermined rule. Create a work schedule by executing the allocation process. The allocation execution unit 16 included in the work table creation processing unit 10 determines each element value of the work table matrix so that the evaluation value obtained from the evaluation value calculation unit 6 is as small as possible. The work schedule storage unit 14 stores the assigned work schedule. The correction execution unit 18 controls the allocation execution unit 16 so that the additional condition violation state on the work schedule matrix is eliminated according to the instruction from the input unit 4 and the additional condition stored in the additional condition storage unit 8.
[0021]
The display processing unit 12 is a means for displaying a work schedule and violated conditions. The violation determination unit 20 included in the display processing unit 12 detects a condition violation in the displayed work schedule and stores it in the violation storage unit 22. The warning display unit 24 displays a warning for the violation when the violation determination unit 20 detects a condition violation.
[0022]
FIG. 2 is a diagram showing an example of a work schedule created by the work schedule creation processing unit 10 and displayed by the display processing unit 12 in the present embodiment. The work schedule in the present embodiment includes a two-dimensional matrix (work schedule matrix) indicating the work status of each worker. The allocation area is an area in which the work classification of each worker (staff) is allocated for a predetermined period (for example, one month) during which the work schedule is created, and the work schedule that is the allocation result is displayed. At the left end is the name of the staff member belonging to the ward, and at the top is the date. In the figure, “day”, “quasi”, “deep”, “absence”, “present”, “shake”, “special”, and “price” indicate the categories of attendance leave according to the display classification. It means "day shift", "quasi-night shift", "late night shift", "vacation", "paid leave", "transfer leave", "special leave", and "substitute holiday". When automatic allocation described later is executed, the generated allocation result is displayed in this area. It is also possible for the work schedule creator to directly input work using the input unit 4 such as a mouse or a keyboard. The hatched part shown on the left side in the figure represents the work status of the last week of the previous month. For example, it is considered when determining the work pattern conditions for the allocation of the first week of the current month. The
[0023]
In the horizontal tabulation area, the attendance leave classification according to the judgment classification (for counting the number of work) is shown in the horizontal direction, and correspondingly, there is a column for counting the number of work for each staff member along the vertical direction. Here, a value obtained by counting the number of times of work over the entire period for which the work schedule is created is displayed. When work is changed in the assignment area by input or automatic assignment by the work schedule creator, each aggregated value is also updated in real time.
[0024]
In the actual work total area, the total of the actual work hours for each staff member during the work schedule preparation period is displayed. When the work is changed in the assignment area by the work table creator's input or automatic assignment, the total value is also updated in real time.
[0025]
In the vertical tabulation area, the attendance leave category according to the number of judgment classification staff members (for tabulation) is shown in the vertical direction, and the number of workers for each category is displayed along the horizontal direction. Also, as will be described later, by selecting the tab at the bottom, it is possible to switch and display the tabulation for each attribute or group of the staff. When the work is changed in the assignment area by an input by the work schedule creator or automatic assignment, this total value is also updated in real time.
[0026]
In the above horizontal tabulation table and vertical tabulation table, tabulation is performed according to a judgment classification for tabulation that is different from the display classification that forms the basis of the work table. There is an advantage that the recalculation that has been performed can be eliminated, and the work table can be aggregated and checked more easily.
[0027]
As shown in FIG. 2, in the work schedule creation support system according to the present embodiment, in the work schedule and each summary table, a portion that violates the allocation condition is displayed as a warning in reverse video, and which part is a condition violation location. You can easily identify if you are. In this example, as explained in the supplementary explanation by each ellipse, “work pattern condition violation”, “work interval condition violation”, “employee combination condition violation”, “work supply condition violation”, “working aggregation condition violation” Is pointed out.
[0028]
Further, in this system, by moving the pointer to the place where the warning is displayed and performing a mouse click, or by stopping the pointer for a certain time, the warning content can be displayed as shown in the figure. In the example shown in the figure, the interval between “rest” and “rest” is 7 days due to the rectangular streamer display. Is displayed. Therefore, using these functions, the creation of work schedules can be made easier and faster. In FIG. 2, the types of violations are surrounded by ellipses, and the violation contents (warning contents) indicated by the mouse cursor are indicated by rectangular streamers. These are displayed / hidden. May be switchable.
[0029]
At the bottom of the vertical tabulation area, as described above, there are several tabs representing staff group names, and the tabulation table of staff members belonging to a specific group can be displayed by selecting the tab. Here, FIG. 2 is an example in which the “overall” tab is selected, indicating that the work demand condition is not satisfied because the number of quasi-night shifts for all nurses on the 5th is two. Yes. Note that the type, classification, and tabulation method of work categories are not the gist of the present invention, so detailed explanations are omitted, but the contents described in JP 2000-99569 A by the same applicant as the present application are used as they are. can do.
[0030]
Here, an example of the allocation condition registered in the allocation condition description unit 2 in the present embodiment will be described. In the present embodiment, the allocation conditions are classified and handled as types of work demand conditions, work supply conditions, work pattern conditions, work interval conditions, assignment unit conditions, and staff combination conditions. The working demand conditions are the conditions in which the upper and lower limits of the number of employees per day and the target number of persons are determined for each staff member's qualification and duty. Name (weight 100), [Example 2] For a staff member qualified as a night shift leader, a semi-night shift is set to one lower limit (weight 200). The work supply conditions are the upper limit, lower limit, and target number of times of each employee's work within a specified period (for example, 1 month). [Example 1] Lower limit of employee A's semi-night work for one month 4 times (weight 50), [Example 2] Each employee has a minimum of 7 rests per month (weight 30). The work pattern condition is a condition that defines the work order that one employee wants to avoid or recommend when focusing on one staff member. [Example 1] Avoid all the staff in the ward from midnight to midnight (weight) 20), [Example 2] Staff C is late at night − Midnight − For example, avoiding a late night line (weight 100). The work interval condition is a condition that determines the upper limit of the interval between work and work when paying attention to one staff member. [Example] The maximum interval between work breaks is 5 days (weight 150) is there. Allocation unit condition and No Uo is a condition that defines the work that the staff member wants to or does not want to perform on a certain day. [Example 1] Staff D avoids midnight and midnight on May 1 (weight 500), [Example 2] ] Staff E recommends a holiday or a day shift on May 10 (weight 200). The staff combination condition is a condition that defines a staff member who wants or does not want to perform the same work together. [Example 1] Staff F does not work with staff G or staff H during semi-night work. (Weight 70), [Example 2] Staff I forms a day shift with staff J or staff K (weight 80). In the allocation condition description section 2, the allocation conditions necessary for creating the work schedule as described above are registered. In the present embodiment, weights are set in advance corresponding to the allocation conditions. The weight is a value indicating the importance of each allocation condition in creating the work schedule, and a larger number is a more important condition in the present embodiment. Of course, the smaller one may be important. In this case, the evaluation judgment by the evaluation value comparison described in detail below is reversed. The allocation condition is used by the evaluation value calculation unit 6 and the violation determination unit 20. In addition, although typical allocation conditions are listed here, it is not limited to this example, and appropriate types and weights of conditions may be set according to the type of industry, job type, business scale, etc. for creating the work schedule. .
[0031]
Next, the operation in this embodiment will be described. First, using the flowchart shown in FIG. 3, an overall flow of basic processing for creating a work schedule by first performing an initial assignment and correcting the result will be described. It is assumed that the allocation conditions necessary for the allocation process are registered in advance in the allocation condition description unit 2 as described above.
[0032]
In the initial allocation process in step 100, the allocation execution unit 16 determines the element values of the work schedule matrix so that the evaluation value obtained from the evaluation value calculation unit 6 is as small as possible. In the initial allocation, since no additional condition has been set yet, the evaluation value calculation unit 6 determines the evaluation value of the work schedule using the allocation condition set in the allocation condition description unit 2. Details of processing in the allocation execution unit 16 and the evaluation value calculation unit 6 will be described later.
[0033]
In the display process in step 200, the display processing unit 12 displays the work schedule created by the initial allocation process on the screen. At this time, when the violation determination unit 20 detects a condition violation in the work schedule created using the allocation condition of the allocation condition description unit 2, the violation determination unit 20 stores the allocation condition corresponding to the violation and the content of the violation in the violation storage unit 22. Write. Then, the warning display unit 24 displays a warning in order to notify the condition violation written in the violation storage unit 22.
[0034]
Subsequently, in the branch in step 300, it is determined whether or not there is an input as an additional condition from the input unit 4. If there is, the correction allocation described below is performed. If there is no input, it is determined in step 400 whether or not the creation of the work schedule has been completed. If it has not been completed, the processes after the display process are repeatedly executed.
[0035]
In the correction assignment process in step 500, the correction execution unit 18 first configures an additional condition based on the input from the input unit 4 and registers it in the additional condition storage unit 8. An example of the contents of the additional condition storage unit 8 is shown in FIG. Thereafter, the correction execution unit 18 uses the allocation execution unit 16 to correct the work schedule matrix in accordance with the additional conditions recorded in the additional condition storage unit 8. Details of the processing in the correction execution unit 18 will be described later. When the correction assignment process is completed, the process returns to the display process again and the same process is repeated.
[0036]
The overall flow of the work schedule creation process in the present embodiment is as described above, but each process will be described in detail below. First, the initial allocation process (step 100) will be described.
[0037]
The initial allocation process in the present embodiment is a process that is executed by the allocation execution unit 16 and allocates each work division for the first time on a two-dimensional matrix according to a predetermined rule based on a preliminarily input creation condition. Similarly, in the modified allocation process (step 500), the process of allocating each work category on the two-dimensional matrix is executed. However, in the modified allocation process, additional conditions are taken into consideration, so the allocation process is performed without considering additional conditions. Here, the assigned process is particularly referred to as an initial assigned process. Of course, no additional condition is stored in the additional condition storage unit 8 during the initial allocation process.
[0038]
In the initial assignment process, the assignment execution unit 16 first assigns an appropriate element value (work classification) to the empty element of the work schedule matrix as an initial solution. As an example of how to determine the initial solution, there are methods such as assigning the same work (for example, leave) to all elements of the work schedule matrix, or assigning the work of all elements at random. Next, the values of the elements of the work schedule matrix are changed from the initial solution determined in this manner by using a predetermined algorithm such as a hill-climbing method, an integer programming method, a genetic algorithm, or simulated annealing. Regardless of which algorithm is used, when changing the value of an element, the evaluation value calculated by the evaluation value calculation unit 6 based on the work schedule matrix at that time is made as small as possible. In each algorithm, the assignment process ends when a work table having a smaller penalty value cannot be obtained or the number of iterations and the elapsed time reach a predetermined value. Hereinafter, the specific flow of the initial allocation will be described with reference to the flowchart shown in FIG. Here, the algorithm will be described using a hill-climbing method based on random change of element values.
[0039]
The allocation execution unit 16 first initializes a counter value indicating the number of iterations to 0 (step 101), and then assigns work categories such as rest, day shift, and semi-night to the work table matrix (step 102). The work division assigned at this time may be assigned at random as an initial value. In the present embodiment, an example in which the initial value is randomly determined has been described. However, a method of determining the initial value according to some rule or making all the values uniform may be used.
[0040]
Subsequently, the assignment execution unit 16 causes the evaluation value calculation unit 6 to calculate an evaluation value for the work schedule matrix to which the initial value is assigned (step 103). The calculated evaluation value is recorded as a pre-change evaluation value (step 104). Details of the evaluation value calculation process will be described later. Next, the allocation execution unit 16 randomly changes the values of some elements in the work schedule matrix (step 105). In addition, although the example changed at random was shown here, you may use methods, such as changing regularly according to a certain reference | standard. The allocation execution unit 16 causes the evaluation value calculation unit 6 to newly calculate the evaluation value for the work schedule matrix thus changed (step 106), and records the evaluation value after the change (step 107).
[0041]
Here, when the post-change evaluation value is smaller than the pre-change evaluation value, it can be considered that the work table has been improved by the change of the element value in the work table matrix that has been performed previously. At this time, the post-change evaluation value is recorded as the next pre-change evaluation value (steps 108 and 109). On the other hand, if the post-change evaluation value is greater than or equal to the pre-change evaluation value, the work table has not been improved by the previous change, so the previous matrix element change is restored (steps 108 and 110). .
[0042]
Subsequently, 1 is added to the value of the counter of the number of iterations (step 111). Here, if the number of iterations exceeds a preset number of times (for example, 10,000 times), the process is terminated (step 112). The process is also terminated when the elapsed time exceeds a certain time (step 113). In addition, although the two types of the number of iterations and the elapsed time are illustrated here as the termination conditions for the initial allocation process, the termination is performed when no improvement in the work schedule has been seen even in a certain number of iterations. The processing may be terminated based on the criteria such as. If the end condition is not violated, the process returns to step 105 to repeat the process.
[0043]
Next, the display process (step 200) will be described. Note that the work schedule created and displayed in the present embodiment has been described above with reference to FIG. 2, but the creation and display of the work schedule itself are not the gist of the present invention, and the description thereof will be omitted.
[0044]
When the display processing unit 12 displays the work schedule created by the initial allocation process on the screen, the violation determination unit 20 displays the assignment conditions of the assignment condition description unit 2 and the work stored in the work table storage unit 14. As described above, the presence / absence of the allocation condition violation in the work schedule and the occurrence position thereof are detected from the table and stored in the violation storage unit 22. As an example of this stored violation, for example, with respect to the work demand condition, “the night shift to the night shift leader qualified staff shall be a minimum of one person”, “the night shift on May 4th” There may be a violation of “less than one person working near night for a leader qualified employee”. Regarding work supply conditions, there may be a violation of “less than 4 quasi-night work for one month for employee A” against the allocation condition of “minimum quasi-night work for 1 month for staff A”. It is done. Regarding the work pattern condition, violation of the assignment condition that “all staff members in the ward avoid quasi-night midnight arrangements” “staff midnight lined from May 10th to 11th” Can be considered. Regarding the allocation unit condition, there may be a violation of “A midnight is assigned on May 1 of Staff A” against the assignment condition of “Avoid the midnight and midnight on May 1 of Staff A”. .
[0045]
The position where the condition is violated is specified by the element where the employee and the work day intersect, but it does not necessarily indicate a single element in the work schedule matrix, and it is specified according to the type of condition 1 day or period, or a specific worker or a plurality of workers. The condition violation detected by the violation determination unit 20 is registered in the violation storage unit 22 as a set of the following information.
[0046]
Violation of work demand conditions… Group of staff limited by work demand conditions, date, qualification, work
Violation of work supply conditions… Work supply conditions, staff, date
Violation of work pattern conditions… Work pattern conditions, staff, first day and last day of work pattern condition violation
Violation of work interval conditions… Work interval conditions, staff, first day and last day of violation of work interval conditions
Violation of allocation unit conditions… Allocation unit conditions, staff, date
Violation of staff combination conditions ... Staff combination conditions, date, duty, staff
The condition violation stored in the violation storage unit 22 is used for warning display in the warning display unit 24 or used when the work schedule matrix is corrected in the correction execution unit 18.
[0047]
When a condition violation is written in the violation storage unit 22, the warning display unit 24 displays a warning to notify the condition violation. An example of this display is shown in FIG. Although the warning display example in the work schedule shown in FIG. 2 is shown in reverse display, the display color may be changed. As shown in this example, by making the display of the work status part corresponding to the condition violation different from the part not violating, the violation part can be clearly identified.
[0048]
FIG. 5 shows another warning display example. In this example, the violation contents are displayed in a text list format. Among these, in FIG. 5A, each condition violation is shown as a message in text characters, whereas FIG. 2 shows the table. Since each work situation part that violates the condition is associated, the number of messages listed is equal to the condition violation number. On the other hand, FIG. 5B displays the contents that violate the allocation condition in a list format by text. That is, the condition violations displayed in FIG. 5A are collectively displayed for each allocation condition that is the source of the violation. As described above, there may be a violation of the allocation condition even after the initial allocation is performed. However, the provision of the warning display unit 24 allows the work schedule creator to recognize the violation content. The warning display shown in FIG. 2 and FIG. 5 is controlled to be switched or all display / non-display is controlled according to the operation by the work schedule creator.
[0049]
Next, the correction assignment process (step 500), which is a feature of the present embodiment, will be described using the flowchart shown in FIG.
The correction assignment processing in the present embodiment is mainly executed by the correction execution unit 18 and is two-dimensional according to a predetermined rule based on the pre-input creation conditions and the additional conditions stored in the additional condition storage unit 8. This is a process that is performed in order to eliminate the violation condition of the additional condition by assigning each work division on the matrix.
[0050]
First, the correction execution unit 18 registers the additional condition input by the work schedule creator through the input unit 4 in the additional condition storage unit 8 (step 501). Here, an additional condition input process using the input unit 4 will be described.
[0051]
The work schedule created by the initial allocation process is displayed on the screen by the display processing unit 12 as illustrated in FIG. After initial allocation processing, condition violations often occur. Here, when the work table creator is clicked by moving the mouse pointer to the position where the warning is displayed on the work table creator, information on the position is transmitted to the correction execution unit 18. The correction execution unit 18 extracts the allocation condition violation corresponding to the click position from the violation storage unit 22, and determines whether to newly register the cancellation of the allocation condition violation as an additional condition. If an additional condition to be newly registered is not recorded in the additional condition storage unit 8, it is registered.
[0052]
Further, it may be specified from the list shown in FIG. 5 without being specified on the work schedule shown in FIG. The designation from Fig. 5 (a) is substantially the same as the designation from Fig. 2 in that individual condition violations are selected, but in the case of Fig. 5 (b), work corresponding to the violation content listed. There may be multiple situational parts. Based on the example of FIG. 5B, there may be a plurality of workers (for example, Mr. A and Mr. B) to whom the avoidance work pattern of quasi-night-midnight is assigned. In such a case, the correction execution unit 18 breaks down into Mr. A's assignment condition violation and Mr. B's assignment condition violation and registers them in the additional condition storage unit 8. In other words, when it is desired to resolve the violation of the condition of avoidance work pattern violation from midnight to midnight all together, the warning display in the form of FIG. 5 (b) is used instead of the warning display in the form of FIG. 2 or 5 (a). The additional condition can be input and specified. As described above, in this embodiment, it is possible to input an additional condition for eliminating the allocation condition violation corresponding to the warning display.
[0053]
In this embodiment, it is set so that the correction assignment process is automatically started by clicking the mouse. Therefore, if the work table creator clicks the mouse on a part of the displayed work table, the violation of that part is made. A revised version of the work schedule whose element values have been changed so as to be resolved is automatically created. In other words, although details will be described later, the work table creator does not need to input the changed value of the part as long as he clicks on the part where the violation of the condition is to be resolved, and the relationship with the element value of other elements It is not necessary to be conscious of this, so it is very easy to correct the work schedule to reflect his / her will.
[0054]
In this embodiment, since the correction assignment process is set to start automatically by clicking the mouse, in the case of the warning display in FIG. 2 or FIG. 5A, additional conditions are set one by one. However, if a selection operation is performed by selecting a plurality of conditions by clicking with a mouse and a correction button provided separately is started by clicking with a mouse, for example, the correction assignment process is started (FIG. 5B). As with, multiple additional conditions can be specified at once.
[0055]
In this embodiment, in principle, a location where the condition is violated is selected and input, but a location that is not violated can be input and specified as an additional function. For example, if the upper limit for night shift is 9 times, Mr. A has 8 night shifts and is not violated, but if he wants to change the number of night shifts for that month, click on the number of night shifts displayed as A's 8 Then, either “increase” or “decrease” may be selected from the displayed list. Since the element value exceeding the upper limit of 9 times is not assigned by the correction assignment process, 9 Times Or 7 Times Can be reduced to: In this way, it is also possible to modify the work schedule by designating a work status part and a total value part that do not violate. In the present embodiment, when a click is made on the work schedule, the corresponding position information is sent to the correction execution unit 18, and the violation of the allocation condition in the violation storage unit 22 is searched based thereon. When there is no corresponding allocation condition violation, the correction execution unit 18 automatically generates an additional condition “make the element value at the indicated position not the current element value”, and stores it in the additional condition storage unit 8. be registered.
[0056]
Returning to FIG. 6, the correction execution unit 18 registers the additional condition input and designated by the work creator as described above in the additional condition storage unit 8 (step 501). At this time, the correction execution unit 18 stores the additional condition in the additional condition storage unit 8. At the same time, the number of correction attempts for the additional condition is stored as an initial value 0. This value is used in the processing in the correction execution unit 18 described below. An example of the additional condition registered in the additional condition storage unit 8 is shown in FIG. Immediately after the start of the system, the additional condition storage unit 8 is empty, but the correction execution unit 18 cumulatively registers the additional condition and the number of correction trials as a set. The content of the additional condition storage unit 8 increases cumulatively with the occurrence of the additional condition, but is deleted under a certain condition (step 517). Further, the accumulated amount can be limited by a method of automatically deleting old additional conditions when the number of registrations exceeds a threshold. Further, a means for returning the additional condition storage unit 8 to the empty state by an instruction from the creator or the like may be provided.
[0057]
Next, the correction execution unit 18 selects an additional condition that is in an additional condition violation state in the current work schedule matrix among the additional conditions registered in the additional condition storage unit 8 (step 502). In the present embodiment, the additional condition registered only in step 517 is basically deleted. Therefore, even if the additional condition violation is resolved by the repeated processing of steps 508 to 516 including the process of changing the element value (step 508), the additional condition is not deleted from the additional condition storage unit 8 and enters the additional condition violation state. It remains as an additional condition that is not. Whether or not it is in an additional condition violation state is checked each time in step 518 by associating each additional condition registered in the additional condition storage unit 8 with the created work schedule. If there are a plurality of additional conditions in the additional condition violation state, one of the additional conditions is automatically selected (step 502). As a selection method, methods such as selecting at random, selecting the latest registered, selecting the earliest registered (oldest), selecting the one with the smallest number of trials, etc. can be considered, Any method may be used. At the start of the correction assignment process, only the additional condition specified by the work schedule creator should be registered immediately before, so that the additional condition is selected unconditionally.
[0058]
Subsequently, the correction execution unit 18 adds 1 to the number of correction trials corresponding to the selected additional condition (step 503). Here, when the number of correction trials does not exceed the predetermined number of times (step 504), the assignment execution unit 16 changes the element value so as to reduce the evaluation value for the created work schedule matrix. . In the following examples, as in the case of the initial allocation process, an algorithm using the hill-climbing method will be described as an example, but here again using other algorithms such as integer programming, genetic algorithm, simulated annealing, etc. Also good. In addition, as an algorithm used here, an algorithm different from that used in the initial allocation process may be used.
[0059]
First, a counter for recording the number of iterations is initialized to 0 (step 505). Next, the evaluation value for the current work schedule matrix is calculated by the evaluation value calculator 6 (step 506). Here, since the additional condition is registered in the additional condition storage unit 8, the evaluation value calculation unit 6 calculates the evaluation value including the additional penalty value corresponding to the additional condition. That is, even if the evaluation values for the same work table are different in the case of correction assignment (when the additional condition storage unit 8 has an additional condition) and not the correction assignment (when the additional condition storage unit is empty). Details of the evaluation value calculation process will be described later. The evaluation value calculated here is recorded as an evaluation value before change (step 507).
[0060]
Next, the values of some elements in the work schedule matrix are changed (step 508). The changing method here may be the same as or different from the case of the initial allocation. For example, it can be changed at random as in the initial assignment process, but one or more specific changing methods such as exchanging work of two staff members on the same day may be used. Of course, this method does not change the number of daily work, so this method should only be used if the initial assignment results meet the daily work conditions. Then, it is possible to perform the search more efficiently than the random change. The evaluation value for the changed work schedule matrix is calculated by the evaluation value calculation unit 6 (step 509), and the evaluation value calculated here is recorded as the evaluation value after change (step 510).
[0061]
Here, when the post-change evaluation value is smaller than the pre-change evaluation value, it can be considered that the work table has been improved by the change of the element value in the work table matrix that has been performed previously. At this time, the post-change evaluation value is recorded as the next pre-change evaluation value (steps 511 and 512). On the other hand, if the post-change evaluation value is greater than or equal to the pre-change evaluation value, the work table has not been improved by the previous change, so the previous matrix element change is restored (steps 511 and 513). .
[0062]
Next, 1 is added to the counter value of the number of iterations (step 514). Here, when the number of repetitions does not exceed a preset number of times (for example, 10,000 times) (step 515) and when the elapsed time does not exceed a certain time (step 516), the process returns to step 508. On the other hand, when the number of iterations exceeds a preset number of times (for example, 10,000 times) (step 515), or when the elapsed time exceeds a certain time (step 516), it is registered in the additional condition storage unit 8 next. It is determined whether all of the additional condition violations have been resolved (step 518). If it has been resolved, all the additional conditions specified by the work creator have been reflected in the work schedule, and the correction assignment process is terminated. If not resolved, the process returns to step 502 and the process is repeated until the unresolved condition violation is resolved. Whether or not all the additional conditions have been eliminated, that is, whether or not the additional condition has been violated, is determined by associating each additional condition registered in the additional condition storage unit 8 with the created work schedule. In this embodiment, two types of iterations and elapsed time are exemplified as conditions for ending the iterations of steps 508 to 516. However, other than this, the work table has been improved even once in a certain number of iterations. The iteration may be terminated on the basis of a criterion such as ending if not performed.
[0063]
Here, the evaluation value calculated by the characteristic evaluation value calculation unit 6 in the present embodiment and the calculation method of the evaluation value will be described in detail.
[0064]
The evaluation value calculation unit 6 calculates an evaluation value for the work table of the work table matrix from the allocation condition of the allocation condition description unit 2 and the additional condition of the additional condition storage unit 8 in the allocation process. The evaluation value in the present embodiment is obtained by the following evaluation function E (x).
[0065]
E (x) = f (x) + p (x) (1)
Here, x indicates a work schedule in the work schedule matrix. f (x) is an objective function, and is a function for obtaining a penalty value indicating how much the work table x violates the allocation condition recorded in the allocation condition description section 2. p (x) is an additional penalty function, which is a function for obtaining an additional penalty value indicating how much the work table x violates the additional condition registered in the additional condition storage unit 8. That is, it can be said that the evaluation value obtained by the evaluation function is a value indicating the degree of condition violation with respect to the creation condition and the additional condition. Note that p (x) is a term having an effect of increasing the evaluation value corresponding to the additional condition for the work schedule x, and is not necessarily limited to the above formula. That is, any form may be used as long as the value of the evaluation function E increases when the values of the objective function f and the additional penalty function p increase. As such a function, for example,
E (x) = f (x) × (1 + k · p (x))
There is something like this. However, in this case, p is determined so that p (x) ≧ 0. k is a positive constant. Hereinafter, the functions f and p will be described.
[0066]
The objective function f (x) indicating the violation degree of the allocation condition is defined as follows.
[0067]
[Expression 1]

Where f _type (X) is a function for obtaining a penalty value for violation of the allocation condition for the work table x for each type of allocation condition. An example of how to calculate the penalty value is shown below.
[0068]
First, as a method of calculating the penalty value of the work pattern condition, for example, when there is a condition of “avoid all midnight-midnight arrangement (weight 100) for all staff members in the ward”, the quasi-night-midnight If there are five locations, 5 × 100 = 500 can be set as a penalty value.
[0069]
In addition, when there is a condition that “worker A's quasi-night work for one month is set to the lower limit of 4 times (weight 50)”, the total number of quasi-night work of staff A in the work schedule is 2 If it is the number of times, staff A's semi-night work is two times less than the number of times specified in the condition, so the penalty value for this work supply condition is 2 × 50 = 100.
[0070]
Here, an example of the penalty value calculation method for work pattern conditions and work supply conditions has been described. However, for other conditions, a calculation method that gives larger values as the degree of violation of the conditions increases is calculated. It's okay.
[0071]
It should be noted that the calculation method for the work pattern condition and the work supply condition may be other than the above. For example, when calculating the penalty value for work supply conditions as an example, the penalty value is a value obtained by multiplying the square of the amount (2 times) less than the number of times (4 times) specified in the lower limit condition (2 times). (The penalty value is 2 ² X50 = 200) or the like.
[0072]
On the other hand, the additional penalty function p (x) indicating the degree of violation of the additional condition is defined as follows.
[0073]
[Expression 2]

Where p _i (X) is a function for obtaining an additional condition penalty value for the additional condition i for the work table x. An example of this function is as follows.
[0074]
[Equation 3]

Here, α is a constant indicating the degree to which the additional condition is reflected in the evaluation value, t _i Is the number of trials for correcting additional condition i, g _i (X) is a function indicating the degree of violation of the additional condition for the work table x.
[0075]
In the initial allocation process, since no additional condition has been input yet, there is no additional condition in the additional condition storage unit 8. That is, p (x) = 0 for any work table x. On the other hand, when an additional condition is registered in the additional condition storage unit 8, an additional penalty value is calculated for those additional conditions that are in an additional condition violation state. The method of calculating the additional penalty value here may be a method that takes a larger value as the degree of violation of the additional condition increases, as in the case of the objective function. Of course, a calculation method similar to the objective function may be used.
[0076]
Here, the value of α may be appropriately determined such that the penalty value for the additional condition approaches the penalty value of other allocation conditions as the number of correction trials increases. For example, it may be about 1/10 of the average of the strength of the allocation condition. However, the value is not limited to this value. For example, the value can be determined based on the evaluation value of the work schedule obtained at the previous iteration.
[0077]
Also, a different α value can be set for each additional condition. For example, when the violated allocation condition is an additional condition, if the weight of the allocation condition is set as a reference (for example, 1/10 of the weight value of the corresponding allocation condition), the α value of each additional condition is Depending on the weight value of the corresponding allocation condition. Further, independent of the allocation condition, the value of α can be used as a priority for preferentially resolving the violation of which additional condition.
[0078]
Here, as an example of evaluation value calculation, when three types of additional conditions as shown in FIG. 7 are registered in the additional condition storage unit 8, an example of a penalty value calculation method for the work schedule shown in FIG. Shown in Note that α = 10.
[0079]
The work schedule violates the additional condition “Avoiding the arrangement of the quasi-night to the midnight of the 2nd to 3rd of the staff“ Kato ””. Therefore, this additional condition is an additional condition violation state. Degree of violation for this additional condition _i If (x) takes a value of 1 if a violation has occurred and 0 if not, g in this case _i (X) = 1. Also, the number of correction trials t _i = 1, so the additional condition penalty value for this additional condition is p _i (X) = 10 · 1 · 1 = 10. The other two additional conditions have already been eliminated in the work schedule shown in the figure. Therefore, each additional condition penalty value is zero. Thus, the value of the additional penalty function for all additional conditions is p (x) = 10 + 0 + 0 = 10.
[0080]
As is apparent from the above equation, the additional penalty value p (x) obtained by the additional penalty function is obtained when each additional condition in an additional condition violation state exists. _i (X) the number of correction attempts t _i It is calculated by multiplying. Accordingly, if the state where the additional condition violation state is not resolved despite the repeated allocation process is continued, the additional penalty value p (x) increases. Number of correction attempts t _i Is a value added in step 503 of FIG. 6 by repeating the process if all the condition violations have not been resolved, it can be said that this is one of the parameters indicating the degree of violation of the additional condition in the violation state. On the other hand, the penalty value f (x) obtained by the objective function does not depend on the number of correction trials (the number of iterations). That is, when the allocation process is repeatedly performed, the ratio of the additional penalty value to the evaluation value increases, and the evaluation value itself increases accordingly. The allocation execution unit 16 in the present embodiment determines each element value of the work schedule matrix so that the evaluation value obtained from the evaluation value calculation unit 6 is as small as possible. As a result, an additional condition than a violation of the allocation condition, In other words, it acts to preferentially resolve the violation of the conditions specified by the work creator. When there are a plurality of additional conditions in the additional condition violation state in step 502, the correction execution unit 18 automatically selects one of the additional conditions, but no matter which additional condition is selected, the correction execution unit 18 Since the number of revision attempts is incremented by 1, the additional condition penalty value p for each additional condition _i The additional penalty value p (x) obtained by the sum of (x) becomes large. Accordingly, there is no problem even if the correction execution unit 18 randomly selects an additional condition for adding the number of correction trials.
[0081]
Further, when the matrix element value changing process (step 508) is repeatedly performed in the correction assignment process, an additional condition that is no longer in the condition violation state may also be in the condition violation state. However, even in such a case, the allocation execution unit 16 increases the number of correction trials (steps 518 and 503), and again resolves the condition violation restored by performing the matrix element value changing process (step 508) again. Act on.
[0082]
The correction execution unit 18 uses a predetermined algorithm such as a hill-climbing method as a method for determining each element value of the work schedule matrix so that the evaluation value obtained from the evaluation value calculation unit 6 is as small as possible. Even if a simple algorithm is used, there is a possibility that the evaluation value cannot be reduced even if the allocation process is repeated under certain circumstances. Therefore, in the present embodiment, when the number of trials for correction of the additional condition selected in step 503 exceeds a predetermined number of times set in advance (step 504), the work schedule cannot be changed according to the additional condition. Accordingly, the selected additional condition is deleted from the additional condition storage unit 8 (step 517). After the additional condition is deleted, if there is no additional condition violation condition, the correction assignment process is terminated. If the condition is not resolved, the process returns to step 502 until the unresolved condition violation is resolved. Is repeated (step 518).
[0083]
In the present embodiment, a predetermined algorithm can be changed during the correction assignment process. That is, even if the limit is reached when the evaluation value is reduced by an algorithm that employs a hill-climbing method or the like, the evaluation value may be reduced by changing to another algorithm such as integer programming. This algorithm may be changed in accordance with an instruction from the work schedule creator, or when the evaluation value does not become small even if it is repeated a predetermined number of times or more, the correction execution unit 18 automatically changes the algorithm. May be.
[0084]
In the present embodiment, it has been described that the smaller evaluation value is improved and a work table with high evaluation is obtained. That is, each element value of the work schedule matrix is determined so that the evaluation value obtained from the evaluation value calculation unit 6 is as small as possible, so that the penalty value is added when the condition is violated. However, it goes without saying that this magnitude relationship may be reversed.
[0085]
Hereinafter, the work schedule creation process in the present embodiment will be described with a specific example. Here, as a specific example of processing, FIGS. 9 and 12 show an example of a process of actually performing correction based on the premise shown in FIG. In this example, in order to show the process of correction assignment, a four-day, four-day work schedule was used as an example.
[0086]
FIG. 9A shows the work schedule created and displayed by the initial assignment process (steps 100 and 200 in FIG. 3). In this work schedule, the work status of staff B violates the work pattern condition of “avoid the arrangement of midnight-midnight (weight 90)” among the assignment conditions. Since this violation is highlighted, the creator can easily recognize the work situation to be corrected. The creator inputs a correction instruction by clicking on the violation (step 300 in FIG. 3). In response to this operation, the correction assignment process (step 500 in FIG. 3) is started.
[0087]
In the correction assignment process, the assignment condition corresponding to the location specified by the creator is registered as an additional condition in the additional condition storage unit 8 (step 501 in FIG. 6). The number of correction trials at the time of initial registration is 0 as shown in FIG. However, since there is only one additional condition at this point, when the additional condition is selected (step 502 in FIG. 6), the number of correction trials of the additional condition is immediately added to 1 (step in FIG. 6). 503). FIG. 9C is a diagram obtained by transcribing FIG. 9A. The value of the objective function f (x) is 90 according to the above equation (2), and the value of the additional penalty function p (x) is α = 10. Then, 10 according to the above equations (3) and (4), so the evaluation value in this work table, that is, the value of the evaluation function E (x) becomes 90 + 10 = 100 according to the above equation (1) (step of FIG. 6). 506).
[0088]
Here, according to the method for changing the work schedule matrix at the time of allocation shown in FIG. 8, the element values of the work schedule matrix are changed by repeatedly performing steps 508 to 516 in FIG. In this process, the element value is changed so that the work table has a small evaluation value. In this example, the work table cannot be changed to a work table having a small evaluation value, and the work table created by the initial assignment remains as it is. An example showing this result is shown in FIG.
[0089]
In the above processing, since the additional condition could not be resolved even though the change of the element value of the work schedule matrix was repeated a predetermined number of times or for a predetermined time (steps 515, 516 and 518 in FIG. 6), step 502 in FIG. Return to. Here, since there is only one additional condition registered in the additional condition storage unit 8, the additional condition is selected again, and the number of correction trials is further incremented by 1 to 2 (step 503 in FIG. 6).
[0090]
Then, the evaluation value in the work schedule shown in FIG. 9D is calculated (step 506 in FIG. 6). The objective function value in this work schedule is not changed from 90, but the additional penalty value is 20 when the number of correction trials is 2. Therefore, the evaluation value in this work schedule is 90 + 20 = 110 according to the above equation (1). As described above, even if the work schedule is the same, the evaluation value increases as the additional penalty value increases as the process is repeated.
[0091]
Here, similarly to the above, the element values of the work schedule matrix are changed by repeatedly performing steps 508 to 516 of FIG. In this process, according to the method of changing the work schedule matrix at the time of assignment shown in FIG. 8, the work status of staff B and staff C for two days was changed as indicated by the arrow shown in FIG. 10 (e). (Step 508 in FIG. 6). FIG. 10F shows the work schedule after the replacement. This replacement eliminates the additional condition, but this time, the work status of the staff C violates the fourth work pattern condition of “avoid the arrangement of holidays and midnight (weight 100)” in the assignment condition. . The objective function value in the changed work schedule increases to 100, but the additional penalty value becomes 0 because there is no additional condition that is violated. Thereby, the evaluation value in the work schedule after the change becomes 100 + 0 = 100 according to the above formula (1) (step 509 in FIG. 6). Therefore, since the evaluation value after the change is smaller, this work schedule is stored (step 512 in FIG. 6).
[0092]
Further, returning to step 508 of FIG. 6, according to the method of changing the work schedule matrix at the time of allocation shown in FIG. 8, this time, staff B and staff C work one day as indicated by the arrows shown in FIG. 10 (f). Suppose the situation is changed. The work schedule after the replacement is shown in FIG. There are no allocation conditions that violate this replacement, and there are no additional conditions. That is, both the objective function value and the additional penalty value in the changed work table are 0, and as a result, the evaluation value in the changed work table is 0 according to the above equation (1) (step 509 in FIG. 6). Therefore, since the evaluation value after the change is smaller, this work schedule is stored (step 512 in FIG. 6).
[0093]
Further, returning to step 508 in FIG. 6, even if the element values of the work matrix are changed and the evaluation values before and after the change are compared, the work table having the evaluation value 0 cannot be improved. Then, after a predetermined number of times or a predetermined time has elapsed, when it is confirmed in step 518 in FIG. 6 that all the additional conditions have been eliminated, the correction assignment process ends. FIG. 10 (h) shows a work schedule created in this correction assignment process. In addition, FIG.10 (h) is the figure which copied FIG.10 (g).
[0094]
When the work schedule created in this way is displayed on the screen (step 200 in FIG. 3), the creator confirms that this work schedule does not violate any allocation condition because there is no highlighted part. Can be recognized. If the work schedule is acceptable, the creator ends the work schedule creation process without inputting a correction instruction (step 500 in FIG. 3). As described above, in the present embodiment, even if there is no violation location, if the allocated content is to be changed, it can be changed by clicking the corresponding location.
[0095]
In the case of a work table of this size, there is a high possibility that a sufficiently good work table can be obtained only by the initial assignment, and there is little need to correct it later. However, as described above, in the large work schedule that is actually used, some correction is necessary for the work schedule obtained by the initial allocation. The process exemplified here can be used as it is for a work table having a large size as it is, and in order to easily explain the correction process, the method is described in a work table having a small size. Further, as a predetermined algorithm in the allocation process, a method of “changing the work of two staff members on the same day in order of staff and date” was used as an example as a method of changing the work schedule matrix. As described in the description of the correction execution unit 18, the algorithm used here may be different from the algorithm used in the initial allocation.
[0096]
Finally, when the user interface for the work schedule creation support system in the present embodiment is confirmed, the work schedule creator activates the system and creates a work schedule. The work schedule created and displayed here is a work schedule created by the initial allocation process, and as described above, a condition violation usually occurs. Here, the work schedule creator designates a condition violation point that he / she wants to eliminate by referring to a warning display by clicking the mouse. Specifically speaking, the place where the mouse is clicked is the reverse display part on the work schedule or the warning message shown in FIG. Of course, as described above, it is possible to specify a non-violating part. A correction assignment process is executed in response to the mouse click. As a result, the corrected work schedule is displayed. When it is desired to further modify the work schedule because the condition still remains after the modification, the work schedule creator designates the correction position by clicking the mouse in the same manner as described above. The work schedule can be improved by designating a correction point by clicking the mouse on the created work schedule.
[0097]
As described above, according to the present embodiment, the element value of the element specified by the work schedule creator can be automatically and effectively corrected for the correction when creating the work schedule. The person need only specify the part of the work situation that he / she wishes to correct, and can effectively correct the work schedule.
[0098]
In the present embodiment, the burden on the work schedule creator is reduced by automatically correcting the element value to be changed due to a condition violation or the like. However, the setting of the element value by the work schedule creator is not denied, and a desired element value may be manually input and set for each element as in the conventional case. In the present embodiment, the element values of the work schedule matrix are changed at random in order to eliminate the condition violation (step 508 in FIG. 6). That is, each element value may be different from the immediately preceding work schedule regardless of whether there is a violation of the conditions. For this reason, there is a possibility that the element value manually set by the work schedule creator is also changed by repetition of the allocation process. To avoid this, a function that can change the weight for the assignment condition is provided, and if the weight for the element that you do not want to change the element value is set to a very large value, the work schedule is set so that the evaluation value decreases. The allocation execution unit 16 that creates the matrix does not employ a work schedule matrix whose element values change (steps 511 and 513 in FIG. 6). When an element value is manually input and set by the work schedule creator, the element value is automatically registered in the assignment condition, and automatic processing is performed so that the weight set at that time is set to a very large value. Also good.
[0099]
Further, in the above embodiment, a nurse work schedule creation support system has been realized, but the present invention is not limited to this, and for example, shift work such as guards, pilots, taxi drivers, etc. The same applies to the creation of work schedules for occupations with forms.
[0100]
【The invention's effect】
According to the present invention, when the work schedule creator modifies the work schedule, it only needs to indicate the location that the user wants to modify, and what value should be changed at the time of the modification, and the change In addition, since it is not necessary to instruct how other parts need to be changed derivatively, the burden of correcting the work schedule can be greatly reduced. In addition, since an additional penalty value is given for violations to be corrected, it is possible to reduce the number of changes in the work schedule that accompany the correction instructions, and the work schedule creator can easily understand the correction and be satisfied gradually. Can lead to work schedule. Also, since the evaluation value is calculated by giving a penalty value to the state to be corrected and the work schedule is corrected, the algorithm for automatically creating the work schedule can be used as it is for the correction, In some cases, there is a merit that it is not necessary to prepare a rule specialized for correction.
[0101]
In addition, when performing the allocation process repeatedly, the evaluation value is calculated by setting the additional penalty value by assigning a weight according to the number of repetitions of the allocation process. You can create work schedules to be eliminated.
[0102]
In addition, when the evaluation value can no longer be reduced even after repeated assignment processing, the adopted algorithm can be changed to another algorithm, so an improved work schedule with a smaller evaluation value is created. Could be possible.
[0103]
Further, since the degree of the additional penalty value to be reflected in the evaluation value calculated by the evaluation value calculating means can be set for each additional condition, it is possible to give priority to the additional condition for which the violation is to be eliminated.
[Brief description of the drawings]
FIG. 1 is a functional block configuration diagram showing an embodiment of a work schedule creation support system according to the present invention.
FIG. 2 is a diagram showing an example of a work schedule created in the present embodiment.
FIG. 3 is a flowchart showing an overall flow of work schedule creation processing in the present embodiment.
FIG. 4 is a flowchart showing an initial allocation process in the present embodiment.
FIG. 5 is a diagram showing a warning display example in the present embodiment.
FIG. 6 is a flowchart showing correction assignment processing in the present embodiment.
FIG. 7 is a diagram showing an example of additional conditions registered in an additional condition storage unit in the present embodiment.
FIG. 8 is a diagram showing preconditions for explaining correction assignment processing in the present embodiment.
FIG. 9 is a diagram showing shifts in work schedules by correction assignment processing based on the preconditions shown in FIG. 8;
FIG. 10 is a diagram showing the transition of the work schedule following FIG. 9;
[Explanation of symbols]
2 allocation condition description section, 4 input section, 6 evaluation value calculation section, 8 additional condition storage section, 10 work schedule creation processing section, 12 display processing section, 14 work schedule storage section, 16 allocation execution section, 18 correction execution section, 20 Violation determination unit, 22 Violation storage unit, 24 Warning display unit.

Claims (3)

In a work schedule creation support system that creates a work schedule including a two-dimensional matrix that represents the work status of each worker,
An allocation condition storage means for storing a creation condition for creating a work schedule;
Calculate a penalty value indicating the degree of violation of the conditions for the creation conditions for the work schedule, and execute an initial assignment process that assigns each work category on the two-dimensional matrix according to a predetermined algorithm so that the evaluation based on the penalty value is high Initial allocation processing means for creating a work schedule by doing,
Warning display means for displaying a warning of a violation of the conditions for the created conditions for the created work schedule;
Additional condition storage means for storing additional conditions when correcting the created work schedule;
An input means for setting the additional condition storage means as the additional condition to eliminate the condition violation by specifying an arbitrary condition violation among the condition violations displayed as warnings by the work table creator ;
A predetermined algorithm for calculating a penalty value indicating the degree of violation of the creation condition and an additional penalty value indicating the degree of violation of the condition for the additional condition for the work schedule, and for increasing the evaluation based on the penalty value and the additional penalty value. Modified assignment processing means for creating a work schedule by executing a modified assignment process for changing each work division on the two-dimensional matrix assigned by the initial assignment processing means according to
I have a,
The correction allocation processing means resets an additional penalty value that imposes a weight on the additional penalty value for the additional condition if the condition violation for the additional condition is not resolved in the work schedule created by the correction allocation process, The work schedule creation support system , wherein the correction allocation process is executed again so that the evaluation based on the penalty value and the additional penalty value is high . In the work schedule preparation support system according to claim 1,
The correction allocation processing means repeatedly performs the correction allocation processing until the violation of the condition for the additional condition stored in the additional condition storage means is resolved when creating the work schedule, and repeats the correction allocation processing. In the execution process, a work schedule creation support system, wherein an evaluation value is calculated by resetting an additional penalty value imposed with a weight according to the number of iterations. In a work schedule creation support system that creates a work schedule including a two-dimensional matrix that represents the work status of each worker,
An allocation condition storage means for storing a creation condition for creating a work schedule;
Calculate a penalty value indicating the degree of violation of the conditions for the creation conditions for the work schedule, and execute an initial assignment process that assigns each work category on the two-dimensional matrix according to a predetermined algorithm so that the evaluation based on the penalty value is high Initial allocation processing means for creating a work schedule by doing,
Warning display means for displaying a warning of a violation of the conditions for the created conditions for the created work schedule;
Additional condition storage means for storing additional conditions when correcting the created work schedule;
An input means for setting the additional condition storage means as the additional condition to eliminate the condition violation by specifying an arbitrary condition violation among the condition violations displayed as warnings by the work table creator;
A predetermined algorithm for calculating a penalty value indicating the degree of violation of the creation condition and an additional penalty value indicating the degree of violation of the condition for the additional condition for the work schedule, and for increasing the evaluation based on the penalty value and the additional penalty value. Modified assignment processing means for creating a work schedule by executing a modified assignment process for changing each work division on the two-dimensional matrix assigned by the initial assignment processing means according to
Have
Said warning display means, the condition violation warning by explicitly working status portion on the roster that condition violation has occurred with respect to the production conditions for the roster that the created,
The input means sets the additional condition storage means as the additional condition to eliminate the condition violation of the input work status portion of the work status portion displayed as a warning by the warning display means. Features a work schedule creation support system.

Images