Discrepancy search for the flexible job shop scheduling problem

@article{Hmida2010DiscrepancySF,
  title={Discrepancy search for the flexible job shop scheduling problem},
  author={Abir Ben Hmida and Mohamed Haouari and Marie-Jos{\'e} Huguet and Pierre Lopez},
  journal={Computers & OR},
  year={2010},
  volume={37},
  pages={2192-2201}
}
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine so that the resulting schedule has a minimal completion time. We propose a variant of the Climbing Discrepancy Search approach for solving this problem. We also present… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS
21 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

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

Multistage-based genetic algorithm for flexible job-shop scheduling problem

  • Zhang H-P, M Gen
  • Journal of Complexity International,
  • 2005
Highly Influential
6 Excerpts

Climbing Discrepancy Search for solving the hybrid Flow shop

  • A. Ben Hmida, M.-J. Huguet, P. Lopez, M. Haouari
  • European Journal of Industrial Engineering,
  • 2007
Highly Influential
3 Excerpts

Effective neighbourhood functions for the flexible job shop problem

  • M. Mastrolilli, L. M. Gambardella
  • Journal of Scheduling,
  • 2000
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…