Single-track multi-hoist scheduling problem : a collision-free resolution based on a branch-and-bound approach

@inproceedings{Che2004SingletrackMS,
  title={Single-track multi-hoist scheduling problem : a collision-free resolution based on a branch-and-bound approach},
  author={Ada Che and Chengbin Chu},
  year={2004}
}
An analytical mathematical model and a branch-and-bound algorithm for singletrack cyclic multi-hoist scheduling problems are proposed. The objective is to minimize the cycle time for a given number of hoists. The collision-free single-track constraints are first formulated as disjunctive inequalities. It is then shown that this formulation is a very strict and necessary condition. To be a sufficient and necessary one, two additional properties, like collision-checking rules, must hold in… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
17 Citations
20 References
Similar Papers

References

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

A greedy algorithm to determine the number

  • R ARMSTRONG, S GU, L LEI
  • 1996
Highly Influential
4 Excerpts

Resolution of the cyclic multi-hoists scheduling problem with overlapping partitions

  • C. VARNIER, BACHELU, P. BAPTISTE
  • INFOR (Information Systems and Operations…
  • 1997
3 Excerpts

A greedy algorithm to determine the number of transporters in a cyclic electroplating process

  • M. A. MANIER
  • IIE Transactions
  • 1996

Une approche pour l’ordonnancement dynamique d’un atelier de traitement des surfaces

  • J. LAMOTHE
  • PhD thesis,
  • 1996

Similar Papers

Loading similar papers…