Skip to Main Content
This paper analyzes the requirement of a real-life assembly job-shop scheduling, which is different from the classical scheduling problems, ensuring not only the sequences having the minimization makespan as possible, but also the operations processed with the a period. Solving the conflicts of the equipments on which many process will be operated be used at the same time in actual production. First modeling the kind of assembly job-shop schedule problem by timed colored Petri nets, then resolves it in a Branch and Bound way with heuristic rules which gives a near optimization. At the end of the paper, a practical example is described, and the results show that the proposed method is effective.