A5070453467- Vehicle Routing Optimization Methods
- Facility Location and Emergency Management
- Advanced Manufacturing and Logistics Optimization
- Scheduling and Optimization Algorithms
- Process Optimization and Integration
- Urban and Freight Transport Logistics
- Assembly Line Balancing Optimization
- Integrated Energy Systems Optimization
- Optimization and Packing Problems
- Regional Development and Innovation
- Optimization and Mathematical Programming
- Transportation Planning and Optimization
- Transportation and Mobility Innovations
- Advanced Control Systems Optimization
- Sustainable Supply Chain Management
- Operations Management Techniques
- Electric Power System Optimization
- Optimization and Search Problems
- Forest Biomass Utilization and Management
- Carbon Dioxide Capture Technologies
- Smart Grid Energy Management
- Business, Innovation, and Economy
- Urban Transport and Accessibility
- Recycling and Waste Management Techniques
- Data Management and Algorithms
Universidad Autónoma de Nuevo León
2014-2024
Mitchell Institute
1998-1999
Texas A&M University
1998-1999
The University of Texas at Austin
1998
Abstract This paper presents a branch-and-bound enumeration scheme for the makespan minimization of permutation flow shop scheduling problem with sequence-dependent setup times. The algorithm includes implementation both lower and upper bounding procedures, dominance elimination criterion, special features such as partial strategy. A computational evaluation overall demonstrates effectiveness each component. Test results are provided wide range instances.