All Stories

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