Minimizing flow time in a flow-line manufacturing cell with family setup times

This paper considers the problem of scheduling part families and jobs within each part family in a flowline manufacturing cell with independent family setup times where parts (jobs) in each family are processed together. The objective is to minimize total flow time. A branch-and-bound algorithm capable of solving moderate sized problems is developed. Several heuristic algorithms are proposed and empirically evaluated as to their effectiveness and efficiency in finding optimal permutation schedules. These results show that several heuristic algorithms generate solutions that are better than those generated by an existing genetic algorithm.

[1]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[2]  Asoo J. Vakharia,et al.  Job and Family Scheduling of a Flow-Line Manufacturing Cell: A Simulation Study , 1991 .

[3]  Chandrasekharan Rajendran,et al.  A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell , 1994 .

[4]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[5]  John M. Wilson,et al.  A genetic algorithm for flow shop scheduling problems , 2004, J. Oper. Res. Soc..

[6]  Wen-Hwa Yang,et al.  Survey of scheduling research involving setup times , 1999, Int. J. Syst. Sci..

[7]  Jeffrey E. Schaller,et al.  A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell , 2000 .

[8]  Ronald G. McGarvey,et al.  Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated , 2004, J. Oper. Res. Soc..

[9]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[10]  Yih-Long Chang,et al.  A simulated annealing approach to scheduling a manufacturing cell , 1990 .

[11]  D. Chaudhuri,et al.  An efficient heuristic approach to the scheduling of jobs in a flowshop , 1992 .

[12]  S. Bansal.  Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .

[13]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[14]  Andrew Kusiak,et al.  Group technology , 1987 .

[15]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[16]  Jadranka Skorin-Kapov,et al.  Scheduling a flow-line manufacturing cell: a tabu search approach , 1993 .