Xerox Corporation

Conduent Business Services, LLC

Pallavi Manohar

Eric Michael Gross

Manoj Gupta

Tulia Plumettaz

Koyel Mukherjee

Narayanan Unny Edakunni

Sharmistha Jat

Shourya Roy

Chithralekha Balamurugan

Jagadeesh Chandra Bose Rantham Prabhakara

Ketki Kulkarni

Ankit Kumar

The disclosed embodiments illustrate methods and systems for crowdsourcing a task. The method includes identifying a first set of workers from workers, based on a performance of the workers on a set of tasks previously attempted by the workers, and a Service Level Agreement (SLA) associated with the task. The method further includes generating a graph comprising nodes and edges connecting the nodes. Each of the one or more nodes is indicative of a worker. An edge, connecting two workers, is indicative of said two workers having worked together on at least one task. The method further includes receiving an input, to select a second set of workers from the first set of workers, based on one or more first parameters associated with each of the nodes in said graph and second parameters associated with each of the edges in the graph.

Method and system for crowdsourcing tasks

A method and a system are provided for routing a plurality of print jobs and generating a schedule to process the plurality of print jobs. A routing server routes the plurality of print jobs to a plurality of print shops to process the plurality of print jobs within a pre-defined period. The routing server receives a first capacity from each of the plurality of print shops. The routing server routes a first set of print jobs from the plurality of print jobs to the plurality of print shops based on the request and the received first capacity. In an embodiment, a first cost of routing the first set of print jobs is less than a pre-defined first threshold. An application server generates the schedule for processing the first set of print jobs based on one or more second constraints. The first set of jobs are submitted based on the schedule.

Methods and systems for routing and scheduling print jobs

The disclosed embodiments illustrate methods and systems for recommending one or more vehicles, commuting on a predefined route, for one or more requestors. The method includes determining a first additional distance traversable by each vehicle apart from the predefined route to accommodate each requestor. Further, a graph comprising a first set of nodes representing the one or more requestors, and a second set of nodes representing the one or more vehicles, is generated. Thereafter, a mapping between the first set of nodes and the second set of nodes is determined based on the first additional distance. The mapping corresponds to an allocation of a requestor to a vehicle such that an additional distance traversable by the vehicle is less than an additional distance traversable by remaining vehicles apart from the predefined route. Thereafter, the one or more vehicles are recommended for the one or more requestors based on the mapping.

Method and system for recommending one or more vehicles for one or more requestors

The disclosed embodiments illustrate methods and systems for scheduling one or more first vehicles along a route in a transportation system. The method includes determining one or more demands pertaining to a commutation along a route, where the route comprises at least one pair of stations such that there is a unique path between the pair of stations. The method further includes determining a set of constraints associated with the transportation system. The set of constraints are based on at least a count of second vehicles plying on one or more routes in the transportation system at a time instance, a capacity of a first vehicle, and a performance metric of the transportation system. Further, the method includes determining a count of first vehicles, for plying along the route at the time instance, based on at least the set of constraints.

Method and system for scheduling vehicles along routes in a transportation system

A system for performing queue-based routing of print jobs in one or more print production environments includes a computing device having a processor, and a computer-readable storage medium in communication with the computing device. The computing device will receive print jobs from one or more client computing devices, and the computing device will store the received print jobs in a scheduling queue. When the computing device determines that a released print job has been released by a print production environment, it will determine a similarity metric for a plurality of print jobs in the scheduling queen, identify the print job having the highest similarity metric, and route the identified print job to the print production environment for processing.

Methods and systems for performing queue-based routing of print jobs in a multi-site print production environment

Methods and systems evaluate the most recent print job processed with different printing sites to calculate the current residual capacity for each of the different printing sites. The current residual capacity is determined and maintained by a computerized server. These methods and systems can then calculate the turnaround time of a print job for each of the different printing sites based on the current residual capacity, can calculate the cost of the print job for each of the different printing sites based on historical cost information maintained by the computerized server, and can calculate a weighted sum of the turnaround time and cost of the print job for each of the different printing sites. This allows these methods and systems to select one of the different printing sites based on the relatively lowest weighted sum for the print job, and to assign the print job to the selected printing site.

Optimal scheduling of multi-site enterprise print jobs

A system for performing queue-based routing of print jobs in a multi-site print production environment may include an electronic dispatch system having a scheduling queue, at least one processor and a computer-readable storage medium. The computer-readable storage medium may include programming instructions that, when executed, cause the processor to receive print jobs from client computing devices, identify one or more print shops, select a set of print jobs from the scheduling queue that are to be assigned to the print shops for completion, generate a feasibility matrix for the selected print jobs, determine a preliminary assignment of the selected print jobs to the identified print shops using a set cover heuristic, use a linear programming heuristic to determine a final assignment of the selected print jobs to the identified print shops, and route each of the selected print jobs to an assigned print shop as specified by the final assignment.

Methods and systems for performing queue-based assignment of print jobs in a multi-site print production environment

Methods and systems for facilitating evaluation of one or more electronic documents. One or more templates are extracted from the one or more electronic documents. At least one area in the one or more templates is identified. The at least one area includes a response provided by a user associated with the electronic document. One or more groups are generated based on similarity between the responses in the at least one area in the one or more templates. The one or more groups are distributed to one or more remote workers or a crowdsourcing platform for the evaluation.

Methods and systems for facilitating evaluation of documents

A system for performing queue-based routing of print jobs in a multi-site print production environment may include a computing device having a scheduling queue and a processor, and a computer-readable storage medium in communication with the computing device. The computer-readable storage medium may include one or more programming instructions that, when executed, cause the processor to receive a plurality of print jobs from one or more client computing devices, store the received print jobs in the scheduling queue, determine that a released print job has been released by a print production environment, identify a similar print job from the received print jobs in the scheduling queue, remove the identified similar print job from the scheduling queue, and route the identified similar print job to the print production environment.

Growing community of inventors

Thane, India

Pallavi Manohar