Minimizing the makespan for a serial-batching scheduling problem with arbitrary machine breakdown and dynamic job arrival