Simulated annealing for permutation flow-shop scheduling

Bestwick, 1976, A new bound for machine scheduling, Opl Res. Q., 27, 479, 10.1057/jors.1976.93 Campbell, 1970, A heuristic algorithm for the n job, m machine sequencing problem, Mgmt Sci., 16, B630, 10.1287/mnsc.16.10.B630 Dannenbring, 1977, An evaluation of flowshop sequencing heuristics, Mgmt Sci., 23, 1174, 10.1287/mnsc.23.11.1174 Garey, 1976, The complexity of flowshop and jobshop scheduling, Math. Ops Res., 1, 117, 10.1287/moor.1.2.117 Hajek, 1988, Cooling schedules for optimal annealing, Math. Ops Res., 13, 311, 10.1287/moor.13.2.311 Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Res. Logist. Q., 1, 61, 10.1002/nav.3800010110 Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 Lenstra, 1977, Complexity of machine scheduling problems, Ann. Discrete Math., 1, 343, 10.1016/S0167-5060(08)70743-X Lundy, 1986, Covergence of an annealing algorithm, Math. Prog., 34, 111, 10.1007/BF01582166 Metropolis, 1953, Equation of state calculations by fast computing machines, J. Chem. Phys., 21, 1087, 10.1063/1.1699114 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, 11, 91, 10.1016/0305-0483(83)90088-9 Palmer, 1965, Sequencing jobs through a multistage process in the minimum total time—a quick method of obtaining a near optimum, Opl Res. Q., 16, 101, 10.1057/jors.1965.8 Potts, 1980, An adaptive branching rule for the permutation flow-shop problem, Eur. J. Opl Res., 5, 19, 10.1016/0377-2217(80)90069-7 Turner, 1987, Comparison of heuristics for flow shop sequencing, Omega, 15, 75, 10.1016/0305-0483(87)90054-5 Van Laarhoven, 1987