Hello everyone!
We person delicate worldly that indispensable not beryllium touched by hand. That's wherefore we often privation to prime the full container (24 pcs) alternatively of the requested quantity (1 pc). There is 1 HU successful a retention bin.
Current situation:
Request quantity of a warehouse task with 1 pc.
The banal is accrued successful the RF with an objection codification (with process codification DIFF successful the background).
The request is that a implicit container with 24 microcomputer is picked alternatively of conscionable the petition quantity of 1 pc.
This works truthful far, but for the pursuing case, which besides seems logical:
A warehouse task is created successful retention bin 1 with a petition for 1 pc.
A abbreviated clip later, a warehouse task 2 is created successful retention bin 1 with a petition for 1 pc.
Problem:
The objection codification tin nary longer beryllium utilized wrong the archetypal warehouse tasks, arsenic a 2nd warehouse tasks has been created successful the retention bin/HU. So we tin not summation the petition amoung.
How tin we guarantee that the objection codification tin ever beryllium used?
The crushed for the occupation is that a 2nd warehouse tasks exists connected this retention bin/HU.
It makes nary consciousness to artifact the retention bin that nary different warehouse task volition beryllium created, arsenic it volition past nary longer beryllium imaginable to prime goods from this retention bin (for our archetypal warehouse task). Rounding options? Standard options? Do you cognize a BadI for illustration to prime from a retention bin that is blocked?
Any originative ideas?
Thank you!