A three-machine permutation flow-shop problem with minimum makespan on the second machine - Yanai, S; Fujie, T (The Journal of the Operational Research Society, 2006)
Keywords: Algorithms; Applied sciences; branch-and-bound algorithm; Exact sciences and technology; Experiments; flow-shop scheduling; Heuristics; hierarchical criteria; Integer programming; Integers; Job shops; Manufacturing; Mathematical permutation; Mathematical programming; multicriteria scheduling; Objective functions; Operational research and scientific management; Operational research. Management science; Operations research; Optimal solutions; Polynomials; Production scheduling; Ratios; Schedules; Scheduling; Scheduling, sequencing; Simulated annealing; Studies; Theoretical Papers; Branching; hierarchical criteria; Multicriteria analysis; Branch and bound method; Permutation; Dominance; Mixed integer programming; Scheduling; Makespan; Polynomial time; multicriteria scheduling; Minimum time; flow-shop scheduling; branch-and-bound algorithm; NP hard problem; Flow shop; Objective function; Completion time