A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops - SINGER, MARCOS; PINEDO, MICHAEL (IIE transactions, 1998)
Keywords: Algorithms; Applied sciences; Comparative analysis; Exact sciences and technology; Graph representations; Job shops; Mathematical programming; Operational research and scientific management; Operational research. Management science; Production scheduling; Scheduling; Scheduling, sequencing; Statistical analysis; Studies; Lower bound; Minimum time; Gantt chart; Statistical analysis; Branch and bound method; Job shop; Flow shop; Scheduling; Makespan; Graph theory; Precedence constraint; Due date