Article
Engineering, Manufacturing
Farzad Zaerpour, Marco Bijvank, Huiyin Ouyang, Zhankun Sun
Summary: This study proposes a novel approach to physician scheduling in emergency departments, aiming to reduce patient wait times by considering the heterogeneity among physicians and the stochastic nature of patient arrivals and physician productivity. The research finds that individual physicians, shift hours, and shift types are determining factors of ED productivity. Simulation results show that the new scheduling method can significantly decrease patient wait times compared to the current system.
PRODUCTION AND OPERATIONS MANAGEMENT
(2022)
Article
Operations Research & Management Science
Feifeng Zheng, Zhaojie Wang, Ming Liu
Summary: With the rapid development of battery electric buses (BEBs) in urban public traffic, the problem of BEB charging scheduling arises. Both weather temperature and accumulative battery using time have a significant impact on battery charging efficiency, leading to uncertainty in charging time which can negatively affect the departure schedule of the BEBs. This study aims to minimize the expected total charging cost by establishing a stochastic linear programming model and proposing improved algorithms.
OPERATIONAL RESEARCH
(2022)
Article
Management
Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui
Summary: A fast re-scheduling heuristic is developed in this study to correct minor disruptions in a retail industry context, achieving a good compromise between cost and number of shift changes.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Engineering, Industrial
Huaxing Zhong, Min Liu, La Bao
Summary: This paper introduces a job-priority based soft scheduling approach for the uncertain scheduling problem in the semiconductor manufacturing field. It consists of an offline optimization layer and an online dispatching layer. The results show that the two-layer soft scheduling mechanism can effectively adapt to uncertain production environments.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2022)
Article
Operations Research & Management Science
Hongbo Li, Hanyu Zhu, Linwen Zheng, Fang Xie
Summary: The main resources in software projects are human resources equipped with various skills, which makes software development a typical intelligence-intensive process. Therefore, effective human resource scheduling is indispensable for the success of software projects. We investigate the software project scheduling problem with uncertain activity durations (SPSP-UAD) and aim at obtaining effective scheduling policies for the problem.
ANNALS OF OPERATIONS RESEARCH
(2023)
Article
Engineering, Electrical & Electronic
Cui-Qin Dai, Chong Li, Shu Fu, Jian Zhao, Qianbin Chen
Summary: This paper proposes a real-time dynamic scheduling scheme to address the conflict between emergency tasks and common tasks in space data relay network in terms of antenna resource allocation, aiming to improve scheduling efficiency. Experimental results demonstrate that the proposed scheme can guarantee timely transmission of emergency tasks and enhance scheduling efficiency.
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
(2021)
Article
Engineering, Electrical & Electronic
Magdiel Schmitz, Daniel Pinheiro Bernardon, Vinicius Jacques Garcia, William Ismael Schmitz, Martin Wolter, Luciano Lopes Pfitscher
Summary: This article proposes a mathematical model for co-optimization of price-based DOPF and emergency order scheduling problems to minimize costs. The algorithm systematically improves solutions by tracking progress and releasing routes.
IEEE TRANSACTIONS ON SMART GRID
(2021)
Article
Computer Science, Hardware & Architecture
Kevin Zagalo, Yasmina Abdeddaim, Avner Bar-Hen, Liliana Cucu-Grosjean
Summary: In this paper, it is proven that a mean system utilization smaller than one is a necessary condition for the feasibility of real-time systems. Stable systems, which have two distinct states, a transient state and a steady-state, are defined as systems where the same distribution of response times is repeated infinitely for each task. The Liu and Layland theorem is proved to hold for stable probabilistic real-time systems with implicit deadlines, and an analytical approximation of response times for each of those two states is provided, along with a bound of the instant when a real-time system becomes steady.
IEEE TRANSACTIONS ON COMPUTERS
(2023)
Article
Operations Research & Management Science
Jian-Jun Wang, Zongli Dai, Wenxuan Zhang, Jim Junmin Shi
Summary: This paper focuses on the research of operating room scheduling under non-operating room anesthesia (NORA) mechanism, in the presence of the uncertainty of emergency arrivals. It is shown through experiments that the NORA mechanism can significantly improve the operating room utilization in comparison with traditional surgical anesthesia practice under different operating room settings.
ANNALS OF OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Matan Atsmony, Gur Mosheiov
Summary: This study focuses on scheduling problems with linearly deteriorating job processing times, introducing a new lower bound on optimal total completion time that proves to be highly accurate through numerical comparisons. The complexity status of single machine and parallel identical machine settings in these problems has been an open question for the last thirty years.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Mathematics
Yi-Chun Wang, Ji-Bo Wang
Summary: This paper investigates single-machine scheduling problems with resource allocation and time-dependent learning effect. The actual processing time of a job depends on the sum of normal processing times of previous jobs and the allocation of non-renewable resources. The goal is to determine the optimal schedule and resource allocation using convex resource consumption function. Three problems with two criteria are studied, and some special cases can be solved in polynomial time. Furthermore, accurate and intelligent algorithms are proposed to solve these problems.
Article
Management
Xueqi Wu, Shenghai Zhou
Summary: This paper addresses the problem of sequencing and scheduling appointments on multiple servers with stochastic service durations and customer arrivals. By formulating it as a two-stage integer program and deriving a deterministic mixed-integer linear program, the paper provides solutions to minimize the operational cost and improve system performance. The proposed integer L-shaped heuristic, enhanced by variable neighborhood descent, outperforms the deterministic program and integer L-shaped method, especially for large-scale problems, demonstrating significant impacts of appointment sequencing decisions on reducing operational cost.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
(2022)
Article
Computer Science, Hardware & Architecture
Sanjay Moulik, Zinea Das, Rajesh Devaraj, Shounak Chakraborty
Summary: The research presents a low-overhead heuristic strategy named SEAMERS for DVFS based energy aware scheduling on a heterogeneous multicore platform, which improves energy savings and resource utilization compared to state-of-the-art methods.
JOURNAL OF SYSTEMS ARCHITECTURE
(2021)
Article
Computer Science, Information Systems
Yutong Zhang, Jing Liu
Summary: This paper focuses on a multiperiod online decision-making problem for emergency logistics, using a multi-trip cumulative capacitated vehicle routing problem with uncertain transportation time as the basic model. A multiobjective evolutionary algorithm (MOEA) is employed to consider the tradeoff between transportation efficiency and the unknown transport time discovery rate. Experimental results show that the hybrid strategy, MOEA+MA, can achieve the best result in more than half of the cases, demonstrating the necessary balance between obtaining information and transportation efficiency.
Article
Computer Science, Information Systems
Ruijiu Mao, Vaneet Aggarwal
Summary: This article presents an approximation algorithm for weighted expected completion time in non-preemptive stochastic coflow scheduling. The algorithm uses a time-indexed linear program relaxation and its solution to generate a feasible schedule, achieving certain approximation ratios depending on release times and server numbers.
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT
(2021)
Article
Computer Science, Interdisciplinary Applications
Xiaolin Wang, Liyi Zhan, Yong Zhang, Teng Fei, Ming-Lang Tseng
Summary: This study proposes an environmental cold chain logistics distribution center location model to reduce transportation costs and carbon emissions. It also introduces a hybrid arithmetic whale optimization algorithm to overcome the limitations of the conventional algorithm.
COMPUTERS & INDUSTRIAL ENGINEERING
(2024)
Article
Computer Science, Interdisciplinary Applications
Hong-yu Liu, Shou-feng Ji, Yuan-yuan Ji
Summary: This study proposes an architecture that utilizes Ethereum to investigate the production-inventory-delivery problem in Physical Internet (PI), and develops an iterative heuristic algorithm that outperforms other algorithms. However, due to gas prices and consumption, blockchain technology may not always be the optimal solution.
COMPUTERS & INDUSTRIAL ENGINEERING
(2024)
Article
Computer Science, Interdisciplinary Applications
Paraskevi Th. Zacharia, Elias K. Xidias, Andreas C. Nearchou
Summary: This article discusses the assembly line balancing problem in production lines with collaborative robots. Collaborative robots have the potential to improve automation, productivity, accuracy, and flexibility in manufacturing. The article explores the use of a problem-specific metaheuristic to solve this complex problem under uncertainty.
COMPUTERS & INDUSTRIAL ENGINEERING
(2024)