Learn More
This paper investigates scheduling parallel machines with a single sever as well as additional constraints on setups and removals. It generalizes classical parallel machine scheduling problem with a single server which needs to perform setup operation of each job only. This model is motivated by a key course of batch annealing process in the steel industry:(More)
The paper researches a scheduling method based on variable neighborhood search (VNS) for a dynamic crane scheduling problem abstracted from steel making process in the iron and steel enterprise with random torpedo car arrivals and empty ladle breakdowns. Our objective is to minimize both makespan and total tardiness. At any rescheduling point, weights(More)
  • 1