Disclosed are methods and systems for process scheduling. A method may include, for example, obtaining, by a device including at least one quantum processing unit, a set of operations data for an industrial facility; generating, by the device, an optimization model based on the set of operations data; calculating, by the device using the at least one quantum processing unit and the optimization model, a set of solution values; and transmitting the set of solution values to a scheduling device configured to generate a process schedule for the industrial facility.

A tree search-based scheduling method and an electronic apparatus are provided. In the method, multiple order lists are received and a schedule is initialized, wherein each order list includes multiple production operations. In each order list, a first production operation which has not been joined into the schedule yet is selected, such that multiple prior operations are selected. An execution priority of the prior operations is calculated according to multiple dispatching rules, and multiple candidate operations are selected from the prior operations according to the execution priority. Afterwards, the candidate operations are listed as a next operation of the schedule respectively, and a scheduling simulation is performed according to the dispatching rules to obtain multiple scheduling indicators of the candidate operations. Scheduling is performed according to the scheduling indicators.

A method and system to help control body-shop processing of vehicles, based on timing of interaction with a touch-screen display. In an example implementation, a body shop will be equipped with a computing system including a touch-screen display, with the computing system being configured to manage presentation on the display of graphical representations of job-cards for individual body-shop jobs, such as individual vehicles in for repair. With such an arrangement, body shop personnel could drag and drop job cards from one section to another to indicate transitions of jobs between body-shop processing steps. The computing system will then advantageously make use of data regarding the timing of those drag-and-drop operations as a basis to control body-shop processing, such as be predicting a processing duration of a job currently in process and taking action to modify processing of the job based on the predicted duration for instance.

A manufacturing-job apparatus includes a control module, a holding module, and a job module. The holding module is configured to hold a job object. The job module is configured to execute a job for the job object. The control module includes a communication unit and a common interface. The communication unit is configured to communicate with each of the holding module and the job module. The common interface is configured to supply motive power to both of the holding module and the job module.

In a process of transfer of production control in proximity to production site for enabling decentralized manufacturing, production control data and routing data are retrieved from a centralized system. The retrieved production control data and the routing data are stored within a connector installed at a proximity to a plant floor. An operation associated with the production control data of a purchase order is matched with the resource published in the connector. Upon determining the match between the operation and the resource, the resource is dynamically allocated to perform the operation. The control of manufacturing process of the plant floor is provided to the connector to realize de-centralized manufacturing.

A method and a system for scheduling parallel machines based on hybrid shuffled frog leaping algorithm and variable neighborhood search algorithm are provided to solve collaborative production and processing of jobs on a plurality of unrelated batch processing machines. The jobs are distributed to machines based on the normal processing time and deterioration situation of the jobs on different machines and are arranged. An effective multi-machine heuristic rule is designed according to the structural properties of an optimal solution for the single-machine problem, and the improved rule is applied to the improved shuffled frog leaping algorithm to solve this problem. The improvement strategy for the traditional shuffled frog leaping algorithm is to improve the local search procedure of the traditional frog leaping algorithm by introducing the variable neighborhood search algorithm. The convergence rate and optimization capacity of the original algorithm are thus improved.

A method for elaborating work orders to be performed by a system capable of driving manufacturing machinery, in particular a Manufacturing Execution System (MES) or Manufacturing Operation Management (MOM) includes providing work orders containing a series of part programs, the part programs containing information regarding tools to be employed and/or information about a priority of execution. The part programs are read and ordered according to an order of execution, on the basis of the information.

A method and system to help control body-shop processing of vehicles, based on timing of interaction with a touch-screen display. In an example implementation, a body shop will be equipped with a computing system including a touch-screen display, with the computing system being configured to manage presentation on the display of graphical representations of job-cards for individual body-shop jobs, such as individual vehicles in for repair. With such an arrangement, body shop personnel could drag and drop job cards from one section to another to indicate transitions of jobs between body-shop processing steps. The computing system will then advantageously make use of data regarding the timing of those drag-and-drop operations as a basis to control body-shop processing, such as be predicting a processing duration of a job currently in process and taking action to modify processing of the job based on the predicted duration for instance.

A process extends manufacturing execution system (MES) functionalities in a domain having MES lineage contextualized entities (MLCEs) and commands. The process includes selecting a command implementing the functionality to be extended; contextualizing the command with a MLCE to obtain an entity contextualized command (ECC); extending the MLCE and the ECC, to obtain an extended MLCE (EMLCE) and an extended ECC (EECC); registering in the routing system a first and second handler of the command in association with the lineage of the MLCE and the EMLCE; and communicating between domains by delivering message(s) including a name of the command and the MLCE or the EMLCE, the routing system selecting the first or the second handler, for executing the functionality or the extended functionality, based on a mapping between the lineage registered for the first or the second handlers in the routing system, and a lineage derived from the message.

A display method includes storing, in a storage unit, first history information in which a processing is executed by a substrate processing apparatus based on a recipe; storing, in the storage unit, second history information in which an execution instruction for a job is received to instruct execution of the processing; and calculating, based on the first history information and the second history information, a first idle time indicating a time during which the processing is not performed and a second idle time indicating a time from an end of the job to a start of execution of a next job, and displaying the first idle time and the second idle time.