International Journal of Production Research · 2014 · 214 citations · 30 references
ComputingComputer ScienceIndustrial EngineeringAlgorithmsDistributed SystemsSchedulingAssignment ProblemsCombinatorial OptimizationDistributed SchedulingJob SchedulingJob SequencingMachine SchedulingDecision ProblemsHeuristic AlgorithmsHeuristic ComputationHeuristicsMachine AssignmentMathematical HeuristicsScheduling HeuristicsUpper Bounds
As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops and their subsequent scheduling. Here we address the so-called distributed permutation flowshop scheduling problem, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flowshop. Several heuristics have been designed for this problem, although there is no direct comparison among them. In this paper, we propose a new heuristic which exploits the specific structure of the problem. The computational experience carried out on a well-known testbed shows that the proposed heuristic outperforms existing state-of-the-art heuristics, being able to obtain better upper bounds for more than one quarter of the problems in the testbed.
30
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations