All Stories

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