Fujitsu Corporation

Daichi Shimada

Yuichi Sato

Shinichi Sazawa

Hiroaki Kameyama

Toshiyuki Shibuya

Sachio Kobayashi

Kenji Gotsubo

Ryo Murakami

Takafumi Anraku

A non-transitory computer-readable storage medium storing a work planning program that causes at least one computer to execute a process, the process includes dividing a plurality of objects into a plurality of groups according to a type of a constraint condition set to each of the plurality of objects, the constraint condition being related to an order in which the plurality of objects are worked in a work line; and acquiring an order of the plurality of objects in the work line so that the constraint condition is satisfied in each of the plurality of groups.

Information processing device, work planning method, and storage medium

An optimization apparatus for repeatedly obtaining a constraint violating solution, a constraint satisfying solution, and an approximate solution in a resource-constrained project scheduling problem performs setting an end time of a target optimization period at a point between a first finish time equal to a finish time of a latest version of the constraint violating solution and a second finish time equal to a finish time of a latest version of the constraint satisfying solution, followed by obtaining the approximate solution using a metaheuristic algorithm, making a determination as to whether the approximate solution violates constraint or satisfy the constraint, and performing, based on the determination, updating the first finish time with a finish time of the approximate solution when the approximate solution violates the constraint, and updating the second finish time with a finish time of the approximate solution when the approximate solution satisfies the constraint.

Optimization method and apparatus for minimizing the makespan using an ising machine

A method includes: executing judgment processing for judging whether a site to carry out a first task assigned to a first robot and a site to carry out a second task assigned to a second robot are likely to overlap each other; executing comparison processing for comparing first end time with second end time when the sites to carry out the first task and the second task are likely to overlap each other; and executing determination processing for selecting the first task order when the first end time is earlier than the second end time, and selecting the second task order when the second end time is earlier than the first end time.

Task planning apparatus, task planning method, and non-transitory computer-readable storage medium

A transfer device allocates, within the range of the maximum communication band of a network that a plurality of groups of applications use in common, a communication band equal to or larger than the minimum band for each of the groups. Furthermore, the transfer device converts, within a communication band allocated to each group, TCP data received from a transmission source of data to UDP data, transfers the UDP data to a transmission destination, and retransmits retransmission data in response to a retransmission request of the UDP data.

Transfer device, and transfer method

A transfer device increments a value of a phase ID at predetermined time intervals, and registers a packet ID of a transmitted data packet and a phase ID on a determination table in an associated manner. When having received a response packet from a receiving-side transfer device, the transfer device determines an unarrived packet on the basis of received packet IDs contained in the received response packet and packet IDs of transmitted data packets. Then, the transfer device determines whether a data packet corresponding to the unarrived packet is lost or on-the-fly from a relationship between a phase ID of the unarrived packet and the maximum phase contained in the received response packet, and retransmits the corresponding data packet only if it is lost.

Growing community of inventors

Kawasaki, Japan

Daichi Shimada