A Scenario-Based Branch-and-Bound Approach for MES Scheduling in Urban Buildings
نویسندگان
چکیده
منابع مشابه
A modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
A Branch-and-Bound Method for the Optimal Scheduling
This paper presents a new approach to the scheduling problem in high level synthesis. In this approach, iterative rescheduling processes are performed in a branch-andbound manner, starting with the as soon as possible scheduling result, so as to find the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the candidate nodes are selected...
متن کاملA Branch-and-bound Algorithm for Parallel Machine Scheduling Problems
In this paper, a Branch-and-Bound (B&B) algorithm is presented to solve the problem of minimizing the maximum completion time Cmax on unrelated parallel machines with machine eligibility restrictions when job preemption is not allowed. A customized lower bound, a search and a branching strategy are developed for the B&B. A machine eligibility factor is also introduced to represent the percentag...
متن کاملA Mixed Branch-and-bound and Neural Network Approach for the Broadcast Scheduling Problem
In this paper we proposed a mixed method to solve the broadcast scheduling problem in packet radio networks. Due to the two objectives of this problem, a twostage optimization process is adopted. In order to obtain a optimal time slot number, we use an exact method, branch-and-bound algorithm to search the whole solution space in the first stage and obtain the minimal TDMA cycle length. In the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Industrial Informatics
سال: 2020
ISSN: 1551-3203,1941-0050
DOI: 10.1109/tii.2020.2978870