algorithm - Scheduling / Queuing jobs with multiple different workers -


i have stream of jobs (so don't know upfront how many jobs). , have n workers in system.

now want schedule / queue job 1 worker (a worker can have multiple jobs in queue).

however, it's not case workers can equally jobs (think delivery -- delivery people closer pickup can job better further away). there 2 costs. first cost assign job x worker y (which varies each worker -- example time worker's location pickup point) , second cost of doing job (for eg. time pickup customer location).

it's alright re assign jobs 1 worker long have not started processing job (so jobs queued can "shuffled" amongst workers).

what's away assignment of jobs workers reduce cost (or in our example, time delivery) across jobs? doesn't have optimal.

one simple solution job comes in find worker can finish job fastest (it worker working on another, initial cost little -- eg. delivering item customer , pickup next item close by). not optimal.

then periodically, try , re assign queued orders swapping jobs between pairs of workers result in faster delivery (or rather least waiting time) of jobs. how this?


Comments

Post a Comment

Popular posts from this blog

minify - Minimizing css files -

i want know how css files can minimized. currently, using external sites css minifier compress css files. however, after removing whitespaces, comments, etc, file sizes reduced 10-15%. how frameworks bootstrap manage make minimized versions kilobytes. as example, css is: body { background-color: #ff0; } the reduction goes 28 bytes 22 bytes other css files have lot more characters still smaller this. actually minifying code means it's remove thing code white space characters new line characters comments block delimiters it reduces amount of code has transferred on web , speed site load fastly.but unreadable format.
Read more

neo4j - finding mutual friends in a cypher statement starting with three or more persons -

Image
i trying build cypher statement neo4j know 2-n starting nodes name , need find node (if any) can reached of starting nodes. at first tought similar "mutual friend" situation handled (start1)-[*..2]->(main)<-[*..2]-(start2) in case have more 2 starting points around 6 know name. so puzzled how can include third, fourth , on node cypher able find commmon root amongst them. in above example neo4j website need path starting 'dilshad', 'becky' , 'cesar' check if have common friend (anders) excluding 'filipa' , 'emil' not friends of three. so far create statement programmatically looks like match (start1 {name:'person1'}), (start2 {name:'person2'}), (start3 {name: 'person3'}), (main) (start1)-[*..2]->(main) , (start2)-[*..2]->(main) , (start3)-[*..2]->(main) return distinct main but wondering if there more elegant / efficient way in cypher possibly use list of names parameter ...
Read more

php - How to remove letter in front of the word laravel -

Image
based on picture above result of var_dump() , dd() of same variable ,when var_dump() , apostrophe (') symbol in black diamond of question mark , when dd() same variable , apostrophe can seen letter 'b' appear in front of words what want can me result : loreal's sdn bhd and @ same time want remove special character ( excluding these 4 symbols (-) ,(_) ,('),(,) ) simply escape special character resolve issue. mysqli_real_escape_string resolve issue. $name = mysqli_real_escape_string($request()->user); or use addslashes function() $name = addslashes($request()->user);
Read more