Patents by Inventor Nirmal Govind

Nirmal Govind 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).

  • Publication number: 20180018614
    Abstract: Embodiments of the technique disclosed include a computer-based system and method for creating schedules that matches total supply of clinicians with the projected demand in services as well as meet plurality of constraints that consists of scheduling rules and clinician availability/preferences of varying weighted values to ensure work-life balance and thereby avoid staff burnout. In some embodiments, the system predicts the demand in appointments and the capacity of clinicians based on past data, leading to greater accuracies for subsequent schedule creations.
    Type: Application
    Filed: March 17, 2017
    Publication date: January 18, 2018
    Inventors: Suvas VAJRACHARYA, Candace L. CAPPS, Rahul VAIDYA, Shardul SARDESAI, Pelin DAMCI-KURT, Nirmal GOVIND
  • Publication number: 20120130765
    Abstract: A constraint-based framework models and solves the problem of assigning staff to various work-shifts or work-assignments, for example a day shift and a night shift, for a pre-defined scheduling horizon, for example three months. A work-schedule is produced, which is defined as a list of staff-shift or staff-assignment combinations that meet the various criteria set by the staff and the healthcare facility on how the staff need to work. The staff then uses this work-schedule to perform the needed activities for the amount of time specified by the scheduling horizon. The scheduling problem is modeled with the help of constraints and variables to express the physical constraints specified by the staff on their work schedules and the needs of the healthcare facility. By embedding the scheduling model within a software program, a work-schedule is produced quickly that meets the requirements of the staff and the healthcare facility.
    Type: Application
    Filed: November 29, 2011
    Publication date: May 24, 2012
    Inventors: Nirmal GOVIND, Suvas Vajracharya, Richard Shafer
  • Publication number: 20110112877
    Abstract: A constraint-based framework models and solves the problem of assigning staff, for example a set of cardiologists, to various work-shifts or work-assignments, for example a day shift and a night shift, for a pre-defined scheduling horizon, for example three months. A work-schedule is produced, which is defined as a list of staff-shift or staff-assignment combinations that meet the various criteria set by the staff and the healthcare facility on how the staff need to work. The staff then uses this work-schedule to perform the needed activities for the amount of time specified by the scheduling horizon. The scheduling problem is modeled with the help of constraints and variables to express the physical constraints specified by the staff on their work schedules and the needs of the healthcare facility. By embedding the scheduling model within a software program, a work-schedule is produced quickly that meets the requirements of the staff and the healthcare facility.
    Type: Application
    Filed: November 9, 2009
    Publication date: May 12, 2011
    Inventors: Nirmal Govind, Suvas Vajracharya, Richard Shafer
  • Patent number: 7668614
    Abstract: Embodiments of a method of optimally scheduling, in near real-time, workunits for processing on processing stations in a processing system, while accounting for constraints such as processing station qualifications by workunit type and service type, and to meet certain business objectives such as cycle time and demand targets, are described. A method of scheduling the processing of workunits in a processing system comprises defining a plurality of workunits, aggregating the work units by workunit type and service to be performed on each workunit to define one or more workunit type-service type groupings. The method further allocates capacity of one or more processing stations to workunit type-service type groupings, assigns workunits of the plurality of workunits to meet the allocated capacity, and sequences the workunit type-service type groupings and workunits on each processing station of the one or more processing stations. Other embodiments are described and claimed.
    Type: Grant
    Filed: September 29, 2005
    Date of Patent: February 23, 2010
    Assignee: Intel Corporation
    Inventors: Nirmal Govind, Bala Iyer, Charles S. Lockwood, James R. Wuerfel, Peter J. Lopez
  • Publication number: 20090171493
    Abstract: Execution control systems for optimizing the efficiency of manufacturing processes are described in this application. For example, an execution management system may optimize IC processes and scheduling by analyzing a number of desired metrics along with system constraints, such as tool availability, tool reliability, etc, along with information from conventional processing tools such as APC and SPC. The optimized processing schedule may then be implemented in real-time and updated with new process requests and current information relating to tools and other metrics, thereby reducing human interaction and inefficiency. Other embodiments are also described in this application.
    Type: Application
    Filed: December 31, 2007
    Publication date: July 2, 2009
    Inventors: Nirmal Govind, Nital S. Patel, Nitin A Shah
  • Publication number: 20070073430
    Abstract: Embodiments of a method of optimally scheduling, in near real-time, workunits for processing on processing stations in a processing system, while accounting for constraints such as processing station qualifications by workunit type and service type, and to meet certain business objectives such as cycle time and demand targets, are described. A method of scheduling the processing of workunits in a processing system comprises defining a plurality of workunits, aggregating the work units by workunit type and service to be performed on each workunit to define one or more workunit type-service type groupings. The method further allocates capacity of one or more processing stations to workunit type-service type groupings, assigns workunits of the plurality of workunits to meet the allocated capacity, and sequences the workunit type-service type groupings and workunits on each processing station of the one or more processing stations. Other embodiments are described and claimed.
    Type: Application
    Filed: September 29, 2005
    Publication date: March 29, 2007
    Inventors: Nirmal Govind, Bala Iyer, Charles Lockwood, James Wuerfel, Peter Lopez