JOB SCHEDULING METHOD AND STORAGE MEDIUM WITH COMPUTER- READABLE JOB SCHEDULING PROGRAM RECORDED THEREIN

PROBLEM TO BE SOLVED: To reduce work quantity which a user has to execute in a scheduling work on a plurality of jobs. SOLUTION: In a job scheduling method, whether or not the change of the execution date of a job is permitted is added to the definition of the respective jobs as the execution condit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: TAGUCHI KAN, KOUDA JUN
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator TAGUCHI KAN
KOUDA JUN
description PROBLEM TO BE SOLVED: To reduce work quantity which a user has to execute in a scheduling work on a plurality of jobs. SOLUTION: In a job scheduling method, whether or not the change of the execution date of a job is permitted is added to the definition of the respective jobs as the execution condition of the job, when the execution date is overlapped with that of the other job and it is stored in a job schedule file 3. A job calendar generation part 12 reads the definition of the respective jobs from the job schedule file 3, generates a job calendar, and stores it in a job calendar file 4. When the execution dates of a plurality of jobs are overlapped, the execution date on the job calendar of the job, whose change of the execution date is permitted by definition, is changed and is stored.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JP2000029722A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JP2000029722A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JP2000029722A3</originalsourceid><addsrcrecordid>eNqNjLEKwjAURbs4iPoPD_eCxEEc07xnktIk5TWhYykScRAt1P_HDk5O3uXCuYe7Lu51qKBThjA11mtwFE1AkB6hi4GlpgWhTQ56Gw2o4NoUiUtgkiirhuDnoOWgWbplV4GREKIhJuu3xeo2Pua8-_am2F8oKlPm6TXkeRqv-ZnfQ92KwxJxPgkhj39JH1x5NbY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>JOB SCHEDULING METHOD AND STORAGE MEDIUM WITH COMPUTER- READABLE JOB SCHEDULING PROGRAM RECORDED THEREIN</title><source>esp@cenet</source><creator>TAGUCHI KAN ; KOUDA JUN</creator><creatorcontrib>TAGUCHI KAN ; KOUDA JUN</creatorcontrib><description>PROBLEM TO BE SOLVED: To reduce work quantity which a user has to execute in a scheduling work on a plurality of jobs. SOLUTION: In a job scheduling method, whether or not the change of the execution date of a job is permitted is added to the definition of the respective jobs as the execution condition of the job, when the execution date is overlapped with that of the other job and it is stored in a job schedule file 3. A job calendar generation part 12 reads the definition of the respective jobs from the job schedule file 3, generates a job calendar, and stores it in a job calendar file 4. When the execution dates of a plurality of jobs are overlapped, the execution date on the job calendar of the job, whose change of the execution date is permitted by definition, is changed and is stored.</description><edition>7</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2000</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20000128&amp;DB=EPODOC&amp;CC=JP&amp;NR=2000029722A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76419</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20000128&amp;DB=EPODOC&amp;CC=JP&amp;NR=2000029722A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>TAGUCHI KAN</creatorcontrib><creatorcontrib>KOUDA JUN</creatorcontrib><title>JOB SCHEDULING METHOD AND STORAGE MEDIUM WITH COMPUTER- READABLE JOB SCHEDULING PROGRAM RECORDED THEREIN</title><description>PROBLEM TO BE SOLVED: To reduce work quantity which a user has to execute in a scheduling work on a plurality of jobs. SOLUTION: In a job scheduling method, whether or not the change of the execution date of a job is permitted is added to the definition of the respective jobs as the execution condition of the job, when the execution date is overlapped with that of the other job and it is stored in a job schedule file 3. A job calendar generation part 12 reads the definition of the respective jobs from the job schedule file 3, generates a job calendar, and stores it in a job calendar file 4. When the execution dates of a plurality of jobs are overlapped, the execution date on the job calendar of the job, whose change of the execution date is permitted by definition, is changed and is stored.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2000</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjLEKwjAURbs4iPoPD_eCxEEc07xnktIk5TWhYykScRAt1P_HDk5O3uXCuYe7Lu51qKBThjA11mtwFE1AkB6hi4GlpgWhTQ56Gw2o4NoUiUtgkiirhuDnoOWgWbplV4GREKIhJuu3xeo2Pua8-_am2F8oKlPm6TXkeRqv-ZnfQ92KwxJxPgkhj39JH1x5NbY</recordid><startdate>20000128</startdate><enddate>20000128</enddate><creator>TAGUCHI KAN</creator><creator>KOUDA JUN</creator><scope>EVB</scope></search><sort><creationdate>20000128</creationdate><title>JOB SCHEDULING METHOD AND STORAGE MEDIUM WITH COMPUTER- READABLE JOB SCHEDULING PROGRAM RECORDED THEREIN</title><author>TAGUCHI KAN ; KOUDA JUN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JP2000029722A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2000</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>TAGUCHI KAN</creatorcontrib><creatorcontrib>KOUDA JUN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>TAGUCHI KAN</au><au>KOUDA JUN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>JOB SCHEDULING METHOD AND STORAGE MEDIUM WITH COMPUTER- READABLE JOB SCHEDULING PROGRAM RECORDED THEREIN</title><date>2000-01-28</date><risdate>2000</risdate><abstract>PROBLEM TO BE SOLVED: To reduce work quantity which a user has to execute in a scheduling work on a plurality of jobs. SOLUTION: In a job scheduling method, whether or not the change of the execution date of a job is permitted is added to the definition of the respective jobs as the execution condition of the job, when the execution date is overlapped with that of the other job and it is stored in a job schedule file 3. A job calendar generation part 12 reads the definition of the respective jobs from the job schedule file 3, generates a job calendar, and stores it in a job calendar file 4. When the execution dates of a plurality of jobs are overlapped, the execution date on the job calendar of the job, whose change of the execution date is permitted by definition, is changed and is stored.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_JP2000029722A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title JOB SCHEDULING METHOD AND STORAGE MEDIUM WITH COMPUTER- READABLE JOB SCHEDULING PROGRAM RECORDED THEREIN
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T05%3A56%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=TAGUCHI%20KAN&rft.date=2000-01-28&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJP2000029722A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true