Scheduling: Algorithms and Real-World Applications

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Combinatorial Optimization, Graph, and Network Algorithms".

Deadline for manuscript submissions: 31 July 2024 | Viewed by 509

Special Issue Editor


E-Mail Website
Guest Editor
Czech Institute of Informatics Robotics and Cybernetics, Czech Technical University in Prague, 16636 Prague, Czech Republic
Interests: production planning and scheduling

Special Issue Information

Dear Colleagues,

We are thrilled to invite you to contribute to our upcoming Special Issue on "Scheduling: Algorithms and Real-World Applications" We actively seek the latest advancements in scheduling algorithms and their diverse applications, encouraging researchers, academicians, and professionals to share their expertise and insights, enriching our understanding of this evolving field. The Special Issue aims to bring together cutting-edge research, focusing on both theoretical and practical applications of scheduling algorithms. We welcome contributions exploring innovative scheduling methodologies to address the varied demands of modern industries and services, including novel scheduling algorithms, metaheuristic and optimization techniques, and machine learning approaches for scheduling. This Special Issue extends scope beyond traditional scheduling domains like manufacturing, energy markets, healthcare, transportation, and logistics,  to emerging technologies and realms such as cloud manufacturing, data center scheduling, adaptive scheduling, real-time scheduling for cyber-physical systems, digital twin-based scheduling, scheduling in the Internet of Things (IoT), quantum computing, and blockchain. Join us in shaping the discourse on "Scheduling: Algorithms and Real-World Applications" by submitting your groundbreaking research. Together, let us deepen our understanding of scheduling algorithms and their new practical applications. Your insights will play a crucial role in advancing the conversation in this field.

We look forward to receiving your submissions and appreciate your active involvement in shaping this Special Issue.

Dr. Mohammad Rohaninejad
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • metaheuristics algorithms
  • exact algorithms
  • heuristic methods for scheduling
  • machine learning in scheduling
  • hybrid optimization techniques for scheduling
  • multi-objective scheduling
  • agent-based scheduling
  • robust scheduling
  • data-driven scheduling
  • fuzzy logic in scheduling
  • dynamic scheduling algorithms
  • predictive and reactive scheduling
  • swarm intelligence in scheduling
  • decision support systems for scheduling
  • real-time scheduling
  • constraint-based scheduling
  • game theory for scheduling
  • network-based scheduling
  • scheduling problems in manufacturing, energy markets, healthcare
  • transportation, and logistics, supply chain, etc.
  • scheduling problems in emerging technologies

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

25 pages, 3881 KiB  
Article
Logical Execution Time and Time-Division Multiple Access in Multicore Embedded Systems: A Case Study
by Carlos-Antonio Mosqueda-Arvizu, Julio-Alejandro Romero-González, Diana-Margarita Córdova-Esparza, Juan Terven, Ricardo Chaparro-Sánchez and Juvenal Rodríguez-Reséndiz
Algorithms 2024, 17(7), 294; https://doi.org/10.3390/a17070294 - 5 Jul 2024
Viewed by 217
Abstract
The automotive industry has recently adopted multicore processors and microcontrollers to meet the requirements of new features, such as autonomous driving, and comply with the latest safety standards. However, inter-core communication poses a challenge in ensuring real-time requirements such as time determinism and [...] Read more.
The automotive industry has recently adopted multicore processors and microcontrollers to meet the requirements of new features, such as autonomous driving, and comply with the latest safety standards. However, inter-core communication poses a challenge in ensuring real-time requirements such as time determinism and low latencies. Concurrent access to shared buffers makes predicting the flow of data difficult, leading to decreased algorithm performance. This study explores the integration of Logical Execution Time (LET) and Time-Division Multiple Access (TDMA) models in multicore embedded systems to address the challenges in inter-core communication by synchronizing read/write operations across different cores, significantly reducing latency variability and improving system predictability and consistency. Experimental results demonstrate that this integrated approach eliminates data loss and maintains fixed operation rates, achieving a consistent latency of 11 ms. The LET-TDMA method reduces latency variability to approximately 1 ms, maintaining a maximum delay of 1.002 ms and a minimum delay of 1.001 ms, compared to the variability in the LET-only method, which ranged from 3.2846 ms to 8.9257 ms for different configurations. Full article
(This article belongs to the Special Issue Scheduling: Algorithms and Real-World Applications)
Show Figures

Figure 1

Back to TopTop