Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
SYSTEM FOR RESOLVING SCHEDULING PROBLEM
Document Type and Number:
Japanese Patent JPH01109469
Kind Code:
A
Abstract:
PURPOSE:To shorten a computing time by separating the selection of a job and a machine and limiting a resolving space to a partial space when the job is allocated to the machine. CONSTITUTION:A machine selecting part 11 is provided to select one machine, which is in an allocatable condition, as a notice machine. Then, a job selecting part 12 is equipped to execute a processing to reduce candidate job groups, which the notice machine can process, into a selected job group according to a relation between a necessarily maximum time and a possibly minimum time concerning the allocation startable time to correspond to the respective jobs and the machine except for the notice machine. A partial space retrieval processing part 16 is equipped to execute the processing to allocate the notice machine to the job in the selected job group. Thus, since a scheduling can be executed only by retrieving an extremely small partial space, the computing time for the scheduling can be widely shortened.

Inventors:
HONDA FUMIO
MATSUMOTO HITOSHI
SATO KIMINORI
Application Number:
JP26756187A
Publication Date:
April 26, 1989
Filing Date:
October 22, 1987
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
FUJITSU LTD
International Classes:
G06Q50/26; G06Q10/00; G06Q10/06; G06Q10/10; G06Q50/00; (IPC1-7): G06F15/21
Attorney, Agent or Firm:
Yoshiyoshi Ogasawara (2 outside)



 
Previous Patent: JPH01109468

Next Patent: JPH01109470