This paper presents a state of the art overview on Ants Systems. Initially the work proposes the fundamental concepts of Ants Theory and offers a description of the main algorithms (based on Ants Theory) and the respective fields of application. Among different fields of application, the paper focuses on industrial plants scheduling problems in open shop, flow shop and job shop systems. The las...

Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple f...

This paper deals with multi-operation models, which are different from the flow shop and job shop models. In the flow shop or job shop models, the routes of all jobs are known in advance. In practice, the route of the job is often immaterial and up to the scheduler to decide. When the routes of the jobs are open, the model is referred to as an open shop. This paper describes the development of ...

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

This paper presents the salient aspects of a simulation-based experimental study of scheduling rules for scheduling a dynamic job shop in which the setup times are sequence dependent. A discrete event simulation model of the job shop system is developed for the purpose of experimentation. Seven scheduling rules from the literature are incorporated in the simulation model. Five new setup-oriente...

This paper provides a heuristic procedure for solving the constrained flow-shop scheduling problems of n-jobs on m-machines. We obtained a schedule with a set of n-jobs to minimize the mean weighted flow-time. This method is very easy to understand and to apply. It will also help managers in the scheduling related issues by aiding them in the decision making process and providing an optimal or ...