On the Benefits of Using NP-hard Problems in Branch & Bound

Jörg Rambau () and Cornelius Schwarz ()
Additional contact information
Jörg Rambau: University of Bayreuth
Cornelius Schwarz: University of Bayreuth

Chapter 75 in Operations Research Proceedings 2008, 2009, pp 463-468 from Springer

Abstract: Summary We present a Branch-and-Bound (B&B) method using combinatorial bounds for solving makespan minimization problems with sequence dependent setup costs. As an application we present a laser source sharing problem arising in car manufacturing

Keywords: Laser Source; Laser Welding; Vehicle Rout Problem; Welding Robot; Soft Time Window (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-00142-0_75

Ordering information: This item can be ordered from
http://www.springer.com/9783642001420

DOI: 10.1007/978-3-642-00142-0_75

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().