3PETER B, BEMD J, BEMDS. A branch and bound algorithm for the job - shop scheduling problem[J]. Discrete Appl. Math. 1994, (49): 107 - 227.
4L. WANG L. ZHANG DA - ZHONG ZHENG. A Class of Orderbased Genetic Algorithm for Flow Shop Scheduling[ J]. Int J Adv ManufTechnol,2003, (22) :828 - 835.
5R. HEILMANN. A branch- and - bound procedure for the multimode resource - constrained project scheduling problem with minimum and maximum time lags[ J ]. European Journal of Operational Research, 2003, (144): 348- 365.
6HURINK J TABU, KNUST SIGRID. search algorithms for job - shop problems with a single transport robot [ J ]. From Theory to Application. 2005,(4) :99- 111.
7DIMITRIS BERTSIMAS, JAY SETHURAMAN. From Fluid Relaxations to Practical Algorithms for Job Shop Scheduling[ J]. the Makespan Objective. Math. Program, Ser. A, 2002,(92):61 - 102.
