Corpus ID: 227162138

Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

@article{Koehler2020CableTW,
  title={Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints},
  author={J. Koehler and Joseph B{\"u}rgler and Urs Fontana and E. Fux and Florian Herzog and Marc Pouly and Sophia Saller and Anastasia Salyaeva and Peter Scheiblechner and Kai Waelti},
  journal={ArXiv},
  year={2020},
  volume={abs/2011.12862}
}
  • J. Koehler, Joseph Bürgler, +7 authors Kai Waelti
  • Published 2020
  • Computer Science
  • ArXiv
  • Cable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few automated manufacturing solutions exist using complex robotic machines. For these machines, the wiring plan has to be translated into a wiring sequence of cable plugging operations to be followed by the machine. In this paper, we study and formalize the problem of deriving the optimal wiring sequence for a given layout of… CONTINUE READING

    References

    SHOWING 1-10 OF 72 REFERENCES
    AND/OR precedence constraint traveling salesman problem and its application to assembly schedule generation
    • C. Chen
    • Computer Science
    • 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings
    • 1990
    • 18
    Soft car sequencing with colors: Lower bounds and optimality proofs
    • T. Benoist
    • Mathematics, Computer Science
    • Eur. J. Oper. Res.
    • 2008
    • 15
    Reducibility Among Combinatorial Problems
    • R. Karp
    • Computer Science
    • 50 Years of Integer Programming
    • 2010
    • 4,809
    • Highly Influential
    • PDF
    THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
    • 16
    • PDF
    Mixed Integer Programming models for job shop scheduling: A computational analysis
    • 65
    • PDF
    The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
    • 274
    Dynamic route planning and scheduling in flexible manufacturing systems with heterogeneous resources, a max-plus approach
    • 6
    Automatically improving constraint models in Savile Row
    • 30
    • PDF
    Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
    • 250
    • PDF