THREE-MACHINE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN WITH BOUNDED SETUP AND PROCESSING TIMES

ABSTRACT The problem of scheduling n jobs on a three-machine flowshop is addressed where setup times are considered as separate from processing times and sequence-independent. The objective is to minimize makespan. Both setup and processing times are unknown variables before the actual occurrence of these times. However, a lower bound and an upper bound are given (known) for each setup and processing time. For this problem, there may not exist a unique schedule that remains optimal for all possible realizations of setup and processing times. Hence, it is desirable to obtain a set of dominating set of schedules (which dominate all other schedules) if possible. The objective is to reduce the size of dominating set. One way of reducing the size of dominating set is to come up with dominance relations. In this paper, global and local dominance relations are developed for the problem. Moreover, the use of developed dominance relations to reduce the size of the set is illustrated by an example and computational analysis is conducted on randomly generated problems.

[1]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[2]  S. C. Kim,et al.  Scheduling jobs with uncertain setup times and sequence dependency , 1997 .

[3]  Alfredo C. Desages,et al.  Ritt's algorithm, Gröbner basis and discretization , 1997 .

[4]  Frank Werner,et al.  Optimal makespan scheduling with given bounds of processing times , 1997 .

[5]  T.-C. Lai,et al.  Sequencing with uncertain numerical data for makespan minimisation , 1999, J. Oper. Res. Soc..

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

[7]  Ali Allahverdi,et al.  TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN OR TOTAL COMPLETION TIME WITH RANDOM AND BOUNDED SETUP TIMES , 2003 .

[8]  Ali Allahverdi,et al.  Two–machine flowshop minimum–length scheduling problem with random and bounded processing times , 2003 .

[9]  Ali Allahverdi,et al.  Flowshop scheduling problem to minimize total completion time with random and bounded processing times , 2004, J. Oper. Res. Soc..

[10]  Rasaratnam Logendran,et al.  Group scheduling in flexible flow shops , 2005 .

[11]  Chih-Kai Chang,et al.  Optimal Scheduling in Color Filter Manufacturing , 2005 .

[12]  C. Lo,et al.  HYBRID GENETIC ALGORITHMS FOR MINIMIZING THE MAXIMUM COMPLETION TIME FOR THE WAFER PROBING SCHEDULING PROBLEM , 2005 .

[13]  Xiaoyun Xu,et al.  Influencing factors of job waiting time variance on a single machine , 2007 .

[14]  O. V. Krishnaiah Chetty,et al.  Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach , 2007 .

[15]  Lin Huang,et al.  Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production , 2007 .

[16]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..