A Scheduling Problem in the Baking Industry

Algorithm 1

Upper bound to genetic algorithm.

begin

 /*Upper Bound/;

 𝑎𝑡=0;

 𝑣=0;

 foreach  𝑝∈𝑃  do

  foreach  𝑖∈{𝑛,…,1}|𝑒_𝑖∈𝐸  do

   𝑄𝑡𝑝𝑟𝑜𝑣(𝑝,𝑒_𝑗)=𝑄𝑡(𝑝,𝑒_𝑗);

   foreach  𝑗∈𝐷_𝑝,𝑖  do

    𝑣(𝑝,𝑐_𝑗)=min(𝑑(𝑝,𝑐_𝑗)−𝑎𝑡(𝑝,𝑐)𝑗,𝑄𝑡𝑝𝑟𝑜𝑣(𝑝,𝑒_𝑗));

    𝑄𝑡𝑝𝑟𝑜𝑣(𝑝,𝑒_𝑗)=𝑄𝑡𝑝𝑟𝑜𝑣(𝑝,𝑒_𝑗)−𝑣(𝑝,𝑐_𝑗);

    𝐿=𝐿+𝑣(𝑝,𝑐_𝑗)∗𝑙(𝑝,𝑐_𝑗);

    𝑎𝑡(𝑝,𝑐_𝑗)=𝑎𝑡(𝑝,𝑐_𝑗)+𝑣(𝑝,𝑐_𝑗);

   end

  end

 end

end