EP2828807A2 - Programmation d'entretien - Google Patents

Programmation d'entretien

Info

Publication number
EP2828807A2
EP2828807A2 EP13716079.2A EP13716079A EP2828807A2 EP 2828807 A2 EP2828807 A2 EP 2828807A2 EP 13716079 A EP13716079 A EP 13716079A EP 2828807 A2 EP2828807 A2 EP 2828807A2
Authority
EP
European Patent Office
Prior art keywords
maintenance
motor vehicle
condition
program
int1
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP13716079.2A
Other languages
German (de)
English (en)
Inventor
Tony Lindgren
Anna Pernestål
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Scania CV AB
Original Assignee
Scania CV AB
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Scania CV AB filed Critical Scania CV AB
Publication of EP2828807A2 publication Critical patent/EP2828807A2/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/20—Administration of product repair or maintenance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C5/00—Registering or indicating the working of vehicles
    • G07C5/006—Indicating maintenance

Definitions

  • the present invention relates generally to scheduli ng of mai ntenance for motor vehicles. More particularly the invention relates to a planning entity according to the preamble of claim 1 . The invention also relates to a method according to the preamble of claim 1 1 , a computer program accordi ng to claim 1 9 and a computer program product accordi ng to claim 20.
  • US 2003/00655771 reveals a method for creati ng a maintenance algorithm for a fleet of vehicles.
  • mai ntenance information can be collected and displayed in each vehicle of the fleet.
  • sensor data that are indicative of a stress on components in the vehicles are used to derive stress variables.
  • the ascertained stress variables are stored in the vehicles for a predetermined period and , if a wear-related event occu rs, wear variables that characterize a wear-related event are additionally ascertained .
  • the stress variables and the wear variables are transmitted to a central location or station , in which the previous maintenance algorithm is checked with the use of the stress and wear variables, and , if applicable, an improved mai ntenance algorithm can be derived .
  • the mai ntenance algorith m serves in establishing and indicating a time when the vehicle should be serviced.
  • US 2006/01 361 05 describes a solution wherein vehicle telematics is employed to improve maintenance scheduling .
  • vehicle condition information is collected from diverse sou rces, which include real time data collected from vehicle sensors over an intelligent vehicle controller area network.
  • the network is provided with facilities for generati ng records with stamps allowing their correlation with vehicle inspection results and the generation of trend reports to be used in scheduli ng maintenance.
  • US 2008/0269977 discloses a system, wherein user generated service rules operate upon selected vehicle operati ng variables, vehicle configurations and vehicle vocations to produce estimates of the service life of diverse, routine service items. Items with correspondi ng projected service lives are then g rouped for service to reduce overall service frequency.
  • the object of the present invention is therefore to provide a solution, which offers maintenance scheduling with improved flexibility in terms of the users' requirements, for instance regarding vehicle availability and environ mental issues.
  • the object is achieved by the initially described planning entity, wherein the planning entity includes a second input interface configured to receive a client request containing at least one parameter specifying infor- mation relating to a desired maintenance strategy for the motor vehicle, which information is uncorrelated to the utilization data.
  • the main processing module is configured to generate the maintenance program on the fu rther basis of the client request.
  • the at least one parameter of the client request may specify a desired upti me for the motor vehicle between two consecutive visits to the workshop and/or a maximally allowed environ mental influence caused by the motor vehicle between two consecutive visits to the workshop.
  • the main processing module is configured to derive at least one boundary condition from the client request, and implement an iterative optimizing algorith m with respect to a target fu nction.
  • the main processing module is further configured to maxi mize the target function while fulfilling the at least one boundary condition, and thus return a valid solution to an opti mization prob- lem. Then , based on this solution , the main processing module is configu red to generate the maintenance program. Consequently, the maintenance prog ram is produced very efficiently while considering highly diverse criteria.
  • the optimizing algorith m is an Anytime algorithm arranged to retu rn a valid solution at each iteration completed by the optimizing algorith m.
  • the maintenance prog ram may be i mproved by allowi ng the algorith m to ru n th roug h many iterations.
  • an acceptable maintenance prog ram can be produced in each iteration .
  • the Anyti me algorith m is arranged to, at each iteration completed by the optimizing algorithm, retu rn the best solution so far.
  • the planning entity includes an auxiliary processing mo- dule configured to derive a respective maintenance interval for at least one maintenance instance in respect of the motor vehicle.
  • the maintenance program describes recom mended visits to a workshop, and is preferably based on the at least one maintenance interval.
  • the utilization data, in tu rn contains a predefined set of condition factors. Using condition factors is advantageous because these factors render it possible to weigh in various aspects of the use.
  • the auxiliary processing module may be configu red to compute the at least one maintenance interval on the further basis of at least one weight factor associated to each condition factor in the predefined set of condition factors.
  • Each weig ht factor reflects how the condition factor to which it is associated influences the wear of at least one component being the subject of a given maintenance instance. Thereby, very hig h precision can be attained in how the condition factors influence the maintenance intervals for the individual components of the motor vehicle.
  • the at least one maintenance interval may be expressed in terms of an operating time for the motor vehicle and/ or a distance d riven by the motor vehicle.
  • the auxiliary processing module is configured to compute the at least one maintenance interval based on the condition factors such that the maintenance interval is either decreased or increased from a nomi nal value depending on whether the data reflected by a particular condition factor is expected to intensify or reduce the wear of a component being the subject of the maintenance instance.
  • the maintenance prog ram can be made especially relevant for each vehicle.
  • the auxiliary processi ng module is configu red to compute the at least one mai ntenance interval on the further basis of the at least one weight factor, such that the influence of a particular condition factor on a given maintenance instance is either raised or lowered depending on whether the condition factor is deemed to be relatively i mportant or relatively u ni mportant for the wear of the component being the subject of the maintenance instance.
  • condition factors express : a weight of the motor vehicle, a d river's d riving behavior, topog raphic data, traffic conditions, road conditions and/or climate conditions in an environ- ment where the motor vehicle has been operated du ri ng the data collection period .
  • the object is achieved by the method described initially, wherein a client request is received that contains at least one parameter specifying information relating to a desired maintenance strategy for the motor vehicle, which information is uncorrelated to the utilization data.
  • the maintenance prog ram is then generated on the fu rther basis of the client request.
  • Figure 1 shows a block diagram over a planning entity according to one embodiment of the invention
  • Figure 2 exemplifies a maintenance plan according to one embodiment of the invention
  • Figure 3 shows a block diagram over an auxiliary processing module according to one embodiment of the invention
  • Figure 4 shows a flow diagram illustrating the general method according to the invention.
  • the planning entity includes first and second input interfaces 110 and 112 respectively, a main processing module 130 and an output interface 114.
  • an auxiliary processing module 120 is also included.
  • the first input interface 110 is configured to receive utilization data UD representing how the motor vehicle has been used du- ring a data collection period (representing any defined interval, say 24 hou rs to six months) .
  • the data collection period may be relatively short or relatively long depending what is deemed to be appropriate with regard to the vehicle and its expec- ted usage.
  • the second input interface 1 1 2 is configu red to receive a client request C R containing at least one parameter specifying information relating to a desired maintenance strategy for the motor vehicle, which information is uncorrelated to the utilization data U D.
  • the client request C R may for example contai n parameters specifying a desi red uptime for the motor vehicle between two consecutive visits to the workshop, and/or a maximally allowed envi ronmental influence caused by the motor vehicle between two consecutive visits to the workshop.
  • said requests may involve contradictory constraints because prolonging the interval between consecutive workshop visits generally increases the vehicle's environmental influence.
  • the main processing module 1 30 is configured to generate a maintenance program M P describing recommended visits to a workshop in terms of a series of ti me instances T1 , T2, Ty (see Figu re 2) to each of which is associated a set of maintenance instances M M , M I2, M l n to be executed at that time instance T1 , T2, Ty.
  • the main processing module 1 30 generates the mai ntenance program M P based on the utilization data U D and the client request C R.
  • the mai n processing module 1 30 is configured to derive at least one boundary condition from the client request C R.
  • the main processing module 1 30 is configu red to derive at least one boundary condition from the utilization data U D.
  • the main processing module 1 30 is configu red to implement an iterative optimizing algorith m with respect to a target fu nction, which is to be maximized while fulfilling said boundary conditions.
  • the main processi ng module 1 30 retu rns a va- lid solution to an optimization problem.
  • the main processing module 1 30 generates the maintenance program M P.
  • the maintenance prog ram M P has the general structu re illustrated in Figu re 2, i.e. represents a matrix that for each maintenance instance M M , M I2, M l n specifies ti me instances T1 , T2, Ty (say particular weeks) when the maintenance instance shall be handled at a workshop.
  • the optimizing algorithm implemented by the main processing module 1 30 is an Anytime algorith m that is arranged to return a valid solution at each iteration completed by the optimizing algorith m. Moreover, this algorith m is preferably arranged to, at each completed iteration ; return the best solution so far. Consequently, a fully acceptable maintenance program M P can normally be obtained very quickly. However, a better maintenance program M P can be expected if the algorith m is allowed to ru n through many iterations.
  • the utilization data U D contains a predefined set of condition factors d 1 , d2, dx.
  • condition factors d 1 , d2, dx may here express the actual weig ht of the motor vehicle during the data collection period ; or if the weight has varied , respective actual weights of the motor vehicle du ring each of a number of intervals within this period (preferably factored by the relative du ration of each interval) .
  • condition factors d 1 , d2, dx may also express a d river's d riving behavior during the data collection period , topog raphic data, traffic condi- tions, road conditions and/or climate conditions reflecting an environment wherein the motor vehicle has been operated during the data collection period.
  • the data collection period may have any extension in time suitable for the i mplementation, for example as indicated above.
  • the auxiliary processing module 1 20 is configured to derive a respective maintenance interval M-INT1, M-INT2, M-INTn for at least one maintenance instance MM, MI2, Mln of the motor vehicle.
  • the maintenance intervals M-INT1, M-INT2, M-INTn may be arranged in a listing 150, which is fed to the main processing module 130.
  • a maintenance interval M-INT for a maintenance instance MM is the time between two consecutive maintenance occasions for a component in the motor vehicle.
  • a first maintenance interval M-INT1 reflects the in- terval from installing a new oil filter until this filter must be replaced.
  • a processor 320 of the auxiliary processing module 120 is configured to derive the maintenance intervals M-INT1, M-INT2, M-INTn based on the utilization data UD, preferably by compu- ting the maintenance intervals M-INT1, M-INT2, M-INTn based on the condition factors d1, d2, dx and at least one weight factor w1 , w2, wx associated to each condition factor in the predefined set of condition factors d1, d2, dx.
  • the weight factors w1, w2, wx may be stored in a data storage 340 accessible by the processor 320.
  • Each weight factor reflects how the condition factor to which it is associated influences the wear of at least one component being the subject of a given maintenance instance MM, MI2, Mln.
  • the maintenance in- terval M-INT1, M-INT2, M-INTn is expressed in terms of an operating time and/or a distance driven by the motor vehicle.
  • the processor 320 is further preferably configured to compute the maintenance interval M-INT1, M-INT2, M-INTn based on the condition factors d1, d2, dx, such that the maintenance interval M-INT1, M-INT2, M-INTn is either decreased/shortened or increased/prolonged from a nominal value depending on whether the data reflected by a particular condition factor is expected to intensify or reduce the wear of a component being the subject of the maintenance instance MM, MI2, Mln.
  • the respective correlations between the condition factors d1, d2, dx and the maintenance intervals M-INT1, M- INT2, M-INTn are assigned manually by an expert who en- ters his/her knowledge into a computer program comprising software for controlling the processor 320.
  • the processor 320 is configured to compute each maintenance interval M-INT1, M-INT2, M-INTn on the further basis of the at least one weight factor w1 , w2, wx, such that the influence of a particular condition factor d1, d2, dx on a given maintenance instance MM, MI2, Mln is either raised or lowered depending on whether the condition factor is deemed to be relatively important or relatively unimportant for the wear of the component being the subject of the maintenance instance MM, MI2, Mln.
  • the weight factors w1 , w2, wx may be assigned manually by an expert in the form of parameters in a computer program for controlling the processor 320.
  • the expert assigns the weight factors w1 , w2, wx based on empirical knowledge about relationships between the condition factors d1, d2, dx and the maintenance instances MM, MI2, Mln.
  • each maintenance interval M-INT1, M-INT2, M- INTn is associated with a minimal value and a maximal value.
  • the minimal value represents a value below the nominal value for the maintenance interval M-INT1, M-INT2, M-INTn, and correspondingly, the maximal value represents a value above the nominal value.
  • the minimal and maximal values express a shortest and a longest recommended interval respectively bet- ween two consecutive visits to the workshop in the maintenance program MP. I.e. the minimal and maximal values may be expressed in terms of driving distance and/or operating time for the motor vehicle.
  • the minimal and maximal values may be used as fol- lows. If, based on the condition factors d1, d2, dx and weight factors w1, w2, wx, a given maintenance interval M-INT1, M- INT2, M-INTn is computed to a value below the minimal value, the processor 320 is configured to assign the maintenance interval M-INT1, M-INT2, M-INTn to the minimal value.
  • the processor 320 is configured to assign the maintenance interval M-INT1, M-INT2, M-INTn to the maximal value.
  • the mainte- nance program MP will contain reasonable maintenance intervals.
  • the first input interface 110 is connected to at least one communication network, which, in turn, has at least one wireless interface towards the motor vehicle.
  • the input interface 110 is further configured to collect the utilization data UD via the at least one wireless interface. Consequently, utilization data UD in respect to a large number of vehicles may be fed into the auxiliary processing module 120 in very convenient manner.
  • the second input interface 112 is connected to at least one communication network, which, in turn, has at least one interface, preferably wireless, towards the motor vehicle, such that the second input interface 112 can collect the client requests CR via the at least one interface.
  • the above procedure implemented by the planning entity 100 is preferably controlled by a computer program loaded into a memory 160 of the planning entity 100, or an external memory unit accessible by the planning entity 100 (not shown).
  • the computer program in turn, contains software for controlling the steps of the procedure when the program is run on the processing modules 120 and 130 of the planning entity 100.
  • a step 410 it is checked whether utilization data have been received, which utilization data represent how the motor vehicle has been used during a data collection period; and if so, a step 420 follows. Otherwise, the procedure loops back and stays in step 410.
  • step 420 it is checked whether a client request has been received , which client request contains at least one parameter specifying information relati ng to a desired maintenance strategy for the motor vehicle, which information is u ncorrelated to the utilization data; and if so, a step 430 follows. Otherwise, the procedure loops back and stays in step 420.
  • step 430 a mai ntenance prog ram is generated, which describes recommended visits to a workshop in terms of a series of ti me instances to each of which is associated a set of mai nte- nance instances to execute at the respective time i nstance.
  • the maintenance program is generated based on the utilization data and the client request. Subsequently, the proceedu re ends.
  • the process steps, as well as any sub-sequence of steps, described with reference to the figure 4 above may be controlled by means of a programmed computer apparatus.
  • the embodiments of the invention described above with reference to the drawings comprise computer apparatus and processes performed in computer apparatus, the invention thus also extends to computer programs, particularly computer programs on or in a carrier, adapted for putting the invention into practice.
  • the program may be in the form of source code ; object code, a code intermediate source and object code such as in partially compiled form, or in any other form suitable for use in the implementation of the process according to the invention.
  • the carrier may be any entity or device capable of carrying the program.
  • the carrier may comprise a storage medium, such as a Flash memory, a ROM (Read Only Memory), for example a C D (Compact Disc) or a semiconductor ROM, an EP ROM (Erasable Programmable Read-Only Memory) , an E EPROM (Electrically Erasable Programmable Read-Only Memory), or a magnetic recording medium, for example a floppy disc or hard disc.
  • the carrier may be a transmissible carrier such as an electrical or optical signal, which may be conveyed via electrical or optical cable or by radio or by other means.
  • the carrier may be constituted by such cable or device or means.
  • the carrier may be an integrated circuit in which the program is embedded, the integrated circuit being adapted for performing, or for use in the performance of, the relevant processes.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Vehicle Cleaning, Maintenance, Repair, Refitting, And Outriggers (AREA)
  • Multi-Process Working Machines And Systems (AREA)

Abstract

L'invention concerne une entité de planification (100) conçue pour programmer les visites d'entretien d'un véhicule à moteur à un atelier, comprenant : une première et une deuxième interface d'entrée (110, 112), un module de traitement principal (130) et une interface de sortie (114). La première interface d'entrée (110) reçoit des données d'utilisation (UD) qui représentent la manière dont le véhicule à moteur a été utilisé pendant une période de collecte de données. La deuxième interface d'entrée (112) reçoit une demande de client(CR) contenant au moins une information avec spécification de paramètre concernant une stratégie d'entretien souhaitée pour le véhicule à moteur, cette information n'étant pas corrélée avec les données d'utilisation (UD). En fonction des données d'utilisation (UD) et de la demande de client (CR), le module de traitement principal (130) génère un programme d'entretien (MP) qui est présenté par l'intermédiaire de l'interface de sortie (114). Ce programme d'entretien (MP) décrit des visites recommandées à un atelier sous la forme d'une série de périodes (T1, T2, …, Ty) auxquelles est respectivement associé un ensemble d'actions d'entretien (MI1, MI2, …, MIn) à exécuter lors desdites périodes (T1, T2, …, Ty).
EP13716079.2A 2012-03-20 2013-03-19 Programmation d'entretien Withdrawn EP2828807A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SE1250270 2012-03-20
PCT/SE2013/050296 WO2013141797A2 (fr) 2012-03-20 2013-03-19 Programmation d'entretien

Publications (1)

Publication Number Publication Date
EP2828807A2 true EP2828807A2 (fr) 2015-01-28

Family

ID=48093064

Family Applications (1)

Application Number Title Priority Date Filing Date
EP13716079.2A Withdrawn EP2828807A2 (fr) 2012-03-20 2013-03-19 Programmation d'entretien

Country Status (2)

Country Link
EP (1) EP2828807A2 (fr)
WO (1) WO2013141797A2 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107729473A (zh) * 2017-10-13 2018-02-23 东软集团股份有限公司 文章推荐方法及其装置
CN107831745A (zh) * 2017-11-09 2018-03-23 西南交通大学 一种柔性作业车间插单动态调度优化方法

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11900330B1 (en) * 2019-10-18 2024-02-13 State Farm Mutual Automobile Insurance Company Vehicle telematics systems and methods
EP3872721A1 (fr) * 2020-02-26 2021-09-01 Siemens Aktiengesellschaft Procédés et systèmes d'optimisation de l'entretien de machines industrielles

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10148214C2 (de) * 2001-09-28 2003-07-31 Daimler Chrysler Ag Verfahren zur Bereitstellung eines Wartungsalgorithmus
US20060136105A1 (en) * 2004-12-17 2006-06-22 Larson Gerald L Interactive data exchange system for vehicle maintenance scheduling and up-time optimization
US7706938B2 (en) * 2007-04-30 2010-04-27 International Truck Intellectual Property Company, Llc Automated synchronized service intervals for vehicles

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2013141797A2 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107729473A (zh) * 2017-10-13 2018-02-23 东软集团股份有限公司 文章推荐方法及其装置
CN107831745A (zh) * 2017-11-09 2018-03-23 西南交通大学 一种柔性作业车间插单动态调度优化方法
CN107831745B (zh) * 2017-11-09 2019-06-07 西南交通大学 一种柔性作业车间插单动态调度优化方法

Also Published As

Publication number Publication date
WO2013141797A2 (fr) 2013-09-26
WO2013141797A3 (fr) 2013-11-14

Similar Documents

Publication Publication Date Title
US8560368B1 (en) Automated constraint-based scheduling using condition-based maintenance
US7706938B2 (en) Automated synchronized service intervals for vehicles
US20170169399A1 (en) System and method for vehicle pricing
US20070150332A1 (en) Heuristic supply chain modeling method and system
WO2013141797A2 (fr) Programmation d'entretien
US20070203810A1 (en) Supply chain modeling method and system
US20200074411A1 (en) Fleet management system and method
US20070192160A1 (en) Plan solver
US8494823B2 (en) Method and system for determining service area of supply chain by simulating service cycle time
EP3825966A1 (fr) Système et procédé de surveillance et de prédiction de pannes dans des véhicules
JP2013122761A (ja) ライフサイクル陳腐化予測ツール
US20090018671A1 (en) Method and system for process control
JP2007199844A (ja) 部品需要予測プログラム、部品需要予測方法、及びこの方法を実行するシステム
US20070129992A1 (en) Re-optimization technique for use with an automated supply chain optimizer
JP5260315B2 (ja) 半導体ロットをディスパッチするシステムおよび方法
CN108205714A (zh) 基于平均故障间隔时间的服务备件需求预测方法和装置
JP7032557B2 (ja) プロセス異常を修復するための方法
US11157883B2 (en) Step analysis process steps within a fleet performance optimization tool
US8170743B2 (en) Integrated diagnosis and prognosis system as part of the corporate value chain
EP2828808A1 (fr) Programmation d'entretien
US20220083950A1 (en) System and method for skilled marketplace scheduling
Prasetyaningsih et al. Production and Delivery Batch Scheduling with Multiple Due Dates to Minimize Total Cost.
KR20230049125A (ko) 보수 지원 시스템
WO2013141798A1 (fr) Planification d'une procédure en atelier
AU2014348681A1 (en) Automated computer controlled system for measuring the consumption of printer resources and transacting environmental offsets

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20141020

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20150512