66
IGNALL, E.; SCHRAGE, L. E. Application of the branch-and-bound technique to some
flowshop problems. Oper. Res. 13, 1965, 400–412, MathSciNet.
JOHNSON, S. M. Optimal two- and three-stage Production Schedules with set-up times
included. Naval Research Logistics Quartely, 1, 61-68, 1954.
KNUTH, D. E. The Art of Computer Programming. 2. ed., v3. Addison-Wesley Professional,
1973.
LADHARI, T.; HAOUARI, M. A computational study of the permutation flow shop problem
based on a tight lower bound. Computers and Operations Research, 2005, v.32 n.7, 1831-
1847.
LAGEWEG, B. J. et al. A general bounding scheme for the permutation flow-shop problem.
Operations Research, 26, 1978, 53–67.
______. Computer-aided complexity classification of deterministic scheduling problems.
Report BW 138, Mathematisch Centrum, Amsterdam, 1981.
LOMNICKI, L. A branch and bound algorithm for the exact solution of the three-machine
scheduling problem. Operational Research Quarterly, 16, 1965.
McMAHON, G. B.; BURTON, P. G. Flow-shop scheduling with the branch-and-bound
method. Operations Research,15, n. 3, 1967, 473–481.
PALMER, D. S. Sequencing jobs through a multi-stage process in the minimum total time—a
quick method of obtaining a near optimum. Operational Research Quarterly, 16, 1965, 101–
107.
PINEDO, M. Scheduling: Theory, Algorithms, and Systems. Second edition, Prentice-Hall,
New Jersey, 2002.
POTTS, C. N. An adaptive branching rule for the permutation flow-shop problem. European
Journal of Operational Research, 1980;5:19-25.
RÖCK, H.; SCHMIDT, G. Machine aggregation heuristics in shop scheduling. Methods of
Operations Research, 45, 1982, 303–314.
RUIZ, R.; MAROTO, C. A comprehensive review and evaluation of permutation flowshop
heuristics. European Journal of Operational Research, 165, 2005.
TAILLARD,
É. D. Benchmarks for basic scheduling problems. European Journal of
Operational Research, 64, 1993, 278 285.