首页 > 其他分享 >how to repair JCB HP 2010 machine DTC U0411 flash code 87

how to repair JCB HP 2010 machine DTC U0411 flash code 87

时间:2022-10-05 23:55:48浏览次数:80  
标签:engine repair code ISUZU DTC ignition trouble

 

This instruction show you guide on how to repair JCB HP 2010 machine DTC U0411 flash code 87 turbocharger control module signal malfunction with ISUZU 4HK1 INT-Tier 4 engine.

 

Preparations:

ISUZU E-IDSS 2022 2019 Engine Diagnostic Service System Free Download

ISUZU IDSS Diagnostic Tool

 

Procedures:

1.Inspect the CAN circuit between the turbo control unit and the ECM.

There should be no short to the battery or ignition power supply. ・There should be no open circuit or high resistance. ・There should be no short to GND.

2.If a problem is found, repair the CAN circuit.

3.Inspect the turbo control unit harness connector for a poor connection.

4.If a problem is found, repair the harness connector.

5.Connect all harnesses.

6.Clear the DTC using the trouble diagnosis scan tool.

7.Turn OFF the ignition switch for at least 30 seconds.

8Start the engine.

9.Perform a test-run.

10.Check the DTC.

11.If a DTC has been detected, replace the turbocharger assembly.

12.Connect all harnesses.

13.Clear the DTC using the trouble diagnosis scan tool.

14.Turn OFF the ignition switch for at least 30 seconds.

15.Start the engine.

16.Perform a test-run.

17.Check the DTC.

18.If a DTC has been detected, replace the ECM.

19.Set the Injector ID Code and engine No. on the ECM.

20.Perform the unit difference learning of the fuel supply pump to the ECM.

 

U0411 Confirm Resolution

1.Clear the DTC using the trouble diagnosis scan tool.

2.Turn OFF the ignition switch for at least 30 seconds.

3.Start the engine.

4.Perform a test-run.

5.Use the trouble diagnosis scan tool to confirm that a DTC has not been detected.

More repair cases for ISUZU engine,please refer to:ISUZU Engine Trouble Repair

标签:engine,repair,code,ISUZU,DTC,ignition,trouble
From: https://www.cnblogs.com/charlesbeb56/p/16756809.html

相关文章

  • Codeforces Round #824 (Div. 2)(持续更新)
    Preface现在先把之前打掉的题目先写了,不然时间一长又忘记了这场不知道为什么打的极其抽象,A都能写WA而且C一个细节写挂调了好久,最后30min才做出D,罚时起飞连着两场掉分了,......
  • LeetCode 15 - 并查集
    所谓并查集,是指支持集合的合并和查询操作的数据结构。合并:将两个集合合并为一个。查询:查询某个元素属于哪个集合,通常是返回集合内的一个代表元素(例如二叉树的所有结点可......
  • Educational Codeforces Round 32 G Xor tree Boruvka算法
    求一个n个点的完全图每条边的权值为两点之间的异或值求最小生成树。在完全图上做最小生成树一般都是Boruvka算法即每次每个点都找一个离自己最近的点合并这样最多合并lo......
  • Codeforces Beta Round #87 (Div. 1 Only) A. Party(树的深度+dfs)
    https://codeforces.com/contest/115/problem/A题目大意:给定n个节点,每个节点都有一个不同于自己的数值,表示自己的老板,-1表示自己就是老板。现在玩游戏需要组队,一组队......
  • 【教奶奶学SQL】(task6)秋招秘籍A(leetcode刷题)
    学习总结(1)敲黑板:练习第六题再看看,还欠最后1题困难题。(2)​​​猴子题解电子书​​文章目录​​学习总结​​​​练习一:各部门工资最高的员工(leetcode184难度:中等)​​​​......
  • Codeforces Round #824 (Div. 2) C - Phase Shift
    (有点难以描述的)题意:给出一串字母,为每一个字母找一个映射,要求:1)所有的映射连起来形成一个且只有一个环;2)这个环内包含26个字母;3)映射后形成的新字符串字典序最小。解:随便找两......
  • Codeforces Round #321 (Div. 2) C. Kefa and Park(树+dfs)
    https://codeforces.com/contest/580/problem/C题目大意:给定一棵树,这棵树总共有n个节点,自己家住在节点1(根节点);每个节点都有一个标记a[i],标记为1就是这个地方有猫,0就表......
  • 1.Infrastructure as Code (IaC)
    Infrastructure通常指的是application运行所依赖的底层的基础设施和它们的配置.这里的基础设施通常是指物理层之上的部分,并不是一个物理设备,一块硬盘,而是一个虚拟机,一......
  • 【code基础】 回溯算法
    回溯算法也叫回溯搜索法,其本质是穷举,也可以加上剪枝操作进行优化回溯是递归的副产品,只要有递归就存在回溯的思想回溯算法可以抽象为树形结构回溯法解决如下问题:组合......
  • Codeforces 1660 D
    我是蒟蒻!我是蒟蒻!我是蒟蒻!重要的事情说三遍!传送门传送门点这儿!$\color{white}{哈哈哈!你被骗了!}$$\color{white}{真传送门在上面的感叹号!}$思路嗯?一片空白?最......