• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.118-126
• /
• 2009

This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.118-125
• /
• 2006

Mobile nodes in FHMIPv6 has both advantages of HMIPv6 protocol which reduces signaling delay time and resource consumption during a handover and fast handover algorithm which reduces packet loss. Fast handover algorithm can reduce packet loss by 'tunneling' method ; that transmits a packet from old access router to new access router in case of handover. However, the fast handover algorithm can cause a reordering problem in a receiver between packets tunneled from the previous access router and packets transmitted directly to the new access router, which could degrade the TCP performance due to congestion control. In this paper, we propose two algorithms to solve the reordering problem in fast handover. The first one uses a holding timer for tunneling, the other adds a new algorithm to routers that adopt snoop protocol. We compare the performance of the proposed reseuquencing algorithms with that of the existing FHMIPv6 protocol by simulation. The simulation results show that the proposed algorithms solve the reordering problems and enhance TCP performance by preventing TCP sender entering congestion control.