• Provides an algorithm that generates compact Characterizing sets from deterministic FSMs . Shows constructing minimum sized Characterising is PSPACE complete for with total number of inputs NP Complete Presents the results a set experiment and discussions in rigorous way. A characterizing (CS) finite state machine (FSM) M input sequences that, between them, separate (distinguish) all states C...

The typical problems facing garment manufacturers are long production lead time, bottlenecking, and low productivity. The most critical phase of garment manufacturing is the sewing phase, as it generally involves a number of operations or for the simple reason that it’s labor intensive. In assembly line balancing, allocation of jobs to machines is based on the objective of minimizing the workfl...

We propose railway line planning optimization models that determines the frequency of each train so that it can meet passenger origindestination demands while minimizing the related costs. Most line planning models assume that all trains on a supply network stop at all intermediate stations. However to minimize passenger travelling time and provide train service to as many stations as possible,...

We propose the Assembly Line Worker Integration and Balancing Problem (ALWIBP), a new assembly line balancing problem arising in lines with conventional and disabled workers. The goal of this problem is to maintain high productivity levels by minimizing the number of workstations needed to reach a given output, while including in the assembly line a number of disabled workers. This problem gain...

A global convergence theorem for unconstrained minimization algorithms with an eecient line search is derived. The theorem applies to a new version of the conjugate gradient method derived here in terms of minimizing the eeect of zigzagging. The global convergence condition makes much weaker demands on the line search than previous methods. Local Q-linear convergence in a neighborhood of a stro...