All Stories

  1. 2024 and 2025 Selected Papers from Algorithms Editorial Board Members
  2. A three-stage algorithm for E-grocery demand forecasting using metaheuristic-driven high-order fuzzy cognitive maps and fractional brownian motion
  3. Special Issue “Selected 2024 and 2025 Papers from Algorithms Editorial Board Members”
  4. Velvet Worm Optimization: A Novel Bio-inspired Metaheuristic for Engineering Design Problems
  5. Single Machine Scheduling Problems: Standard Settings and Properties, Polynomially Solvable Cases, Complexity and Approximability
  6. Improving Supply Chain Performance by Production Scheduling in a Pharmaceutical Company
  7. Simulation and Modeling Methodologies, Technologies and Applications
  8. A review of challenges and solution approaches in smart manufacturing: a view on scheduling in the Industry 4.0 era
  9. Carpenter Optimization Algorithm: A Human-inspired Metaheuristic for Robust and Efficient Constrained Optimization
  10. Search and Rescue Algorithm (SRA): A Metaheuristic Approach for Efficient Constrained Engineering Optimization
  11. Detective Algorithm: A Novel Human-inspired Metaheuristic for Solving Real-world Constrained Optimization Problems
  12. Driver and Navigator Algorithm: A Novel Parameter-Free Human-inspired Metaheuristic for Efficient Global Optimization
  13. Psychologist Algorithm: A Human-inspired Metaheuristic for Solving Complex Constrained Optimization Problems
  14. Scheduling a single machine with compressible jobs to minimize maximum lateness
  15. On the Recursive Representation of the Permutation Flow and Job Shop Scheduling Problems and Some Extensions
  16. Salamander Optimization Algorithm: A New Bio-Inspired Approach for Solving Optimization Problems
  17. Combined heuristic-metaheuristic protocol for real-time clustering and routing in agricultural monitoring using UAV-assisted rechargeable WSNs
  18. Application of the Builder Optimization Algorithm for Sustainable Lot Size Optimization in Supply Chain Management: A Comprehensive Analysis and Comparison with Metaheuristic Approaches
  19. Orangutan Optimization Algorithm: An Innovative Bio-Inspired Metaheuristic Approach for Solving Engineering Optimization Problems
  20. Spider-Tailed Horned Viper Optimization: An Effective Bio-Inspired Metaheuristic Algorithm for Solving Engineering Applications
  21. Optimization Algorithms: Theory and Applications
  22. Scheduling Theory and Algorithms for Sustainable Manufacturing
  23. Special Issue: “Optimization Algorithms: Theory and Applications”
  24. Special Issue on Scheduling Theory and Algorithms for Sustainable Manufacturing
  25. MOCBOA: Multi-Objective Chef-Based Optimization Algorithm Using Hybrid Dominance Relations for Solving Engineering Design Problems
  26. Barber Optimization Algorithm: A New Human-Based Approach for Solving Optimization Problems
  27. Optimization of Reconfiguration and Resource Allocation for Distributed Generation and Capacitor Banks Using NSGA-II: A Multi-Scenario Approach
  28. Sales Training Based Optimization: A New Human-inspired Metaheuristic Approach for Supply Chain Management
  29. On the Recursive Representation of the Permutation Flow Shop Scheduling Problem and Its Extension
  30. UCapsNet: A Two-Stage Deep Learning Model Using U-Net and Capsule Network for Breast Cancer Segmentation and Classification in Ultrasound Imaging
  31. Fossa Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Engineering Applications
  32. A Completely Different and Innovative Bio-Inspired Metaheuristic Approach for Effectively Solving Complex Optimization Problems Across Various Domains
  33. Connected and Autonomous Vehicle Scheduling Problems: Some Models and Algorithms
  34. Discrete Optimization: Theory, Algorithms, and Applications
  35. Mathematical Methods for Operations Research Problems
  36. Proceedings of the 14th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
  37. Scheduling of Automated Wet-Etch Stations with One Robot in Semiconductor Manufacturing via Constraint Answer Set Programming
  38. Optimal Scheduling for Automated Wetetch Stations with One Robot in Semiconductor Manufacturing via Constraint Answer Set Programming
  39. Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
  40. Recent Advances of Disсrete Optimization and Scheduling
  41. Frilled Lizard Optimization: A Novel Nature-Inspired Metaheuristic Algorithm for Solving Optimization Problems
  42. Special Issue “Recent Advances of Discrete Optimization and Scheduling”
  43. Special Issue: “2022 and 2023 Selected Papers from Algorithms’ Editorial Board Members”
  44. Ensemble Heuristic–Metaheuristic Feature Fusion Learning for Heart Disease Diagnosis Using Tabular Data
  45. Special issue "Discrete optimization: Theory, algorithms and new applications"
  46. Frilled Lizard Optimization: A Novel Bio-Inspired Optimizer for Solving Engineering Applications
  47. Magnificent Frigatebird Optimization: A New Bio-Inspired Metaheuristic Approach for Solving Optimization Problems
  48. GastroFuse-Net: an ensemble deep learning framework designed for gastrointestinal abnormality detection in endoscopic images
  49. A Heuristic Framework for Assessing the Efficiency of Multi-branch Banks Under Big Data Conditions
  50. Using the Novel Wolverine Optimization Algorithm for Solving Engineering Applications
  51. Simulation and Modeling Methodologies, Technologies and Applications
  52. A sustainable multi-objective model for the hazardous waste location-routing problem: A real case study
  53. EHMFFL: Ensemble Heuristic-Metaheuristic Feature Fusion Learning Algorithm for Heart Disease Diagnosis
  54. Acoustic Monitoring in Underwater Wireless Sensor Networks using Energy-efficient Artificial Fish Swarm-based Clustering Protocol (EAFSCP)
  55. Scheduling: Algorithms and Applications
  56. Proceedings of the 13th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
  57. Special Issue “Scheduling: Algorithms and Applications”
  58. Mathematical Modeling and Exact Optimizing of University Course Scheduling Considering Preferences of Professors
  59. Mathematical Circuit Root Simplification Using an Ensemble Heuristic–Metaheuristic Algorithm
  60. Mathematical Modeling and Exact Optimizing of University Course Scheduling COnsidering Preferences of Professors
  61. Sustainable Phosphorus Fertilizer Supply Chain Management to Improve Crop Yield and P Use Efficiency Using an Ensemble Heuristic–Metaheuristic Optimization Algorithm
  62. Mathematical Root Simplification in Operational Amplifiers using an Ensemble Heuristic-Metaheuristic Algorithm
  63. Simulation and Modeling Methodologies, Technologies and Applications
  64. Simulation and Modeling Methodologies, Technologies and Applications
  65. LX-BBSCA: Laplacian biogeography-based sine cosine algorithm for structural engineering design optimization
  66. Designing a Renewable and Sustainable Phosphorus Fertilizer Supply Chain Network using an Ensemble Knowledge-based Heuristic-Metaheuristic Algorithm
  67. Solving train scheduling problems as a job shop: A brief review
  68. Social Media’s Role in Achieving Marketing Goals in Iran during the COVID-19 Pandemic
  69. Special Issue “1st Online Conference on Algorithms (IOCA2021)”
  70. Home Health Care Planning with the Consideration of Flexible Starting/Ending Points and Service Features
  71. Proceedings of the 12th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
  72. The 1st International Electronic Conference on Algorithms
  73. The 1st International Electronic Conference on Algorithms (IOCA 2021)
  74. A robust optimization approach for a cellular manufacturing system considering skill-leveled operators and multi-functional machines
  75. Special Issue “2021 Selected Papers from Algorithms’ Editorial Board Members”
  76. A Stochastic Multi-Objective Model for a Sustainable Closed-Loop Supply Chain Network Design in the Automotive Industry
  77. Special Issue “Mathematical Methods for Operations Research Problems”
  78. Proceedings of the 11th International Conference on Simulation and Modeling Methodologies, Technologies and Applications
  79. Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines
  80. A Bi-Objective Home Health Care Routing and Scheduling Model with Considering Nurse Downgrading Costs
  81. 2020 Selected Papers from Algorithms’ Editorial Board Members
  82. A Polynomial Algorithm for Sequencing Jobs with Release and Delivery Times on Uniform Machines
  83. Multicriteria Optimization - Pareto-Optimality and Threshold-Optimality
  84. A Brief Look at Multi-Criteria Problems: Multi-Threshold Optimization versus Pareto-Optimization
  85. A Bi-Objective Home Health Care Routing and Scheduling Model with Considering Nurse Downgrading Costs
  86. Advances and Novel Approaches in Discrete Optimization
  87. Advances and Novel Approaches in Discrete Optimization
  88. A metric approach for scheduling problems with minimizing the maximum penalty
  89. On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty
  90. Graph-Theoretic Problems and Their New Applications
  91. Minimizing Total Weighted Tardiness for Scheduling Equal-Length Jobs on a Single Machine
  92. МИНИМИЗАЦИЯ СУММАРНОГО ВЗВЕШЕННОГО ЗАПАЗДЫВАНИЯ НА ОДНОМ ПРИБОРЕ С РАВНЫМИ ПРОДОЛЖИТЕЛЬНОСТЯМИ ОБСЛУЖИВАНИЯ ТРЕБОВАНИЙ
  93. Graph-Theoretic Problems and Their New Applications
  94. Exact and Heuristic Scheduling Algorithms
  95. A control approach to scheduling flexibly configurable jobs with dynamic structural-logical constraints
  96. Proactive Scheduling and Reactive Real-Time Control in Industry 4.0
  97. Polynomially Solvable Subcases for the Approximate Solution of Multi-machine Scheduling Problems
  98. Special Issue on Exact and Heuristic Scheduling Algorithms
  99. On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems
  100. A genetic algorithm for total graph coloring
  101. Integrated detection of disruption scenarios, the ripple effect dispersal and recovery paths in supply chains
  102. Blockchain-oriented dynamic modelling of smart contract design and execution in the supply chain
  103. Editorial of a special issue
  104. Scheduling of operating rooms in hospitals
  105. Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine
  106. Correction: Ungson, Y. et al. Filling of Irregular Channels with Round Cross-Section: Modeling Aspects to Study the Properties of Porous Materials. Materials 2018, 11, 1901
  107. The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: Two robust bi-objective models
  108. Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines
  109. Minimizing the Makespan on Two Identical Parallel Machines with Mold Constraints
  110. ЭВРИСТИЧЕСКИЕ АЛГОРИТМЫ ДЛЯ МАКСИМИЗАЦИИ ДОХОДА И КОЛИЧЕСТВА ТРЕБОВАНИЙ, ОБСЛУЖИВАЕМЫХ НА ПАРАЛЛЕЛЬНЫХ ПРИБОРАХ
  111. On Scheduling Problems with Forbidden Stack-Overflows
  112. A Permutation-Based Heuristic Method for the Blocking Job Shop Scheduling Problem
  113. The Optimality Box and Region for Single-Machine Scheduling of a Set of Jobs with Uncertain Durations
  114. TIME RESTRICTION ASPECTS IN THE MODELING OF CYBER-PHYSICAL SYSTEMS FOR INDUSTRY 4.0
  115. COLLISIONS OF PARTICLES IN LIMITED SPACE ANALYZED BY MOLECULAR DYNAMICS METHODS
  116. Filling of Irregular Channels with Round Cross-Section: Modeling Aspects to Study the Properties of Porous Materials
  117. Editorial of a Special Issue
  118. Algorithms for Scheduling Problems
  119. A genetic algorithm for hybrid job-shop scheduling problems with minimizing the makespan or mean flow time
  120. This is the editorial of an open access special issue with 11 papers in the scheduling area.
  121. Incorporating supplier selection and order allocation into the vehicle routing and multi-cross-dock scheduling problem
  122. A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization
  123. Optimality box in uncertain data
  124. Flexible job shop scheduling with lot streaming and sublot size optimisation
  125. Material handling tools for a discrete manufacturing system: A comparison of optimization and simulation
  126. Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
  127. A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs
  128. A new effective dynamic program for an investment optimization problem
  129. Graphs with maximal induced matchings of the same size
  130. Integrated demand-responsive scheduling of maintenance and transportation operations in military supply chains
  131. Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
  132. Schedule robustness analysis with the help of attainable sets in continuous flow problem under capacity disruptions
  133. Recent advances on modelling of structures of multi-component mixtures using a sphere packing approach
  134. On a generalized single machine scheduling problem with time-dependent processing times**Supported by RFBR grants 13-01-12108, 15-07-07489, 15-07-03141 and DAAD grant A/1400328
  135. Tessellation for modeling
  136. Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances
  137. A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0
  138. Corrigendum
  139. Minimising interference for scheduling two parallel machines with a single server
  140. Minimizing total weighted completion time approximately for the parallel machine problem with a single server
  141. Guest Editorial
  142. A new graphical approach for solving single-machine scheduling problems approximately
  143. Scheduling unrelated machines with two types of jobs
  144. A Graphical Approach to Solve an Investment Optimization Problem
  145. Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server
  146. Block models for scheduling jobs on two parallel machines with a single server
  147. Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
  148. Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
  149. A note on the paper ‘Single machine scheduling problems with financial resource constraints: Some complexity results and properties’ by E.R. Gafarov et al.
  150. Erratum to: Minimizing total tardiness on parallel machines with preemptions
  151. Solving a job-shop scheduling problem by an adaptive algorithm based on learning
  152. The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data
  153. A Graphical Approach for Solving Single Machine Scheduling Problems Approximately
  154. Makespan Minimization for a Two-Machine Scheduling Problem with a Single Server
  155. Single machine total tardiness maximization problems: complexity and algorithms
  156. Measures of problem uncertainty for scheduling with interval processing times
  157. Guest Editorial
  158. Soft due window assignment and scheduling of unit-time jobs on parallel machines
  159. A Graphical Approach to Solve Combinatorial Problems: Algorithms and Some Computational Results
  160. A polynomially solvable case of a single machine scheduling problem when the maximal job processing time is a constant
  161. Calculation of the stability radius of an optimal line balance
  162. Near to Optimal Size Selection in Combinatorial Circuits
  163. Polynomial algorithms for scheduling jobs with two processing times on unrelated machines
  164. Search on the enumeration tree in the multiprocessor job-shop problem
  165. Graphs with Maximal Induced Matchings of the Same Size
  166. Approximability results for the resource-constrained project scheduling problem with a single type of resources
  167. Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
  168. A note on a single machine scheduling problem with generalized total tardiness objective function
  169. The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
  170. The complexity of dissociation set problems in graphs
  171. Single machine scheduling problems with financial resource constraints: Some complexity results and properties
  172. Parallel machine problems with equal processing times: a survey
  173. Batching for work and rework processes on dedicated facilities to minimize the makespan
  174. Algorithms for some maximization scheduling problems on a single machine
  175. Minimizing total weighted completion time with uncertain data: A stability approach
  176. Scheduling with multiple servers
  177. Foreword to the thematical issue devoted to the seventieth anniversary of Academician V.S. Tanaev
  178. Minimizing total tardiness on parallel machines with preemptions
  179. Minimizing the number of machines for scheduling jobs with equal processing times
  180. Preemptive scheduling on uniform machines to minimize mean flow time
  181. A graphical realization of the dynamic programming method for solving
  182. Algorithms for special cases of the single machine total tardiness problem and an application to the even–odd partition problem
  183. A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
  184. On a parallel machine scheduling problem with equal processing times
  185. Hierarchical Scheduling of Mobile Robots in Production-Transportation Supply Chains
  186. On the Complexity of Dissociation Set Problems in Graphs
  187. Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times
  188. Scheduling Jobs with Equal Processing Times
  189. Hamiltonian properties of triangular grid graphs
  190. Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
  191. Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
  192. Using Simulated Annealing for Open Shop Scheduling with Sum Criteria
  193. Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
  194. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
  195. Problem F2∥Cmax with forbidden jobs in the first or last position is easy
  196. Complexity of shop-scheduling problems with fixed number of jobs: a survey
  197. A note on the two machine job shop with the weighted late work criterion
  198. Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
  199. Batching work and rework processes with limited deterioration of reworkables
  200. Mathematics of Economics and Business
  201. Book Review: Michael L. Pinedo (2005): ISBN 0-387-22198-0, Springer, New York
  202. SEQUENCE-DEPENDENT SETUP AND CLEAN-UP TIMES IN A TWO-MACHINE JOB-SHOP WITH MINIMIZING MAKESPAN
  203. A COMPARISON OF HEURISTICS FOR MEAN FLOW TIME OPEN SHOP SCHEDULING
  204. A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
  205. The two-machine flow-shop problem with weighted late work criterion and common due date
  206. Positive half-products and scheduling with controllable processing times
  207. Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date
  208. Mean flow time minimization with given bounds of processing times
  209. Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey
  210. On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
  211. Open shop scheduling problems with late work criteria
  212. Two-Machine Flow Shop Scheduling with Nonregular Criteria
  213. Flow Shop Scheduling with Late Work Criterion – Choosing the Best Solution Strategy
  214. Two-machine open shop scheduling with secondary criteria
  215. Heuristics for hybrid flow shops with controllable processing times and assignable due dates
  216. Scheduling Problems and Mixed Graph Colorings
  217. Local search heuristics for two-stage flow shop problems with secondary criterion
  218. Complexity results for parallel machine problems with a single server
  219. A heuristic algorithm for minimizing mean flow time with unit setups
  220. Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
  221. Minimizing total flow time in a two-machine flowshop problem with minimum makespan
  222. Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals
  223. Complexity of mixed shop scheduling problems: A survey
  224. On the Solution of 2-Machine Flow Shop Problems With a Common Due Date
  225. Scheduling with Deadlines and Nested Processing Intervals for a Single Machine
  226. Total Late Work Criteria for Shop Scheduling Problems
  227. A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
  228. On the application of insertion techniques for job shop problems with setup times
  229. Heuristics for generalized shop scheduling problems based on decomposition
  230. Stability Radius of an Optimal Schedule: A Survey and Recent Developments
  231. Parallel machine scheduling problems with a single server
  232. Optimal makespan scheduling with given bounds of processing times
  233. Stability of an optimal schedule in a job shop
  234. A polynomial approximation scheme for problem F2/rj/Cmax
  235. Improving local search heuristics for some scheduling problems. Part II
  236. Single machine scheduling with deadlines, release and due dates
  237. Stability of a schedule minimizing mean flow time
  238. Heuristics for permutation flow shop scheduling with batch setup times
  239. Improving local search heuristics for some scheduling problems—I
  240. Adaptive scheduling algorithm based on mixed graph model
  241. Book reviews
  242. Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
  243. A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
  244. A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
  245. A polynomial algorithm for an open shop problem with unit processing times and tree constraints
  246. Insertion techniques for the heuristic solution of the job shop problem
  247. On the solution of determinantal systems of linear inequalities
  248. Optimal schedules with infinitely large stability radius∗
  249. A strongly polynomial algorithm for a new class of linear inequalities1
  250. single Machine Preemptive Scheduling With Special Cost Functions1
  251. Book reviews
  252. A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem
  253. Scheduling unit time open shops to minimize the weighted number of late jobs
  254. On the heuristic solution of the permutation flow shop problem by path algorithms
  255. Constructive heuristic algorithms for the open shop problem
  256. A branch and bound algorithm for minimizing weighted completion times with deadlines
  257. On the combinatorial structure of the permutation flow shop problem
  258. Some relations between neighbourhood graphs for a permutation problem
  259. A locally optimal insertion heuristic for a one-machine scheduling problem
  260. Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
  261. On the method of interchanging networks for permutation problems
  262. The job - shop problem - modelling by latin rectangles, exact and heuristic solution
  263. Stability of Optimal Line Balance with Given Station Set
  264. Parallel scheduling algorithm to minimize maximal cost