The simple F2/ /Cmax with forbidden tasks in first or last position: A problem more complex that it seems

@article{Saadani2005TheSF,
  title={The simple F2/ /Cmax with forbidden tasks in first or last position: A problem more complex that it seems},
  author={Nour El Houda Saadani and Pierre Baptiste and Mohamed Moalla},
  journal={European Journal of Operational Research},
  year={2005},
  volume={161},
  pages={21-31}
}
Abstract The classical F 2// C max problem is solved optimally by the famous Johnson's algorithm in O (n∗ log (n)) where n is the number of jobs. For solving the F /no-idle/ C max with a branch and bound algorithm, it is necessary to solve problem closed to the F 2// C max. The only difference is an additive constraint: a set of jobs that cannot be placed in the first (or the last) position. This problem is linear and can be solved by testing systematically all allowed jobs in first position… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Hguny, A branch and bound algorithm for the F =no-idle=Cmax

L.K.P. Baptiste
  • in: Proceedings of the International Conference on Industrial Engineering and Production Management,
  • 1997
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

NP-hardness of compact scheduling in simplified open and flow shops

  • European Journal of Operational Research
  • 2001
VIEW 1 EXCERPT

Strvsevitch, Scheduling Theory Multi-stage System

V. S. Tanarv, V.A.Y.N. Sotskov
  • Kluwer Academic Publishers, Dordrecht,
  • 1994
VIEW 1 EXCERPT

A comparison of sequencing rules for a two - stage hybrid flowshop

P. M. Mangiameli Narasimhan
  • Decision Sciences
  • 1987

Mangiameli, A comparison of sequencing rules for a two-stage hybrid flowshop

P.M.S.L. Narasimhan
  • Decision Sciences
  • 1987
VIEW 1 EXCERPT

Panwalker, Scheduling in a two stage manufacturing process, International Journal of Production Research

S.S.S.L. Narasimhan
  • 1984
VIEW 1 EXCERPT