Job　shop　scheduling　problem　(JSP)　plays　a　significant　role　for　production　management　and　combinatorial　optimization.　An　improved　artificial　bee　colony　(IABC)　algorithm　with　mutation　operation　is　presented　to　solve　JSP　in　this　paper.　The　results　for　some　benchmark　problems　reveal　that　IABC　is　effective　and　efficient　compared　to　those　of　other　approaches.　IABC　seems　to　be　a　powerful　tool　for　optimizing　job　shop　scheduling　problem.