Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and system for sequencing and scheduling

An optimization method, algorithm technology, applied in the direction of instruments, etc.

Inactive Publication Date: 2007-10-31
NETAPS
View PDF0 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] However, current production sequencing systems require reconfiguration of their optimization techniques each time they are installed in a new manufacturing environment

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for sequencing and scheduling
  • Method and system for sequencing and scheduling
  • Method and system for sequencing and scheduling

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0067] Example 1: Converting Constraint Types

[0068] Example 1 is an exemplary conversion constraint type. The constraint is named COLOR-BW (color—black / white), and this term serves as a constraint identifier. The attribute package EXTERIOR-COLOR (external color) is applied to the attribute value BLACK (black) and the attribute value WHITE (white). The user-defined logic specifies that if a black car is produced, it cannot be followed by a white car. Assign a priority of 10 to this constraint. Priority can be used to imply that this constraint is more important than other constraints based on a user-defined size. A transition constraint is violated when black cars are produced immediately after white cars in sequencing or scheduling. Furthermore, it is contemplated that a flag is used to indicate that a constraint is active rather than disabled. Also, assign a value of 0 to the changeover time between cars in the production line.

example 2

[0069] Example 2: Types of Feature Capacity Constraints

[0070]Example 2 is an exemplary feature capacity constraint type. Applies the attribute package EXTERIOR-COLOR (external color) to the attribute value RED (red). Also, specify a minimum production volume of 0 and a maximum production volume of 1000. In this example, the position is for one week. Additionally, the constraint is assigned a priority of 5, indicating that the constraint has medium priority based on the user-defined size. The quantity type JOB-QUANTITY specifies the logic to use. Here, the logic specifies that a maximum of 1000 red cars can be produced in a week. Additionally, a penalty factor of 2 is assigned, which means that the larger the violation, the more severe the penalty.

example 3

[0071] Example 3: Allocation Constraint Types

[0072] Example 3 is an exemplary distribution constraint type. Given a constraint name DISTRIBUTE-MODEL (distribution - model), and apply the attribute package MODEL to all jobs, regardless of job attributes. This is indicated by marking the field "attribute value" blank. The quantity type JOB-QUANTITY specifies the user-defined logic to use. This logic specifies that jobs of all models should be evenly distributed. The fields "tolerance plus quantity" and "tolerance minus quantity" indicate that the job production must combine all specified tolerances and ensure high quality. The preprocess value specifies that a target value must be calculated. For certain constraint types (such as distributional constraint types), the occurrence and extent of constraint violations are determined by comparing observed values ​​in ordering and scheduling with target values. Preprocessing is the process of automatically calculating target va...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A method and system as well as a computer program product for generating an optimized production sequence and schedule is provided. The method includes generation of a job object, a constraint object, a slot object and a parameters object that are used to generate the optimized production sequence and schedule. The system includes a configurable layer that stores the objects and a core product layer that generates the optimized sequence and schedule using the objects generated. The system may be used in conjuction with a variety of known optimization methodologies.

Description

technical field [0001] The present invention proposes a method and system for production sequencing and production scheduling, in particular a method and system for generating optimal sequencing and scheduling of a group of jobs under a given definition of production capacity and a set of constraints. Background technique [0002] Production lines are used in manufacturing plants when products must be produced in strict order. However, due to the many constraints of manufacturing and the market, and usually needing to keep pace with the dynamic manufacturing environment, how to achieve efficient sequencing among the various units produced on the production line is a complex task. [0003] In order for production to run at an optimal level in the production line, production scheduling must take into account the definition of the capacity of the line and the constraints affecting it. Common constraints include resource constraints such as labor and raw material shortages and ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06Q10/00
CPCG06Q10/00
Inventor 斯瑞尼瓦司·那查甘地布莱德·拜恩斯艾夏克·艾拉米利
Owner NETAPS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com