Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems

A flowshop is a manufacturing environment with unidirectional flow of jobs through the various machines that are arranged in the order of job processing. A flowline-based manufacturing system (FBMS) is characterized by the flowline-based layout of machines with the machines arranged in the order of processing of jobs, but with the possibility of some or all jobs having missing operations on some machines. The significance of nonpermutation schedules (NPS) and their effect on improving the schedule performance measures, in the context of FBMS, is highlighted in this paper. A simple heuristic procedure to derive NPS from a given permutation schedule is proposed. Results of the extensive computational experimentation, with makespan as the primary criterion and total flowtime as the secondary criterion, are presented. The results show that the proposed heuristic procedure for generating non-permutation schedule set is effective and improves the schedule performance measures with minimal computational effort.

[1]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

[2]  Johnny C. Ho,et al.  Flowshop sequencing with mean flowtime objective , 1995 .

[3]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[4]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[5]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[6]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[7]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[8]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

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

[10]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

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

[12]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria , 1994 .

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

[14]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

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

[16]  Sihgeji Miyazaki,et al.  AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM. , 1978 .

[17]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[18]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[19]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..