Baker K.R. (1974), Introduction to Sequencing and Scheduling; John Wiley & Sons, Inc.; New York,
 Bilge U., Kirac F., Kurtulan M., Pekgun P. (2004), A tabu search algorithm for parallel machine total
tardiness problem; Computers & Operations Research 31(3); 397-414.
 Bulbul k., Kaminsky P., Yano C. (2004), Flow Shop scheduling with earliness, tardiness, and
intermediate inventory holding cost; Naval Logistics 51; 407-445.
 Carroll D.C. (1965), Heuristic sequencing of jobs with single & multiple components; Ph.D.
dissertation, Sloan School of Management; Massachusetts Institute of Technology, Mass.
 Chio S.W., Lee G.C., Kim Y.D. (2005), Minimizing total tardiness of orders with reentrant lots in a
hybrid flow shop; International Journal of Production Research 43(11); 2149-2167.
 Ghessemi-Tari F., Olfat L. (2004), Two COVERT based algorithms for solving the generalized flow
shop problems; Proceeding of the 34th International Conference on Computers and Industrial
 Ghessemi-Tari F., Olfat L. (2007), Development of a set of algorithms for the multi-projects
scheduling problems; Journal of Industrial and Systems Engineering 1(1); 11-17.
 Gupta N.D., Kruger K., Lauff V., Werner F., Sotskov Y.N. (2002), Heuristics for hybrid flow shops
with controllable processing times and assignable due dates; Computers & Operations Research
 Lauff V., Werner F. (2004), On the complexity and some properties of multi-stage scheduling
problems with earliness and tardiness penalties; Computers & Operations Research 31(3); 317-345.
 Lee G.C., Kim Y.D. (2004), A branch and bound for a two stage hybrid flow shop scheduling problem
minimizing total tardiness; International Journal of Production Research 42(22); 4731-4743.
 Lin H.T., Liao C.J. (2003), A case study in a two-stage hybrid flow shop with setup time and dedicated
machines; International Journal of Production Economics 86(2); 133-143.
 Takaku K., Yura K. (2005), Online scheduling aiming to satisfy due date for flexible flow shops;
JSME International Journal Series C 48(1); 21-25.
 Yeh W., Allahverdi A. (2004), A branch and Bound algorithm for the three machine flow shop
scheduling problem with bi-criteria of make-span and total flow time; International Transaction in
Operations Research 11(30); 323-327.