This paper focuses on minimizing the makespan of a multi-machine flowshop group-scheduling problem that is typically found in the assembly of printed circuit boards, which is characterized as one with carryover sequencedependent setup times. The intent is to minimize the makespan of schedules comprised of the sequence of board groups as well as the sequence of board types within each group. Spe...

proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

This paper shows that, for single-hop WDM networks, a multicast scheduling algorithm which always tries to partition a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than a multicast scheduling algorithm which does not partition multicast transmissions. The performance of a multicast scheduling algorithm may depend on the t...

In this paper, cellular manufacturing scheduling problems are studied. The objective is to minimize makespan (Cmax) considering part family in the manufacturing cell flow line where the setup times are sequence dependent. Minimizing Cmax will result in the increment of output rate and the speed of manufacturing systems which is the main goal of such systems. This problem is solved using Ant Col...