文档介绍：Logistics Systems Analysis
You are working for ABC pany. Suppose the short-term demand rate is known in the form: for and time units. The fixed cost for each shipment is $2400. The waiting cost per unit of time and per item, , is $1. Use MATLAB or other puter programs of yours to determine the optimal sequence of dispatching headways such that the total cost (fixed cost plus waiting cost) is minimized. (Hint: use the strategy discussed in section ) Assume that the rent cost is negligible. You need to:
Plot your solution graphically.
Calculate the optimal total cost numerically.
Calculate the optimal total cost based on the continuous approximation method.
Indicate on the plot the demand curve, the receiving step curve, and the area showing the total wait.
SOLUTION:
Choosing an initial point will trigger the sequence of dispatching headways. Different points of would determine different sequences.
Program the problem with MATLAB. The following is the code:
% this function is to draw the waiting area. The parameter dingdian means the left bound of each area, and qiedian means the right bound. The return value waiting means the waiting time (. the measure of the area) %
% %
function waiting=huatu(dingdian,qiedian)
waiting=0;
qian=round(dingdian*10)/10;
hou=round(qiedian*10)/10;
a=qian::hou;
num=round(10*(hou-qian)+1);
a(1)=dingdian;
ind1=nu