All Stories

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