Heuristic solution approaches for combined-job sequencing and machine loading problem in flexible manufacturing systems

2006 ◽  
Vol 31 (7-8) ◽  
pp. 716-730 ◽  
Author(s):  
M. K. Tiwari ◽  
J. Saha ◽  
S. K. Mukhopadhyay
Keyword(s):  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Heuristic Solution ◽  
Job Sequencing ◽  
Machine Loading ◽  
Loading Problem

Solving Machine Loading Problem of FMS

2011 ◽  
pp. 19-43 ◽  
Author(s):  
Anoop Prakash ◽  
Nagesh Shukla ◽  
Ravi Shankar ◽  
Manoj Kumar Tiwari
Keyword(s):  
Genetic Algorithm ◽  
Ant Colony Optimization ◽  
Flexible Manufacturing ◽  
Manufacturing Systems ◽  
Random Search ◽  
Search Algorithms ◽  
Ant Colony ◽  
Complex Nature ◽  
Machine Loading ◽  
Loading Problem

Artificial intelligence (AI) refers to intelligence artificially realized through computation. AI has emerged as one of the promising computer science discipline originated in mid-1950. Over the past few decades, AI based random search algorithms, namely, genetic algorithm, ant colony optimization, and so forth have found their applicability in solving various real-world problems of complex nature. This chapter is mainly concerned with the application of some AI based random search algorithms, namely, genetic algorithm (GA), ant colony optimization (ACO), simulated annealing (SA), artificial immune system (AIS), and tabu search (TS), to solve the machine loading problem in flexible manufacturing system. Performance evaluation of the aforementioned search algorithms have been tested over standard benchmark dataset. In addition, the results obtained from them are compared with the results of some of the best heuristic procedures in the literature. The objectives of the present chapter is to make the readers fully aware about the intricate solutions existing in the machine loading problem of flexible manufacturing systems (FMS) to exemplify the generic procedure of various AI based random search algorithms. Also, the present chapter describes the step-wise implementation of search algorithms over machine loading problem.

A note on planning station loading in flexible manufacturing systems

Robotica ◽  
1988 ◽  
Vol 6 (4) ◽  
pp. 297-298
Author(s):  
Gamini Gunawardane
Keyword(s):  
Linear Programming ◽  
Structural Properties ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Solution Technique ◽  
Single Period ◽  
Loading Problem ◽  
Programming Solution ◽  
Linear Programming Solution

SUMMARYIn a 1985 issue of this journal, Kusiak presented a formulation of the single period station loading problem related to planning of Flexible Manufacturing Systems. This note makes several observations about this formulation and the linear programming solution technique used. Possible variations and some structural properties of the fomulation are highlighted.

Sign in / Sign up

Export Citation Format

Share Document