A new sufficient condition of optimality for the two-machine flowshop problem

@article{Briand2006ANS,
  title={A new sufficient condition of optimality for the two-machine flowshop problem},
  author={Cyril Briand and Hoang Trung La and Jacques Erschler},
  journal={European Journal of Operational Research},
  year={2006},
  volume={169},
  pages={712-722}
}
This paper focuses on the characterization of a subset of optimal sequences for the famous two-machine flowshop problem. Based on the relative order of the job processing times, two particular interval structures are defined so that each job is associated with an interval. Then, using the Allen’s algebra, the interval relationships are analysed and a sufficient optimality condition is established providing a characterisation of a large subset of optimal sequences. This set necessarily includes… CONTINUE READING

From This Paper

Figures and tables from this paper.
3 Citations
26 References
Similar Papers

References

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

Une approche pour l ’ ordonnancement robuste de tâches sur une machine ,

  • M. Benoit, J.-C Billaut, C. Briand, H. T. La, J. Erschler
  • 2003

Une approche pour l’ordonnancement

  • C. Briand, H. T. La, J. Erschler
  • robuste de tâches sur une machine,
  • 2003
1 Excerpt

Fast algorithms to minimize the makespan or maximum lateness in the two - machine flow shop with release times

  • J. Cheng, G. Steiner, P. Stephenson
  • Journal of Scheduling
  • 2002

Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release

  • J. Cheng, G. Steiner, P. Stephenson
  • Journal of Scheduling,
  • 2002
1 Excerpt

Grouping on a single machine with heads and tails to represent a family of dominant schedules

  • P. Mauguière, Billaut, J.-C, C. Artigues
  • Workshop on Project Management and Scheduling,
  • 2002
1 Excerpt

Trade-off between flexibility and maximum completion time in the two-machine flowshop scheduling

  • C. Esswein, Billaut, J.-C
  • International Symposium on Combinatorial…
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…