All Stories

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