1. Home
  2. Material Detail: Algoritmo Branch and Bound para secuenciación en configuraciones 1/ri di/Lmax

Material Detail

Algoritmo Branch and Bound para secuenciación en configuraciones 1/ri di/Lmax

Algoritmo Branch and Bound para secuenciación en configuraciones 1/ri di/Lmax

Se explica con un ejemplo un algoritmo Branch and Bound para resolver el problema de secuenciación en una máquina con disponibilidad de los trabajos y fechas de entrega cuando el objetivo es optimizar la tardanza máxima (1/ri di/Lmax)
Keywords:
Branch and bound, Optimización, Secuenciacion
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Animation
Date Added to MERLOT:
October 2, 2019
Date Modified in MERLOT:
October 2, 2019
Author:
Submitter:
RIUNET Universitat Politècnica de València
Primary Audience:
High School, College General Ed, College Lower Division, College Upper Division, Graduate School
Technical Format:
Video, Website
Mobile Compatibility:
Blackberry, iOS (Apple), Windows Mobile, Android
Language:
Spanish
Cost Involved:
No
Source Code Available:
No
Creative Commons:
No

Browse...

Disciplines with similar materials as Algoritmo Branch and Bound para secuenciación en configuraciones 1/ri di/Lmax
People who viewed this also viewed
Other materials like Algoritmo Branch and Bound para secuenciación en configuraciones 1/ri di/Lmax

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.