International Journal of Advanced Manufacturing Technology, 2004
The present paper deals with the formation of an optimal sequence of flow shop scheduling (FSS) f... more The present paper deals with the formation of an optimal sequence of flow shop scheduling (FSS) for efficient operation. The primary concern of FSS is to obtain the optimal sequence, which minimises the idle time, tardiness, makespan, etc. Among these, the criteria of minimising the makespan plays a vital part. Thus, in this paper, the sequencing of the FSS for minimising the makespan is addressed. An effective hybrid has been formed with the metaheuristics, namely an ant system and a genetic algorithm (GA). A number of illustrative examples with different combinations of machines and jobs have been solved using the proposed hybrid method.
International Journal of Advanced Manufacturing Technology, 2005
This paper deals with the multicriterion approach to flow shop scheduling [FSS] problems by consi... more This paper deals with the multicriterion approach to flow shop scheduling [FSS] problems by considering makespan time and total flow time. The primary concern of flow shop scheduling is to obtain the best sequence, which minimizes the makespan, flow time, idle time, tardiness, etc. In this work, makespan and total flow time of the jobs are considered for minimization. Three heuristic algorithms namely HAMC1, HAMC2 and HAMC3 have been proposed in this paper. The effectiveness of the heuristics has been analyzed using the problems generated by Taillard [16]. The results of the problems are compared with the solution procedures proposed by Rajendran [15]. The new hybrid algorithms are developed by taking the seed sequences yielded by a method proposed by Rajendran [14] in his work to minimize flow time and improving it using search algorithm. The hybrid algorithm gives better results.
International Journal of Production Research, 2011
This paper presents a simple heuristic to determine a common linear machine sequence for multiple... more This paper presents a simple heuristic to determine a common linear machine sequence for multiple products with different operation sequences and a limited number of duplicate machine types available for the job. The heuristic is based on minimisation of the total flow distance travelled by a product on the linear machine sequence. It is assumed that the flows of products are allowed only in the forward direction, either in-sequence or by-pass. It is also assumed that backtrack movements are not allowed. The effectiveness of the proposed heuristic is demonstrated through the solutions of two typical layout design problems taken from the literature. Subsequently, a number of additional problems are solved and their results are compared with the results applying existing methods. The results indicate that the proposed method can be an effective tool in solving layout design problems.
A study of intermittency in hadron-nucleus and the comparison with nucleus-nucleus interactions i... more A study of intermittency in hadron-nucleus and the comparison with nucleus-nucleus interactions is presented. The power law behavior of the factorial moments and the variation of intermittency index with the center-of-mass energy are shown. Results favor the formation of quark-gluon plasma in preference to a cascade mechanism.
International Journal of Advanced Manufacturing Technology, 2004
The present paper deals with the formation of an optimal sequence of flow shop scheduling (FSS) f... more The present paper deals with the formation of an optimal sequence of flow shop scheduling (FSS) for efficient operation. The primary concern of FSS is to obtain the optimal sequence, which minimises the idle time, tardiness, makespan, etc. Among these, the criteria of minimising the makespan plays a vital part. Thus, in this paper, the sequencing of the FSS for minimising the makespan is addressed. An effective hybrid has been formed with the metaheuristics, namely an ant system and a genetic algorithm (GA). A number of illustrative examples with different combinations of machines and jobs have been solved using the proposed hybrid method.
International Journal of Advanced Manufacturing Technology, 2005
This paper deals with the multicriterion approach to flow shop scheduling [FSS] problems by consi... more This paper deals with the multicriterion approach to flow shop scheduling [FSS] problems by considering makespan time and total flow time. The primary concern of flow shop scheduling is to obtain the best sequence, which minimizes the makespan, flow time, idle time, tardiness, etc. In this work, makespan and total flow time of the jobs are considered for minimization. Three heuristic algorithms namely HAMC1, HAMC2 and HAMC3 have been proposed in this paper. The effectiveness of the heuristics has been analyzed using the problems generated by Taillard [16]. The results of the problems are compared with the solution procedures proposed by Rajendran [15]. The new hybrid algorithms are developed by taking the seed sequences yielded by a method proposed by Rajendran [14] in his work to minimize flow time and improving it using search algorithm. The hybrid algorithm gives better results.
International Journal of Production Research, 2011
This paper presents a simple heuristic to determine a common linear machine sequence for multiple... more This paper presents a simple heuristic to determine a common linear machine sequence for multiple products with different operation sequences and a limited number of duplicate machine types available for the job. The heuristic is based on minimisation of the total flow distance travelled by a product on the linear machine sequence. It is assumed that the flows of products are allowed only in the forward direction, either in-sequence or by-pass. It is also assumed that backtrack movements are not allowed. The effectiveness of the proposed heuristic is demonstrated through the solutions of two typical layout design problems taken from the literature. Subsequently, a number of additional problems are solved and their results are compared with the results applying existing methods. The results indicate that the proposed method can be an effective tool in solving layout design problems.
A study of intermittency in hadron-nucleus and the comparison with nucleus-nucleus interactions i... more A study of intermittency in hadron-nucleus and the comparison with nucleus-nucleus interactions is presented. The power law behavior of the factorial moments and the variation of intermittency index with the center-of-mass energy are shown. Results favor the formation of quark-gluon plasma in preference to a cascade mechanism.
Uploads
Papers