Al-Anzi, F.S., & Allahverdi, A. (2005). Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests. Journal of Mathematical Modelling and Algorithms 4(4), 435–453.
Allahverdi, A. (2000). Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times. Computers & Operations Research 27(2), 111–127.
Allahverdi, A., & Al-Anzi, F.S. (2006). A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. European Journal of Operational Research 169(3), 767–780.
Allahverdi, A., Ng, C., Cheng, T.E., & Kovalyov, M.Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3), 985–1032.
Bertel, S., & Billaut, J.C. (2004). A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research 159(3), 651–662.
Brucker, P., Knust, S., & Wang, G. (2005). Complexity results for flow-shop problems with a single server. European Journal of Operational Research 165(2), 398–407.
Dudek, R.A., Panwalkar, S.S., & Smith, M.L. (1992). The lessons of flowshop scheduling research. Operations Research 40(1), 7–13.
Ford, F.N., & Bradbard, D. (1987). Use of operations research in production management. Production and Inventory Management 28(3), 59–63.
Glass, C.A., Shafransky, Y.M., & Strusevich, V.A. (2000). Scheduling for parallel dedicated machines with a single server. Naval Research Logistics 47(4), 304–328.
Grabowski, J., & Wodecki, M. (2004). A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research 31(11), 1891–1909.
Graves, S.C. (1981). A review of production scheduling. Operations Research 29(4), 646–675.
Guerrero, H., & Kern, G. (1988). How to more effectively accept and refuse orders. Production and Inventory Management 29(4), 59–63.
Johnson, S.M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1(1), 61–68.
Man, K.-F., Tang, K.-S., & Kwong, S. (1996). Genetic algorithms: concepts and applications. IEEE Transactions on Industrial Electronics 43(5), 519–534.
Nawaz, M., Enscore, E.E., & Ham, I. (1983). A heuristic algorithm for the M-machine, N-job flowshop sequencing problem. Omega—International Journal of Management Science 11(1), 91–95.
Ng, C., Allahverdi, A., Al-Anzi, F.S., & Cheng, T.E. (2007). The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times. International Journal of Operational Research 2(2), 135–155.
Nowicki, E., & Smutnicki, C. (1996). A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91(1), 160–175.
Ogbu, F.A., & Smith, D.K. (1990). The application of the simulated annealing algorithm to the solution of the n/m/C max flowshop problem. Computers & Operations Research 17(3), 243–253.
Onwubolu, G., & Davendra, D. (2006). Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171(2), 674–692.
Osman, I.H., & Potts, C.N. (1989). Simulated annealing for permutation flowshop scheduling. Omega—International Journal of Management Science 17(6), 551–557.
Parthasarathy, S., & Rajendran, C. (1997). An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs. International Journal of Production Economics 49(3), 255–263.
Pinedo, M. (2012). Scheduling: Theory, Algorithms, and Systems (4th ed.). New York: Springer.
Rahman, H.F., Sarker, R.A., & Essam, D.L. (2013). A memetic algorithm for permutation flow shop problems. Proc. IEEE Congress on Evolutionary Computation, pp. 1618–1625, Cancun, June 20–23.
Rahman, H.F., Sarker, R.A., & Essam, D. (2015). A genetic algorithm for permutation flow shop scheduling under make to stock production system. Computers & Industrial Engineering 90, 12–24.
Rajendran, C., & Ziegler, H. (2004). Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155(2), 426–438.
Reisman, A., Kumar, A., & Motwani, J. (1997). Flowshop scheduling/sequencing research: a statistical review of the literature, 1952–1994. IEEE Transactions on Engineering Management 44(3), 316–329.
Rom, W.O., & Slotnick, S.A. (2009). Order acceptance using genetic algorithms. Computers & Operations Research 36(6), 1758–1767.
Ruiz, R., Maroto, C., & Alcaraz, J. (2006). Two new robust genetic algorithms for the flowshop scheduling problem. Omega—International Journal of Management Science 34(5), 461–476.
Ruiz, R., Serifoglu, F.S., & Urlings, T. (2008). Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research 35(4), 1151–1175.
Slotnick, S.A. (2011). Order acceptance and scheduling: a taxonomy and review. European Journal of Operational Research 212(1), 1–11.
Su, L.-H., & Chou, F.-D. (2000). Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated. Production Planning & Control 11(8), 806–819.
Taillard, E. (1990). Some efficient heuristic methods for the flow-shop sequencing problem. European Journal of Operational Research 47(1), 65–74.
Tasgetiren, M.F., Liang, Y.C., Sevkli, M., & Gencyilmaz, G. (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177(3), 1930–1947.
Wang, X.L., Xie, X.Z., & Cheng, T.C.E. (2013). Order acceptance and scheduling in a two-machine flowshop. International Journal of Production Economics 141(1), 366–376.
Xiao, Y.Y., Zhang, R.Q., Zhao, Q.H., & Kaku, I. (2012). Permutation flow shop scheduling with order acceptance and weighted tardiness. Applied Mathematics and Computation 218(15), 7911–7926.
Zobolas, G.I., Tarantilis, C.D., & Ioannou, G. (2009). Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research 36(4), 1249–1267.