专题:Optimization and Packing Problems

This cluster of papers focuses on the optimization of cutting and packing problems, including knapsack problems, bin packing, heuristic and metaheuristic algorithms, three-dimensional packing, rectangular packing, genetic algorithms, and strip packing. The research explores various approaches to efficiently utilize space and resources for packing objects into containers or arranging them for optimal use.
最新文献
Minimizing the total weighted number of tardy jobs and delivery costs in a hybrid flow shop scheduling problem with a batch delivery system

article Full Text OpenAlex

Energy-aware co-optimization of facility layout and AGV configuration in intelligent manufacturing cells

article Full Text OpenAlex

Minmax delivery completion time scheduling with delivery times and deteriorating jobs

article Full Text OpenAlex

Study on Controllable Processing Time and Minmax Group Scheduling with Common Due-Window Assignment

article Full Text OpenAlex

A Hybrid Machine Learning–Metaheuristic Approach to Solving the Quadratic Multidimensional Knapsack Problem

article Full Text OpenAlex

Evaluation of Quantum Annealing-based algorithms for flexible job shop scheduling

article Full Text OpenAlex

Order routing in sequential zone picking systems

article Full Text OpenAlex

Evolutionary Optimization for Job Shop Scheduling with Blocking: A Genetic Algorithm Approach

article Full Text OpenAlex

A New Improved Algorithm for a Rich Production and Routing Problem

book-chapter Full Text OpenAlex

A Large Language Model-Assisted Reinforcement Learning Framework with Evolutionary Algorithm for Hybrid Flow-Shop Scheduling

article Full Text OpenAlex

近5年高被引文献
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem

article Full Text OpenAlex 1137 FWCI27.5998

The flexible job shop scheduling problem: A review

review Full Text OpenAlex 227 FWCI45.3077

Exact and metaheuristic algorithms for the vehicle routing problem with a factory-in-a-box in multi-objective settings

article Full Text OpenAlex 198 FWCI26.4382

Towards Understanding Convergence and Generalization of AdamW

article Full Text OpenAlex 183 FWCI61.5968

Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems

article Full Text OpenAlex 176 FWCI22.7792

A comprehensive survey on the generalized traveling salesman problem

article Full Text OpenAlex 141 FWCI28.1701

Metaheuristic Algorithms for Optimization: A Brief Review

review Full Text OpenAlex 119 FWCI39.8931

Circle Search Algorithm: A Geometry-Based Metaheuristic Optimization Algorithm

article Full Text OpenAlex 108 FWCI14.4383

Solving Biobjective Distributed Flow-Shop Scheduling Problems With Lot-Streaming Using an Improved Jaya Algorithm

article Full Text OpenAlex 103 FWCI13.2869

A literature review of smart warehouse operations management

review Full Text OpenAlex 103 FWCI13.1513