OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP

This paper considers a scheduling problem of minimizing the maximum completion time (i.e., the makespan) for an automated flowshop manufacturing system such as FMS which consists of m machin- ing cells with sufficient buffers, an AGV (automated guided vehicle) and loading/unloading stations. For this problem we propose a heuristic algorithm based on a fuzzy approximation (called fuzzy scheduling), and a branch-and-bound algorithm with fuzzy inferences. Computational experiences show that the fuzzy scheduling can give optimal or near optimal solutions in very short time, and the branch-and-bound algo- rithm can efficiently give optimal solutions to problem instances with three-machines and up to 400 parts with high probability over 90%.

[1]  Konstantin Kogan,et al.  Scheduling a two-machine robotic cell: A solvable case , 1995, Ann. Oper. Res..

[2]  Toshihide Ibaraki,et al.  Automated Two-machine Flowshop Scheduling: A Solvable Case , 1991 .

[3]  Ihsan Sabuncuoglu,et al.  Experimental investigation of an FMS due-date scheduling problem: Evaluation of machine and AGV scheduling rules , 1993 .

[4]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[5]  Joseph J. Talavage,et al.  A mixed dispatching rule approach in FMS scheduling , 1994 .

[6]  Chelliah Sriskandarajah,et al.  Scheduling in Robotic Cells: Classification, Two and Three Machine Cells , 1997, Oper. Res..

[7]  Stanley B. Gershwin,et al.  An algorithm for the computer control of a flexible manufacturing system , 1983 .

[8]  Helman I. Stern,et al.  Scheduling Parts in a Combined Production-transportation Work Cell , 1990 .

[9]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

[10]  Hiroshi Kise,et al.  ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER , 1991 .

[11]  S. S. Panwalkar,et al.  Scheduling of a Two-machine Flowshop with Travel Time Between Machines , 1991 .

[12]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[13]  J. A. Buzacott,et al.  Flexible manufacturing systems: a review of analytical models , 1986 .

[14]  Hiroshi Kise,et al.  Optimal Scheduling for Automated Two-Machine Manufacturing Systems with Intermediate Operations , 1995 .

[15]  Kathryn E. Stecke,et al.  Design, planning, scheduling, and control problems of flexible manufacturing systems , 1985 .

[16]  茨木 俊秀,et al.  Enumerative approaches to combinatorial optimization , 1987 .

[17]  H. Kise,et al.  A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem , 1997 .

[18]  Hiroshi Kise,et al.  Optimal Scheduling for an Automated Two-Machine Manufacturing System. , 1991 .

[19]  Wieslaw Kubiak,et al.  Sequencing of parts and robot moves in a robotic cell , 1989 .