MD04 overview tree problem

Hi SAP experts i hope you can help me on something, i need to know the requirements for the Overview tree to work with my materials, i have a group order that i would like to view in the overview tree but i can only see the FERT material, i cant see the other two HALBs, i hope you can help me out, if you need more info please tell me.

German ,
It does not matter if your MRP type is M0 or PD. You should be able to see the entire Order structure if you have the MRP  element (planned order/ production order ) for that material. 
If there is no such MRP element either due to no requirement ( sale order /dependent requiremnt) or Excess Stock (stock more than requirements) then you cannot see the Order Tree in the Overview screen. The Order tree will display only if there is a order( plan or production).
Hope this explains your issue. If you have further questions please come back.
Thanks,
Ram

Similar Messages

  • MD04 Overview Tree

    Dear Gurus,
    I have a stock transfer scenario in my project.My problem is in MD04 overview tree I see all the bom items of stock transfer components of  issuing plant.Please tell is this standard and how we will restrict to users in receiving Plant.I have given authorizaton for the T-Code in receiveing plant but still by mistake user can change the MRP element of issuing Plant in MD04.Is there any setting so that the MRP element of issuing plant in receiving plant will be kept for display only.Means the MRP element cannot b converted to prod order or purchase order in reciving plant.Hope u get my question.Waiting for ur reply.
    Kind Regards.
    Srajane

    Hi,
    You have to maintain roles for creating/changing each MRP element on the basis of plant or order type whichever parameter possible. Do not think of restricting in t-code MD04, but organize authorities for each MRP element one by one and create different roles for the people in different plants.
    Regards.

  • MD04 Overview tree issue question

    Good evening,
    I have an issue where my overtree in MD04 is going a bit funny.
    I explode the selected order and it displays all the lower level (as you would expect) but for the Semi Fin (sub assembly) I am get 2 or 3 entries for the Semi Fin items!!
    Can anyone tell me why this is happening or how I can correct it?
    Kind regards

    Hi,
    Please check stock requirement list of the semi-finished( sub-assembly) itself.
    Check how many dependent requirements are generated which are pegged for the finished good which is in question, if there are multiple dependent requirement for the same finished good, then you are expected to see as many number of segments for the SFG in order tree report.
    Best Regards.

  • Md04 not showing Overview tree

    In my case  MD04 is not showing the overview tree.
    First case
    For material x if i put Plant  and MRP area same then its not showing the overview tree.
    Second case
    When i put MRP area (as per configuration ) and plant in this case it is showing the overview tree.
    please suggest.

    Dear Amit,
    system is giving correct results,
    if your order will show the tree in which mrp area it is.
    now suppose you dont put any MRP area in the intial screen and put plant only. then system will consider that plant same as mrp area.
    now if you put the the MRP area and the respective plant.
    orders in that MRP area will be shown. and order is is only shown when there is pegged ordes to that order.
    in your case there may not be dependant orders.
    and you cant see the same orders in 2 cases you told.

  • MD04/ MD4C-Overview Tree

    HI,
    Client has a requirement which goes as: There are BOMs with BOM usages 1,5 & R (R is copied from 1, used for lower components). Now in MD04/ MD4C, when we navigate to the Overview Tree, the client wants that only those users, can see the components (which have BOM usage R), who have the authorization for BOM usage R. The authorization object is there but it only restricts the users from change/ display of BOM.
    How to make the lower components with usage R not visible for users not authorized to use BOM with usage R in MD04/ MD4C?
    Please advice.
    Thanks.

    Hello
    On the standard system, this is not possible. Transaction MD4C is builded based on the planned order dependent requirements (table RESB), not on the BOM itself. Therefore, there is no authority check for the BOM usage.
    BR
    Caetano

  • Document overview tree in ML81N is blank

    Hi All,
    User has reported an issue that the document overview tree in ML81N is blank. It is not showing any recent POs. Is there any setting through which this tree can be populated? Or this is related to some authorization issue?
    Thanks In advance.
    Soumya

    Click on the Switch display as below :

  • Clearing overview tree in Monitor

    Hi,
    I want to know how to clear overview tree in monitor . (Info package Load Monitor Screen)

    Hi Arshad,
    You cannot do that. What you can do is delete the request itself. In case the request is errored then goto RSA1 -> PSA -> find the request and delete.
    Bye
    Dinesh

  • Two iterators browsing the same data (a table and a tree) problem

    I have an ADF UIX application with a navigation tree and a central page with a table of the records of a Works view object.
    There is a hierarchical relationship of Works ->Subworks-> Tasks which is shown in the tree. In the central part of the page, there is a table of Works.
    I want
    1) the tree to show all the data, but only about 10 works at a time (using small arrows for scrolling up and down)
    2) the table to show only 10 or 20 records each time. Not the same with the tree.
    3) Both clicking on a link on the tree and selecting a work on the table will open the appropriate page.
    4) Opening the children of a node in the tree and clicking on the links being able to send me directly in the correct subwork or task page EVEN if I haven't visited the parent node (work) first.
    I cannot seem to be able to succed in the "even if" part of 4 and I can succeed in only any 2 of the first three.
    If the tree iterator and table iterator point to the same view object (work1 for example), it is impossible to show a different set of works in the tree and the table
    If I use different view objects, then, if the tree part is working, the table selection doesn't work. I imagined that's a problem with "SetCurrentRowWithIndex" and I tried to set up correctly a "SetCurrentRowWithKey" event, but I didn't know how to write the handler. (I use JHS event handling, by the way)
    I suppose the following has errors:
    <event name="setCurrentRowWithKey" source="GetaeergView1">
    <set target="${bindings.GetaeergView1Iterator}" property="currentRowKeyInRange" value="${ui:tableSelectedKey(uix, 'GetaeergView1')}"/>
    </event>
    Any suggestions?

    Noone has tried this again?

  • ALV Tree Problem with Checkboxes

    Hello,
    i've got a problem.
    I have an ALV-Tree and die ALV-Detaillist of the tree are type checkbox.
    That's working correct.
    But i want to fill initial data in the checkboxes but the checkbox isnt set.
    i've done as followed:
      CALL METHOD go_alv_tree->set_table_for_first_display
        EXPORTING
         I_STRUCTURE_NAME     =
         IS_VARIANT           =
         I_SAVE               =
          i_default            = abap_false
          is_hierarchy_header  = ls_header
         IS_EXCEPTION_FIELD   =
         IT_SPECIAL_GROUPS    =
         IT_LIST_COMMENTARY   =
         I_LOGO               =
         I_BACKGROUND_ID      =
         IT_TOOLBAR_EXCLUDING =
        CHANGING
          it_outtab            = <go_data_tab>
         IT_FILTER            =
          it_fieldcatalog      = lt_fcat.
    fieldcat are several fields all as checkbox.
    Then i get a component of the output structure and set a X.
    ASSIGN COMPONENT lv_help_arbpl OF STRUCTURE <go_data_struc>
                           TO <fs_arbl>.
          IF <fs_arbl> IS ASSIGNED.
            <fs_arbl> = lc_xfeld.
          ENDIF.
            CALL METHOD go_alv_tree->add_node
              EXPORTING
                i_relat_node_key     = lv_matnr
                i_relationship       = cl_gui_column_tree=>relat_last_child
                is_outtab_line       = <go_data_struc>
                is_node_layout       = ls_layout
             IT_ITEM_LAYOUT       =
                i_node_text          = lv_node_text
              IMPORTING
                e_new_node_key       = lv_period
              EXCEPTIONS
                relat_node_not_found = 1
                node_not_found       = 2
                OTHERS               = 3.
    in <go_data_struc> the fields which should be set, are set with X.
    But after i add all of my nodes and do CALL METHOD p_go_alv_tree->frontend_update, the checkbox is empty but there is an X in the field beside the checkbox.
    Thanks in advance.
    best regards,
    Dennis

    Ok i solved the problem.
    best regards,
    Dennis

  • J(Check)Tree Problems

    Hi,
    I'm using the JCheckTree from: http://www.fawcette.com/archives/premier/mgznarch/javapro/2001/01jan01/vc0101/vc0101.asp And have some problems with it, hopefull somebody can help me... (source on website)
    1:
    In a normal JTree when you dubbleclick on a folder it opens, when I dubbleclick on the JCheckTree nothing happens. I tried using: .setToggleClickCount(2) but that doesn't help. How can I solve this?
    2:
    In "BasicTreeCellRenderer.java" I use: setIcon(expanded ? UIManager.getIcon("FileView.fileIcon") : UIManager.getIcon("FileView.fileIcon"); to set the Icon for an item, it works. But when I click and select the item the icon is gone and the default Icon is there. When I deselect the Item the right icon is showed agian. How can I fix this?
    3:
    When I click on a folder al childs are automaticly selected, that's nice. I need that, but it will also be handy when I select all the child items manual the folder will be selected to. Or when I select a few child items the folder checked will be gray. (so the userS can see that items are selected when the folder is closed). How can I build this?
    4:
    With the option node.isSelected() I can check of the item is selected. How would it be possible to write a function that checks all the items if they are checked and but then in an array?
    Hopefully somebody can help me, or push me in the right direction.
    Thanks for your time and help!
    Greetings,
    Rene

    4:
    With the option I can check of the item is selected.
    How would it be possible to write a function
    that checks all the items if they are checked
    and but then in an array?I already found this one!    
        Enumeration enum = Tree.breadthFirstEnumeration();
        while (enum.hasMoreElements()) {
          CheckTreeNode node = (CheckTreeNode)enum.nextElement();
          if (node.isSelected()) {
             if (node.isLeaf()) {
                  // CODE
       }

  • Binary Tree Problem, help !!!!!!!

    Hi I have some Tree Traversal problem,
    my output has this problem,what's going on????
    Exception in thread "main" java.lang.NullPointerException
    at Tree.inTraversal2(Tree.java:150)
    at TreeTest.main(TreeTest.java:33)
    My Tree.java:
    class TreeNode {
       TreeNode leftNode;          
       TreeNode rightNode;
       int data;
       public TreeNode(int nodeData)
          data = nodeData;             
          leftNode = rightNode = null;
       public void insert(int value)
          if( value < data )
             if( leftNode == null )
                leftNode = new TreeNode(value);
             else
                leftNode.insert(value);
          else if ( value > data )
             if( rightNode == null )
                rightNode = new TreeNode(value);
             else
                rightNode.insert(value);
       }  //end method insert
    }  //end class TreeNode
    public class Tree {
       TreeNode root;
       Stack s;
       public Tree()
          root = null;
       public void insertNode(int value)
          if( root == null )
             root = new TreeNode(value);
          else
             root.insert(value);
       public void inTraversal2(TreeNode node)
             if( node == null )
             return;
         TreeNode p;
         p = node;
         do
                while(p != null)
                     s.push(p); //problem comes in here
                     p = p.leftNode;
                 if(!s.empty())
                     p = s.pop();
                     System.out.print( p.data + " " );
                     p = p.rightNode;
                   }while( (p != null) || (!s.empty()));
    }  //end class TreeMy Stack.java:
    public class Stack {
          TreeNode items[];
         int StackSize;
         int top;
        public Stack(int size)
             StackSize = size;
            items = new TreeNode[size];
            top = -1;
        public boolean empty()
             if(top == -1)
               return true;
            else
              return false;
        public boolean full()
             if(top == StackSize-1)
               return true;
             else
               return false;
        public void push(TreeNode c)
            if(full() == true)
               System.out.println("stack overflow");
            else
                items[++top] = c;
        public TreeNode pop()
             if(empty())
               System.out.println("stack underflow");
            return items[top--];
    }

    You don't seem to instantiate Stack anywhere.

  • Rapid Spanning Tree Problem

    Hi all,
    I am experiencing an RSTP problem. I have two swtitches connected via wireless link, the port is in trunk mode, the native vlan is vlan 1 the problem is that bpdu's are exchanged for other vlan's but not for vlan 1, when i connect a second backup wireless link it causes the loop, it seems that there are no bpdu exchanges between switches for vlan 1, also in trunk ports i see that BPDU's for vlan 1 are sent by both switches but they do not receive any BPDU's from each other. Any explanation about thiss issue ?
    Thanks in advance

    I would need to know some things to troubleshoot this:
    1. Is VLAN 1 the native VLAN of the trunk, on both sides?
    2. I presume VLAN 1 is in the allowed VLANs list on both sides of the link?
    3. If the native VLAN is not 1, is the native VLAN allowed on the trunk, on both sides?
    4. What model of switch is it, and what version of the software?
    5. Can you do a show run int for each end of each trunk link?
    6. Can you do a show int xxx trunk for each end of each trunk link?
    7. Can you do a show spanning-tree vlan 1 on each side of each trunk?
    Kevin Dorrell
    Luxembourg

  • Navigation Tree Problem

    Hi,
    I am having trouble creating the tree menu with xMII 11.5.1's navigation function.  Even though it is not a problem to create the menu structure there seems to be am problem showing it in the browser.  While the 'parent' links are shown properly (with a plus to click on) the 'children' will not appear on click.  Any idea what the problem might be?
    BR
    Paul

    Sounds like you're using firefox..?  Do you see a JavaScript error at the bottom of the page?
    Anyway if you update to a newer version of v11.5, latest is 11.5.4, this problem should go away.
    Sam

  • Huge tree problem

    Hello,
    I want to store huge amount of combinations in memory. For each combination I want to store an integer value.
    A combination looks like: 2,4,3,8. For this combination I build a tree composed of nodes: 2, 4, 3, 8. Then for node 8, I set the int value to be 1. if the same combination is encountered again, the in value will be incremented to 2.
    I can also get the combination: 2,4,3. Then the int value of node "3" will be incremented to 1. The combinations are randomally generated, but they have limited length. For example, I know in advance that I can get combinations:
    3 * 4 * 2 * 20 * 12. Then, I know that the first number in the sequaence will be between 1-3, the second between 1-4 and so on ... Valid combinations are can be either all the sequence or a part of it. For example:
    - 1
    - 1,3
    - 1,3,2,19,10
    all are valid combinations that can be excepted.
    As was mentioned before, for each received combination an integer value of the last node in the sequence is incremented.
    My problem is that I need to store this entire tree in memory, and I expect it to be very big.
    I there some algorithm for dealing with huge trees allowing it to be compressed or arranged in a manner that will reduce size and efficiency of the tree ??

    I wrote you an encoder and a decoder, that will convert an array of answers to questions to an integer and back. This will let you eliminate the overhead of a tree encodeing. (I rather arbitrarily wired the shape to be {2,3,5} so Q1 has two possible answers, namely 0 and 1, Q2 has 3 answers, 0,1,2 etc.)
    They can be used to help in several of the schemes that have already been mentioned.
    I would mention one other, just a varient on the last one, use byte[] rather than short. Then you are only burning a single byte for each unused combination. When a byte hits 255, you add a pair (encodeValue, fullCount) into a list. Which you can grovel over however you choose.
      public static class ED{
        int[] shape = {2,3,5};
        void decode(int[] a, int n){
          int base = 1;
          for(int i=0; i<shape.length; i++){
            if(n < 0) {
              a[i] = -1;
            } else {
              a[i] = n%shape;
    n = n/shape[i] -1;
    int encode(int[] a){
    int result = 0;
    for(int i = shape.length-1; i>-1; i--){
    if(a[i] >= 0){
    result += a[i];
    if(i>0)result = (result+1)*shape[i-1];
    return result;
    void printArray(int[] a){
    System.out.print("[");
    for(int i=0;i<a.length; i++){
    System.out.print(a[i]);
    if(i<a.length-1) System.out.print(", ");
    System.out.print("]");
    void test(int n){
    int[] a = new int[3];
    for(int i=0; i<n; i++){
    System.out.print(i + " - ");
    decode(a,i);
    printArray(a);
    System.out.print(" - " + encode(a));
    System.out.println();
    public static void main(String args[]){
    ED ed = new ED();
    ed.test(42);
    Sample of test output to show that the encoding and decoding works as expected.
    0 - [0, -1, -1] - 0
    1 - [1, -1, -1] - 1
    2 - [0, 0, -1] - 2
    3 - [1, 0, -1] - 3
    4 - [0, 1, -1] - 4
    5 - [1, 1, -1] - 5
    6 - [0, 2, -1] - 6
    7 - [1, 2, -1] - 7
    8 - [0, 0, 0] - 8
    9 - [1, 0, 0] - 9
    10 - [0, 1, 0] - 10
    11 - [1, 1, 0] - 11
    12 - [0, 2, 0] - 12
    13 - [1, 2, 0] - 13
    14 - [0, 0, 1] - 14
    15 - [1, 0, 1] - 15
    16 - [0, 1, 1] - 16
    17 - [1, 1, 1] - 17
    18 - [0, 2, 1] - 18
    19 - [1, 2, 1] - 19
    20 - [0, 0, 2] - 20
    21 - [1, 0, 2] - 21
    22 - [0, 1, 2] - 22
    23 - [1, 1, 2] - 23
    24 - [0, 2, 2] - 24
    25 - [1, 2, 2] - 25
    26 - [0, 0, 3] - 26
    27 - [1, 0, 3] - 27
    28 - [0, 1, 3] - 28
    29 - [1, 1, 3] - 29
    30 - [0, 2, 3] - 30
    31 - [1, 2, 3] - 31
    32 - [0, 0, 4] - 32
    33 - [1, 0, 4] - 33
    34 - [0, 1, 4] - 34
    35 - [1, 1, 4] - 35
    36 - [0, 2, 4] - 36
    37 - [1, 2, 4] - 37

  • B-tree problem, won't start

    I have a 1.42Ghz mini that is running 10.4.11. I recently installed garageband and the mini started running slower and crashing allot. I booted off the original installation disk and ran the disk utility. It did not find a problem with the disk. I did repair the permissions.
    I decided to use TechTool deluxe because the problems continued. While I was backing up my files, my hard drive suddenly filled up completely. As far as I can tell I didn’t copy my own files back to my harddrive.
    I could not find any duplicate files or any new files.
    I did manage to back up my files and run TechTool. TechTool found an error in the harddrive and repaired it. When I restarted the mini the screen with the white apple comes up, but then the apple disappears and a black rectangle appears in its spot. It does not startup any further then that.
    I did try to use the disk utility of the original installation disk and it found a problem with the b-tree, but the disk utility could not repair it.
    I am kind of stuck as to what I should do next. Any ideas?

    OSX gets really unhappy if you let the hard drive fill up completely.
    It's not clear whether your hard drive was already dying when this mishap occurred, or whether the "fill-up" caused the B-tree error and the drive is otherwise mechanically healthy.
    If you have a decent backup, you might be best using DiskUtility to erase and reformat and then re-install everything.
    If you don't have a good backup, then your options would appear to be to try to fix the b-tree error with DiskWarrior, or to recover what files you can to another hard drive using DataRescueII.
    If the hard drive was full when it died, DiskWarrior will have a hard time doing the repair, however.
    A third option would be to install Tiger on an external firewire drive and use that as your startup drive from now on. (I run my Mini from a firewire external.) You could then, at your leisure, try to rescue what data you can from the internal. If you do this, be sure to use the Apple Partition Map on the external drive, because PPC Minis require this to boot.

Maybe you are looking for