On modelling the maximum workload allocation for parallel unrelated machines with setups

摘要: Consider a manufacturing process in which group of machines (or people) perform single operation on number different parts. The processing time depends both the part and machine. In addition, each machine requires significant setup between types. problem consists obtaining feasible allocation parts to such that makespan (i.e. greatest workload) is minimized. We present two equivalent 0–1 models. first model arises by considering assignment individual machines. It amenable Lagrangian decomposition techniques. second more hierarchical nature; it considers options assigning an entire type machine, or splitting across than branch-and-bound report about our computational experience for finding lower bounds optimal solution appending violated cuts and, ultimately, real-life problems.