Convergence of an annealing algorithm
Mathematical Programming: Series A and B
Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms
ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Production planning and control in textile industry: a case study
Computers in Industry
An evaluation of sequencing heuristics in flow shops with multiple processors
Computers and Industrial Engineering
Hybrid flow shop scheduling: a survey
Computers and Industrial Engineering
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Computers and Operations Research
Scheduling of drilling operations in printed circuit board factory
Computers and Industrial Engineering
Computers and Operations Research
Algorithms for a realistic variant of flowshop scheduling
Computers and Operations Research
Evolutionary computation for minimizing makespan on identical machines with mold constraints
WSEAS Transactions on Systems and Control
Multirobot Task Assignment in Active Surveillance
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
ISROBOTNET: a testbed for sensor and robot network systems
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Genetic algorithms for coordinated scheduling of production and air transportation
Expert Systems with Applications: An International Journal
Scheduling algorithms for a semiconductor probing facility
Computers and Operations Research
A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems
Journal of Intelligent Manufacturing
Hi-index | 0.01 |
This paper considers a flexible flow shop scheduling problem, where at least one production stage is made up of unrelated parallel machines. Moreover, sequence- and machine-dependent setup times are given. The objective is to find a schedule that minimizes a convex sum of makespan and the number of tardy jobs in a static flexible flow shop environment. For this problem, a 0-1 mixed integer program is formulated. The problem is, however, a combinatorial optimization problem which is too difficult to be solved optimally for large problem sizes, and hence heuristics are used to obtain good solutions in a reasonable time. The proposed constructive heuristics for sequencing the jobs start with the generation of the representatives of the operating time for each operation. Then some dispatching rules and flow shop makespan heuristics are developed. To improve the solutions obtained by the constructive algorithms, fast polynomial heuristic improvement algorithms based on shift moves and pairwise interchanges of jobs are applied. In addition, metaheuristics are suggested, namely simulated annealing (SA), tabu search (TS) and genetic algorithms. The basic parameters of each metaheuristic are briefly discussed in this paper. The performance of the heuristics is compared relative to each other on a set of test problems with up to 50 jobs and 20 stages and with an optimal solution for small-size problems. We have found that among the constructive algorithms the insertion-based approach is superior to the others, whereas the proposed SA algorithms are better than TS and genetic algorithms among the iterative metaheuristic algorithms.