A fast taboo search algorithm for the job shop problem
Management Science
Simulation in production scheduling: scheduling flow-shops with limited buffer spaces
Proceedings of the 32nd conference on Winter simulation
Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems
Computers and Industrial Engineering
An ant colony system for permutation flow-shop sequencing
Computers and Operations Research
Robotics and Computer-Integrated Manufacturing
A hybrid heuristic to solve the parallel machines job-shop scheduling problem
Advances in Engineering Software
Computers and Operations Research
A multi-objective ant colony system algorithm for flow shop scheduling problem
Expert Systems with Applications: An International Journal
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
Computers and Operations Research
Computers and Operations Research
Permutation vs. non-permutation flow shop schedules
Operations Research Letters
Hi-index | 12.05 |
This work starts from modeling the scheduling of n jobs on m machines/stages as flowshop with buffers in manufacturing. A mixed-integer linear programing model is presented, showing that buffers of size n-2 allow permuting sequences of jobs between stages. This model is addressed in the literature as non-permutation flowshop scheduling (NPFS) and is described in this article by a disjunctive graph (digraph) with the purpose of designing specialized heuristic and metaheuristics algorithms for the NPFS problem. Ant colony optimization (ACO) with the biologically inspired mechanisms of learned desirability and pheromone rule is shown to produce natively eligible schedules, as opposed to most metaheuristics approaches, which improve permutation solutions found by other heuristics. The proposed ACO has been critically compared and assessed by computation experiments over existing native approaches. Most makespan upper bounds of the established benchmark problems from Taillard (1993) and Demirkol, Mehta, and Uzsoy (1998) with up to 500 jobs on 20 machines have been improved by the proposed ACO.