All Stories

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