Patents by Inventor Paul F. Williams

Paul F. Williams has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 5155679
    Abstract: An iterative method of sequencing jobs in a flexible manufacturing environment where such manufacturing jobs have sequence-dependent set-up times provides for solutions which approximate optimal sequencing while requiring only modest computational resources. Initially, the invention recasts a sequence of manufacturing jobs as a dynamic traveling salesman problem (TSP), in which the system must reconfigure itself and then execute each job in the same way a salesman must visit a sequence of cities, but where the distances between cities change depending upon cities already visited. The first step of the invention reduces the difficult dynamic traveling salesman problem to a static TSP, where distances between each possible job pair are fixed as a monotonic function of parts the two jobs share in common.
    Type: Grant
    Filed: December 18, 1989
    Date of Patent: October 13, 1992
    Assignee: Hewlett-Packard Company
    Inventors: Shailendra E. Jain, Paul F. Williams
  • Patent number: 5077661
    Abstract: An iterative, assignment-dependent, method of allocating manufacturing resources to perform operations required in the manufacture of multiple products provides for improved conformance with actual manufacturing situations and for solutions which approximate optimal allocation while requiring only modest computational power and time. The first step involves attributing complex costs to potential assignments of operations to resources. Complex costs include two components, combined money-costs and combined times. Combined cost is an assignment dependent variable which can equal operational cost or the sum of operation cost and set-up cost depending on assignments that have already been made. Combined time is likewise assignment dependent. In a second step, combined cost is selected as a parameter to evaluate each potential operation-resource pair. In a third step, a lowest cost and a second lowest cost resource are determined for each unassigned operation.
    Type: Grant
    Filed: May 3, 1989
    Date of Patent: December 31, 1991
    Assignee: Hewlett-Packard Company
    Inventors: Shailendra K. Jain, Paul F. Williams
  • Patent number: 4964033
    Abstract: Microprocessor controlled apparatus for interconnecting at least two very high speed integrated circuit chips having digital inputs and outputs. Included are a local data bus, a microprocessor unit and its associated memory unit, and a plurality of functional interface units. One functional interface unit is connected between the microprocessor and the local bus. The remaining functional interface units are connected between the local bus and one of the integrated circuit chips so that all of the functional interface units are responsive to control commands from the processor and pass data from one integrated circuit chip to another. The circuit chips can be custom or can be customized via substrate interconnection.
    Type: Grant
    Filed: January 3, 1989
    Date of Patent: October 16, 1990
    Assignee: Honeywell Inc.
    Inventor: Paul F. Williams