A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem

@inproceedings{Semanco2012ACO,
  title={A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem},
  author={Pavol Semanco and Vladimir Modrak},
  year={2012}
}
We propose a constructive heuristic approach for the solution of the permutation flow-shop problem. The objective function of all algorithms is the minimization of the makespan. Our approach employs Johnson’s rule to give a good initial solution for the improvement heuristic, also known as metaheuristics. The proposed heuristic algorithm, named MOD, is tested against four other heuristics that are well-known from the open literature, namely, NEH, Palmer’s Slope Index, CDS and Gupta’s algorithm… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 26 references

A Heuristic Algorithm for The n-job, m-machine Scheduling Problem

  • Campbell, G H.
  • Management Science
  • 1970
Highly Influential
15 Excerpts

Sequencing Jobs through a Multi-Stage Process in the Minimum Total Time - a Quick Method of Obtaining a Near Optimum

  • D. S. Palmer
  • Operational Research Quarterly
  • 1965
Highly Influential
11 Excerpts

Application of Pseudo-Analysis in the Synchronization of Container Terminal Equipment Operation

  • E Pap
  • Acta Polytechnica Hungarica,
  • 2011
1 Excerpt

Hybrid GA-based Improvement Heuristic with Makespan Criterion for Flow-Shop Scheduling Problems

  • P Semanco
  • Communications in Computer and Information…
  • 2011
1 Excerpt

Models and Simulation in Logistics

  • D. Malindzak
  • Acta Montanistica Slovaca,
  • 2010
1 Excerpt

Scheduling: Theory, Algorithms and Systems

  • M. Pinedo
  • New Jersey: Springer,
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…