In a disaster scenario, relief items distribution is required as early as possible for the disaster victims to reduce the associated risks. For the distribution tasks, an effective and efficient relief items distribution model is essential to generate relief items distribution schedules to...

Workflow scheduling aims to optimize task allocation and execution in cloud-fog​ computing environments. Finding an optimal algorithm for workflow scheduling poses a significant challenge due to the complexity and variability of tasks and resources involved. Although meta-heuristic algorithms...

Upon the latest reform to the college entrance examination in China (i.e., Gaokao), high schools began implementing an optional class system. Under this scheme, students' time slots become complex, thereby increasing the difficulty in formulating a suitable timetable from the available ones. To...

Open shop scheduling problems (OSSP) are highly significant in engineering and industry, involving critical scheduling challenges. The job type determines the duration required for material transfer between machines and remains unaffected by distance, eliminating any waiting time for transfers....

To complete a successful energy project, all aspects and criteria which can influence the project should be considered. Classic time-cost trade-off (TCT) is used when the completion time of project is not acceptable for customers or top managers. This paper proposes a new...

This special issue of Business Systems Research (SI of the BSR) is co-published by the Slovenian Society INFORMATIKA - Section for Operational Research (SSI-SOR) and highlights recent advances in Operations Research and Management Science (OR /MS), with a focus on linking OR /MS with other areas...

Portfolio optimization is a pertinent topic of significant importance in the financial literature. During the portfolio construction, an investor confronts two important steps: portfolio selection and portfolio allocation. This article seeks to investigate portfolio optimization based on the...

The All-pairs shortest path problem (ALL-SPP) aims to find the shortest path joining all the vertices in a given graph. This study proposed a new optimal method, Dhouib-matrix-ALL-SPP (DM-ALL-SPP) to solve the ALL-SPP based on column-row navigation through the adjacency matrix. DM-ALL-SPP is...