Abstract: A method and system for allowing a vehicle dealer and manufacturer to match dealer orders and manufacturing plant shipments easily and equitably are disclosed. The method significantly decreases processing time, saving valuable time, money, and manpower resources. An automated linear expression calculation for determining and balancing vehicle allocation allows for equitable balancing of manufacturing plant orders and efficient optimization. The linear expression calculation may be performed in an iterative series of steps. The linear expression calculation handles a plurality of attribute features, thereby accommodating a plurality of dealer requests and vehicle options. The linear expression calculation creates a matrix representing the plurality of attribute features, and with each iteration the values within the matrix are refined and optimized, with the resulting matrix representing an optimized and balanced allocation of manufacturing plant production orders among a plurality of manufacturing plants.

Abstract: Features described herein relate to optimizing a job plan procedure for selecting a plan for executing a manufacturing job. A planner can receive a model of a system that is to perform a job, and may select a precomputed plan that is sufficient to perform the job. The precomputed plan is identified during a first portion of a planning period, and the remainder of the planning period may be utilized to search for and identify a better plan for executing the job. If a better plan cannot be identified by the end of the planning period, then the selected precomputed plan can be executed.

Abstract: To assess the sufficiency of a plurality of machines for processing a number of items, machine availability information indicative of availability of the machines for processing the items, machine capacity information indicative of a capacity of each of the machines for processing the items, and machine preference information indicative of a preference of each of the machines for processing the items are obtained. A capacity constraint, such as an upper limit of items to be processed during a time interval, is determined based on the machine availability information, machine capacity information and machine preference information. At least some of the machines are allocated to process at least some of the items based on the machine availability information, machine capacity information and machine preference information, subject to the capacity constraint. The resulting rough-cut capacity plan may be used to balance available capacity against required capacity.

Abstract: Disclosed are a substrate processing apparatus, a substrate processing method, and a storage medium, which can process a normal substrate according to a normal schedule in parallel with a substrate to be processed in preference to other substrates. Processing block performs the same types of processes for substrates, carried therein from FOUP placing unit, by using process arms. When a priority substrate having a priority over other substrates are carried, control unit carries and processes the priority substrate in priority processing unit that can receive a next substrate among priority processing units to which a plurality of processing units are partially or wholly assigned, in preference to other substrates.

Abstract: A method and system are provided which reorders a sequence of operations of a part program to reduce the number of tool changes during execution of the program. The reordered sequence maintains a sequence of at least a first portion of the operations.

Abstract: The present application a new and improved system and method of enhanced Lean Document Production (LDP), which applies cellular manufacturing to document printing operations. The LDP process incorporates process friendly cells and, a push model to order to improve efficiency, reduce work in progress and smooth out the “frictions” in production environments. The current application presents an earliest-completion-time strategy for assigning jobs to cells and a dynamic-priority-based-batch-scheduling algorithm.

Abstract: Provided is an order-receiving production system and so on of a wire and wiring harness, by which the cost of the wire and a product using the wire can be prevented from increasing and the resource-saving can be attained. An order-receiving production system 1 of a wiring harness includes a wire-producing department 14, a wiring harness-assembling department 15 and a production control department 16. The production control department 16 forwards a first ordered quantity data D1, second ordered quantity data D2 and third ordered quantity data D3, each data meeting the received ordered data D, to a resin-producing department 44, core wire-producing department 45 and additive-producing department 46, respectively. The departments 44, 45 and 46 produce a pellet, core wire and additive with the respective necessary amount, respectively, and send them to the wire-producing department 14.

Abstract: A first embodiment is a method for semiconductor process control comprising clustering processing tools of a processing stage into a tool cluster based on processing data and forming a prediction model for processing a semiconductor wafer based on the tool cluster. A second embodiment is a method for semiconductor process control comprising providing cluster routes between first stage tool clusters and second stage tool clusters, assigning a comparative optimization ranking to each cluster route, and scheduling processing of wafers. The comparative optimization ranking identifies comparatively which cluster routes provide for high wafer processing uniformity.

Abstract: In a method, device, and computer-readable medium for finite capacity scheduling, heuristic rules are applied in two integrated stages: Job Prioritization and Machine Selection. During Job Prioritization (“JP”), jobs are prioritized based on a set of JP rules which are machine independent. During Machine Selection (“MS”), jobs are scheduled for execution at machines that are deemed to be best suited based on a set of MS rules. The two-stage approach allows scheduling goals to be achieved for performance measures relating to both jobs and machines. For example, machine utilization may be improved while product cycle time objectives are still met. Two user-configurable options, namely scheduling model (job shop or flow shop) and scheduling methodology (forward, backward, or bottleneck), govern the scheduling process. A memory may store a three-dimensional linked list data structure for use in scheduling work orders for execution at machines assigned to work centers.

Abstract: According to an aspect of the present invention, there is provided a dicing apparatus in which: in a case where a control device detects, during an image pickup of a workpiece set onto a second worktable by a first image pickup device and a second image pickup device, that an image of a workpiece set onto a first worktable also needs to be picked up by the first image pickup device and the second image pickup device, the control device determines a priority between an operation performed on the first worktable and an operation performed on the second worktable; and when it is determined that the operation performed on the first worktable has a higher priority, the image pickup of the workpiece set onto the second worktable is interrupted, and the first image pickup device and the second image pickup device are moved to perform an image pickup of the workpiece on the first worktable.

Abstract: A lever position sensor assembly (90) has a main housing (92), a lever (48) pivotally connected to the housing about a first axis (100), and a lever position sensor (84). The lever has at least a portion thereof extending outside the housing. The lever position sensor has a fixed portion (120) and a pivoting portion (122). The fixed portion is connected to the housing. The pivoting portion is pivotally connected to the fixed portion about a second axis (124). The second axis is generally parallel to the first axis. The second axis is spaced from the first axis. The lever is operatively connected to the pivoting portion of the lever position sensor such that pivoting the lever about the first axis pivots the pivoting portion of the lever position sensor about the second axis. A vehicle having a lever position sensor assembly is also disclosed.

Abstract: A method of managing capacity in a business process on demand for providing a service to a service requester. The method comprises the steps of providing a business process having one or more service inputs, at least one service output, at least one capacity constraint having a capacity level and a queue located ahead of the capacity constraint having an upper queue threshold and a lower queue threshold. The method further comprises gathering with a performance monitoring subsystem a set of business process data, and adjusting with a capacity management subsystem the capacity level of the capacity constraint in response to the set of business process data gathered by the performance monitoring subsystem.

Abstract: To provide a method for determining a component pickup order used by a component mounting apparatus which has plural mounting heads, and which causes the mounting heads to alternately pick up components from a component supplying unit and mount the components onto boards. The component pickup order determining method includes pickup order determining steps (S2 and S4) of determining an order according to which the plural mounting heads pick up components from the component supplying unit, so that some of the components corresponding to two or more tasks do not remain in any one of restricted areas where one of the mounting heads cannot pick up any components, when the component supplying unit includes the restricted areas and a task is referred to as at least one of components which is mounted in one of repeatedly executed operation sequences each of which includes suctioning, moving and mounting of the components executed by the mounting heads.

Abstract: A production planning technique inputs demands for products. Each of the demands having multiple due dates, and the multiple due dates having different priorities. An explosion process utilizing linear programming and heuristics is performed to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.

Abstract: A dynamic maintenance planning apparatus including a maintenance planning device and a priority calculating device is provided. The maintenance planning device determines a maintenance date and time on and at which the throughput of a manufacturing system is maximum from among possible maintenance dates and times based on a simulation result in which a specific manufacturing apparatus on a manufacturing system is stopped at a specified maintenance date and time, and, for the maintenance at the determined maintenance date and time, specifies a lot whose completion is predicted to be delayed. The priority calculating device calculates a priority of the lot whose completion is predicted to be delayed so as to prevent waiting time of the lot during the maintenance.

Abstract: The present invention is a method of obtaining information regarding an individual's environment using a programmable device. The first step of the method is sensing a psychomotor behavioral element of an activity engaged by the individual. The type of activity engaged by the individual can be any sensible activity under the sun, including breathing, thinking, generating heat, etc. The next step in the inventive method is determining the preferred modalities of the individual based on the psychomotor behavioral element of the activity engaged by the individual. Provided herein are calculations used for determining the preferred modalities of the individual based on the psychomotor behavioral element of the activity. In the present context, the preferred modalities are the semi-conscious or nonconscious desires of the individual, indicated by nonconscious actions, to experience her environment in a specific manner. The information obtained by the inventive method can be used in several ways.

Abstract: An effective method for managing product segments of product production rules within a manufacturing execution system adapted for providing a final product includes the following steps: a) each one of a plurality of sets of product segments are associated within one of a set of product production rules which are stored in a database under a reference standard product production rule (like a simple “manufacture of a car”); b) a command (e.g.

Abstract: An apparatus and method for a production planning system using a process of adaptive learning is disclosed. A production planning system receives, production objects wherein each production object has at least one attribute. In one embodiment, the production objects include information relating to product to be manufactured. After receipt of production objects, multiple preference scores according to the attributes of the production objects are calculated. In one embodiment, each preference score represents desirability of transition from manufacturing a first object to a second object. The system subsequently identifies a suggested production plan which includes a sequence order of two or more objects in response to the preference scores. In one embodiment, the planning preferences are updated or modified by an adaptive learning system in response to adjustments of the suggested production plant by a planner.

Abstract: A system and method for integrating a production line process control system (PCS) with production line machine controllers to record data about processes completed on a production line. The PCS receives data from line controllers regarding processes that are completed on each part. Process data including process order data is stored by the PCS and used to instruct line controllers on whether a particular part should be accepted for machining or handled in another way. Rejected parts are flagged electronically so when they arrive at a subsequent line controller, they are directed to a chute containing parts removed from the production process. The PCS and line controllers exchange data about each part and applicable processes as it proceeds through production. The PCS records the data to develop a complete part history. The PCS integrates with a plant quality and tracking system that records the historical data.

Abstract: A method for generation of a sequence of operations for a manufacturing process including modeling the manufacturing process through a finite state machine to create a sequence of operations generator operative to generate a list of sequences of operations for the manufacturing process and utilizing the sequence of operations generator to input process information and automatically generate a list of sequences of operations.

Abstract: A scheduling method for a substrate treating apparatus having a plurality of treating units for treating substrates, wherein, based on a procedure including a plurality of treating steps, a controller determines an order of treating a plurality of lots successively in the treating units.

Abstract: A computer-based system and method for production planning are described that relies on developing factory shop floor modeling. This modeling includes simulating the factory shop floor to create a Virtual Factory. This Virtual Factory provides the ability to assess any possible production sequence for determining an optimal of production sequence according to the criteria defined the user.

Abstract: A method for scheduling a production process is disclosed, wherein a production order requiring components is placed on a production schedule, the availabilities of the components, which are required for the production order, are detected by a computing unit, production orders requesting one or more of the components are classified depending on the availabilities of the corresponding components, and the production order is displayed with a first optically observable marker if the order requests a missing component and/or produces a missing component.

Abstract: A method of generating a general recipe for an industrial process that is not site or resource specific to from a master recipe that is site and resource specific, comprises: a) deleting any process elements of the master recipe that are support segments that relate only to resources assigned to the master recipe; b) creating records in the general recipe for any process properties that are designated as not site specific; c) creating records of resource requirements and requirement groups for process elements associated with such resource requirements; and d) determining scheduling relationships for the process elements of the general recipe so generated by: (i) determining which process elements are primary and which are secondary; (ii) determining the processing relationship of other process elements with respect to primary process elements; and (iii) storing data defining whether the processing relationships are general or site specific.

Abstract: The robot control apparatus has an input-output section, a control section including a priority data generation section, a schedule data generation section, an execution command generation section, and a task data dividing section, a map information database, individual information database, a robot information database, and a task information database. The priority data generation section generates priority data for task data, stored in a task control database that that has not been executed. The schedule data generation section generates schedule data by assigning tasks to the robots on the basis of the priority data to generate schedule data. The execution command generation section generates execution commands for causing the robots to execute the tasks.

Abstract: Systems and methods are provide for optimizing the result of an availability check of a required quantity of products, wherein a plurality of rounding algorithms are provided. In one embodiment, a method is provided that comprises a first step of rounding, according to at least one predetermined rounding algorithm, the required quantity of products. The method may also comprise a second step of checking availability of the rounded quantity of products and a third step of rounding down, according to the at least one predetermined rounding algorithm, the available quantity of products if the available quantity of products is lower than the rounded required quantity of products.

Abstract: A buffer station provides potential improvement for the operation of a facility. By storing to-be-accessed workpieces in the buffer stations of an equipment, the operation of the facility is not interrupted when the equipment is down. The workpieces can be retrieved through emergency access port of the buffer station, thus ensure the continuous supply of workpieces for the workpiece flow of the facility. Algorithm for getting the needed workpieces to the buffer station is also provided through a controller or a computer mechanism. The buffer station can be incorporated in a stocker, such as wafer stocker or reticle stocker.

Abstract: To model head assignments for a multihead composite material application machine having a set of heads, a ply geometry for a composite part is received and a configuration for the multihead composite material application machine is received. In addition, a constellation of head locations is generated in response to the ply geometry and the configuration for the multihead composite material application machine. Furthermore, a head location of the constellation of head locations is assigned to a corresponding head of the set of heads and a graphical model of the multihead composite material application machine applying the composite material upon the composite part is generated in response to the assigned head locations.

Abstract: A computerized system is provided for scheduling a plurality of work orders in a manufacturing process. Each work order to be scheduled specifies a set of operations to be performed using a plurality of resources and materials. Data including resource availability information for each resource used in the manufacturing process, material availability information for each material used in the manufacturing process, and work order information is received and stored in a computer. The work order information includes a release date for the work order, a want date for the work order, operations information, and material requirements information. The operations information includes the identity and sequence of operations to be performed for the work order, the identity of the resources needed to perform each operation, a minimum resource capacity needed to perform each operation, and the time needed to perform the operation.

Abstract: A method for controlling handling of a plurality of substrates to be processed in an integrated mastering system and an integrated mastering system for performing the method of the invention is provided. The system comprises various treating stations to be passed through by the substrates in a predetermined order, a buffer for temporarily storing the substrates and a handler for moving the substrates between the buffer and the treating stations. According to the method each one of the plurality of substrates is moved to the buffer upon completion of processing in each one of said treating stations.

Abstract: The invention disclosed here is a method for achieving simultaneous consideration of multiple independent dates associated with a single demand. The method iterates through the demands to match the demands with the supply quantities respecting demand priorities which vary over time and demand quantities which may perish over time. One embodiment of the invention allocates demand to supply through an iterative process beginning with earlier demand requirement dates and concluding with later demands which may preempt supply from earlier demands depending upon their relative priorities. An additional embodiment transforms the demands to create multiple demand records, each having an associated priority, such that a single original demand record is transformed into a plurality of related demand records, each having an associated priority. The component supply quantities are accumulated into period ending inventories.

Abstract: A system and method for lot priority adjustment. The system includes a database, a calculation unit and an adjustment unit. The database stores at least a committed date for a lot, a throughput rate and a cycle time for respective route operations in a production line, and Work-In-Process (WIP) information of the production line. The calculation unit calculates an x-ratio for the lot on a target route operation according to a current time, the committed date and a remaining cycle time for the lot, calculates a lot weight for the lot according to current loading of a predetermined number of route operations subsequent to the target route operation, and calculates a weighted x-ratio according to the x-ratio and the lot weight. The adjustment unit adjusts a priority for the lot according to the weighted x-ratio.

Abstract: A method and an apparatus for routing a semiconductor wafer to at least one of a plurality of processing tools based upon tool performance. Data relating to a performance of a first processing tool and a performance of a second processing tool is acquired. A semiconductor wafer is routed to one of the first processing tool or the second processing tool based upon a comparison between the performance of the first processing tool and the performance of the second processing tool using a controller.

Abstract: In a first aspect, a method of managing work in progress within a small lot size semiconductor device manufacturing facility is provided. The first method includes providing a small lot size semiconductor device manufacturing facility having (1) a plurality of processing tools; and (2) a high speed transport system adapted to transport small lot size substrate carriers among the processing tools. The method further includes maintaining a predetermined work in progress level within the small lot size semiconductor device manufacturing facility by (1) increasing an average cycle time of low priority substrates within the small lot size semiconductor device manufacturing facility; and (2) decreasing an average cycle time of high priority substrates within the small lot size semiconductor device manufacturing facility so as to approximately maintain the predetermined work in progress level within the small lot size semiconductor device manufacturing facility. Numerous other aspects are provided.

Abstract: A method and system for managing process jobs in a semiconductor fabrication facility is described. In one embodiment, the method includes receiving a plurality of process jobs associated with one or more priorities. The method further includes executing the plurality of process jobs in an order reflecting the priorities. The order is modifiable in real time upon receiving a new process job with a priority higher than the priorities of the plurality of process jobs.

Abstract: This invention provides a means to minimize the costs of technical and business processes. These processes are comprised of resources and tasks requiring resources. The optimization consists of the best assignment of resources to tasks to minimize the costs. In the resource assignment optimization method disclosed herein, Genetically Adapted Search Agents (GASA) are employed to improve a population of possible assignments, each represented by a single variable length chromosome, where the chromosome upon which the GASA operates is a direct encoding of possible resource to task assignments and order. To manage the enlarged search space, this method uses the GASA with substring crossover to evolve the population towards better solutions. The assignments generated by this method satisfy all constraints.

Abstract: A method for dispatching wafers for processing in a tool includes identifying a queue of wafers available to be processed in the tool. One of the wafers is randomly selected based at least in part on a length of time each wafer has been in the queue. The selected wafer is dispatched for processing in the tool.

Abstract: A new Task Queue Methodology (TQM) is provided for reducing traffic jams and for controlling transportation priority in an Automatic Material Handling System (AMHS). A Stocker Resource Q, under control of TQM, maintains records of stockers that are under control of the AMHS and the availability thereof. For available stockers, a Task-Q under control of a Queue Manager (TQM) is accessed, extracting therefrom records that match available stocker resources. For the available stocker resources, the tasks that are scheduled against these resources are sorted by priority and by longest wait time, resulting in one selected task. For the in this manner selected task, a Move command is issued by the TQM to the Automatic Material Handling System.

Abstract: A reticle stocking and sorting system. The reticle management system comprises first reticle storage, second reticle storage, third reticle storage, and a host system. The first reticle storage stores a first reticle currently in use. The second reticle storage stores a second reticle not currently in use. The third reticle storage stores a third unused reticle temporarily before it is disposed of. The host system is adapted to rearrange the first, second, and third reticles among the first, second, and third reticle storages, based on demand data pertaining to a product requiring least one article during fabrication.

Abstract: A design tool includes a service definition model to enable abstract description of distributed computing systems and distributed applications. The design tool also includes a schema to dictate how functional operations within the service definition model are to be specified. The functional operations include design of distributed applications, deployment of distributed applications, and management of distributed applications.

Abstract: Tools and/or resources which newly become available to a re-entrant flow manufacturing line, data processing pipeline or the like are allocated in substantially real time to processing operations independent of and consistent with a scheduling segment previously generated by dispatching items such as workpieces or data to tools and/or resources of a manufacturing line until the newly available tool or resource can be conveniently included in a subsequently generated schedule segment in order to avoid productivity loss due to schedule latency. Items can be dispatched in a priority order to accelerate completion of processing. A schedule segment including the newly available tool or resource can be facilitated by merging allocations of a real time dispatch list with allocations of a dispatch list corresponding to a previously generated schedule segment.

Abstract: In the production process where an ordered article and a forecast production article are mixed, parameters for defining production priority of each article are preset while assuming a case where the demand exceeds the available production capability, and priority is given to an article which must be produced first within the range of available production capability according to the marginal stock rate of each article. The marginal stock rate is determined by (effective stock amount/necessary stock amount) for a forecast production article. As for the ordered production article, a stock sufficient for delivery is required at the time of shipment. Accordingly, stock of that quantity (demand take-in amount) can be regarded as the necessary amount of stock while the currently completed products can be regarded as the effective stock amount. Thus, the marginal stock rate (effective stock amount/demand take-in amount) can be indexed.

Abstract: A method for determining priority of a selected workpiece in a process flow including a plurality of operations includes providing an objective function relating manufacturing losses to workpiece priority for the operations in the process flow. The objective function is solved to generate priority metrics for at least a subset of the operations remaining for the selected workpiece to allow completion of the selected workpiece in the process flow by a target completion due time.

Abstract: The methodology disclosed herein calculates the dates that product must come to stock for every component in the supply chain as needed to meet exit demands associated with a plurality of due dates and priorities. Every planned product stock is thus associated with multiple stock dates and associated priorities as is every planned manufacturing start and every shipment.

Abstract: Methods and systems for wafer lot ordering using including estimation of allowable queue time based on utilization loss and rework percentage have been achieved. The method invented comprises steps of ranking lots, allocating equipment to the exit step of queue time, calculating and determining the optimal allowable queue time based on utilization loss and rework percentage, calculating the next available time for equipment, calculating earliest release time, and releasing lot/batch and pre-assign it to the equipment at exit step. The present invention can be applied to other manufacturing lines than semiconductor manufacturing.

Abstract: Methods and apparatus are provided for managing movement of small lots between processing tools within an electronic device manufacturing facility. In some embodiments, a number of priority lots to be processed is determined and an equivalent number of carrier storage locations are reserved at a substrate loading station of a processing tool. The number of reserved carrier storage locations are made available either by processing and advancing occupying non-priority lots and/or moving unprocessed occupying non-priority lots from the substrate loading station. Priority lots are then transferred to the reserved carrier storage locations. Other embodiments are provided.

Abstract: Features described herein relate to concurrently processing multiple batches of job requests for one or more machines and/or components thereof, using a plurality of job planning queues. Each batch of job requests is allocated to a planning queue, and each planning queue comprises an unplanned subqueue that stores unplanned jobs, an unsent subqueue that stores planned jobs waiting to be executed, and a sent subqueue that stores planned jobs that have been output to the machine(s) for execution. A job planner and related components determine which unsent subqueue has the fewest planned jobs at a given point in time, and selects an unplanned job from the unplanned subqueue in the same planning queue as the identified unsent subqueue. The planner then generates a plan for the selected job and inserts the planned job into the unsent subqueue for eventual output to the machine(s) for execution.

Abstract: A production planning method inputs demands for products. The demands have multiple due dates, and the multiple due dates have different priorities. The method performs an explosion process utilizing linear programming and heuristics to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.

Abstract: A production planning method inputs demands for products. The demands have multiple due dates, and the multiple due dates have different priorities. The method performs an explosion process utilizing linear programming and heuristics to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.

Abstract: The invention disclosed here is a method for achieving simultaneous consideration of multiple independent dates associated with a single demand. The method iterates through the demands to match the demands with the supply quantities respecting demand priorities which vary over time and demand quantities which may perish over time. One embodiment of the invention allocates demand to supply through an iterative process beginning with earlier demand requirement dates and concluding with later demands which may preempt supply from earlier demands depending upon their relative priorities. An additional embodiment transforms the demands to create multiple demand records, each having an associated priority, such that a single original demand record is transformed into a plurality of related demand records, each having an associated priority. The component supply quantities are accumulated into period ending inventories.