All Stories

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