Batch-size-based rearrangement of the shop floor into mini-lines

摘要: We study the allocation of machines in a job shop environment to groups jobs so as obtain collection disjoint production lines minimising overall cycle time. Jobs are often grouped according similarities based on functionality or process, but some settings it makes more sense group batch size exploit differences setup and run times among technologies machine types. formulate model find an optimal partition assignment groups. show that problem is hard heuristic genetic algorithms approximate solutions.