Multicriteria Flow Shop Scheduling Problem - Enterprise Information Systems Design, Implementation and Management: Organizational Applications - page 231

Nawaz, M., Enscore, E. E. Jr, & Ham, I. (1983).
A heuristic algorithm for the m machine, n job
flowshop sequencing problem. OMEGA . The
International Journal of Management Science ,
11 , 91-95.

Pinedo, M. L. (2002). Scheduling: Theory, Algo-
rithms, and Systems . New Jersey: Prentice Hall.

Potts, C. N. (1980). An adaptive branching rule
for the permutation flow-shop problem. Euro-
pean Journal of Operational Research , 5 , 19-25.
doi:10.1016/0377-2217(80)90069-7 Neppalli, V. R., Chen, C. L., & Gupta, J. N. D.

(1996). Genetic algorithms for the two-stage
bicriteria flowshop problem. European Jour-
nal of Operational Research , 95 , 356-373.
doi:10.1016/0377-2217(95)00275-8

Potts, C. N., Shmoys, D. B., & Williamson, D.
P. (1991). Permutation vs. non-permutation flow
shop schedules. Operations Research Letters , 10 ,
281-284. doi:10.1016/0167-6377(91)90014-G

Nowicki, E., & Zdrzałka, S. (1990). A survey of
results for sequencing problems with controllable
processing times. Discrete Applied Mathematics ,
26 , 271-287. doi:10.1016/0166-218X(90)90105-
L

Rajendran, C. (1992). Two-stage flowshop sched-
uling problem with bicriteria. The Journal of the
Operational Research Society , 43 (9), 879-884.

Rajendran, C. (1993). Heuristic algorithm for
scheduling in a flowshop to minimize total
flowtime. International Journal of Production
Economics , 29 , 65-73. doi:10.1016/0925-
5273(93)90024-F

Onwubolu, G., & Davendra, D. (2006). Scheduling
flow shops using differential evolution algorithm.
European Journal of Operational Research , 171 ,
674-692. doi:10.1016/j.ejor.2004.08.043

Rajendran, C. (1995). Heuristics for scheduling
in flowshop with multiple objectives. European
Journal of Operational Research , 82 , 540-555.
doi:10.1016/0377-2217(93)E0212-G

Osman, I. H., & Potts, C. N. (1989). Simulated
Annealing for Permutation Flowshop Scheduling.
OMEGA . The International Journal of Manage-
ment Science , 17 (6), 551-557.

Rajendran, C., & Ziegler, H. (1997). An efficient
heuristic for scheduling in a flowshop to mini-
mize total weighted flowtime of jobs. European
Journal of Operational Research , 103 , 129-138.
doi:10.1016/S0377-2217(96)00273-1

Panwalkar, S. S., & Iskander, W. (1977). A survey
of scheduling rules. Operations Research , 25 ,
45-61. doi:10.1287/opre.25.1.45

Parker, R. G. (1995). Deterministic Scheduling
Theory . New York: Chapman & Hall.

Rajendran, C., & Ziegler, H. (2004). Ant-colony
algorithms for permutation: flowshop scheduling.
European Journal of Operational Research , 155 ,
426-438. doi:10.1016/S0377-2217(02)00908-6

Parthasarathy, S., & Rajendran, C. (1997). An ex-
perimental evaluation of heuristics for scheduling
in a real-life flowshop with sequence-dependent
setup times of jobs. International Journal of Pro-
duction Economics , 49 , 255-263. doi:10.1016/
S0925-5273(97)00017-0

Rajendran, C., & Ziegler, H. (2005). Two ant-
colony algorithms for minimizing total flowtime
in permutation flowshops. Computers & Indus-
trial Engineering , 48 , 789-797. doi:10.1016/j.
cie.2004.12.009

Pasupathy, T., Rajendran, C., & Suresh, R. K.
(2006). A multi-objective genetic algorithm for
scheduling in flow shops to minimize the makes-
pan and total flow time of jobs. International
Journal of Advanced Manufacturing Technology ,
27 , 804-815. doi:10.1007/s00170-004-2249-6