Question

Code for in a building there are some lifts. Optimize the allocation of lift

Say there are requests and M s Minimize the main request waiting time

Rules of lit allocation

1) One needs to a n indexes to lifts ie decide lift , 2, etc apriori

ONLINE EDITOR (E)

2) Since alL requests are known apni decide the initial (at time t - 0) location of lift such that it will help in minimizing ting time a) Even it all the requests time are known apriori, other than initial time to the waiting lifts cannot be moved towards target float until the request i d

4) Aer a request is used for optimality calculation even a lift is in transit it can be considered for serving that request

5) it at any moment more than one lift can serve the request with same waiting time, give preference to the lift with wide and a partir request in 2 seconds, then prefer over it

6) Neglect the time required to get in and get out of a line ng a request it would not stop in between if would finally stop at destination of that request

7) Once a start i ) The speed of it is floor/second​

Answer 1

Answer:

I CAN'T UNDERSTAND

Explanation:

PLEASE MARK ME AS BRAINLIST.