All Stories

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