Information Technology Reference
In-Depth Information
Bülbül, K., Kaminsky, P., & Yano, C. (2004).
Flow shop scheduling with earliness, tardiness,
and intermediate inventory holding costs.
Naval
Research Logistics
,
51
, 407-445. doi:10.1002/
nav.20000
Coello, C., & Mariano, C. (2002). Algorithms and
Multiple Objective . In Ehrgott, M., & Gandibleux,
X. (Eds.),
Multiple Criteria Optimization. State
of the Art Annotated Bibliographic Surveys
(pp.
277-331). Boston: Kluwer Academic Publishers.
Burke, E. K., Landa-Silva, J. D., & Soubeiga, E.
(2003). Hyperheuristic Approaches for Multiob-
jective Optimization. In
The Fifth Metaheuristics
International Conference
(pp. 052.1-052.6).
Kyoto: The University of Tokyo.
Czyzak, P., & Jaszkiewicz, A. (1998). Pa-
reto Simulated Annealing - A meta-
heuristic technique for multiple objective
combinatorial optimization.
Journal on Multi-
Criteria Decision Analysis
,
7
, 34-47. doi:10.1002/
(SICI)1099-1360(199801)7:1<34::AID-
MCDA161>3.0.CO;2-6
Campbell, H. G., Dudek, R. A., & Smith, M. L.
(1970). A Heuristic Algorithm for the n Job, m Ma-
chine Sequencing Problem.
Management Science
,
16
(10), 630-637. doi:10.1287/mnsc.16.10.B630
Daniels, R. L., & Chambers, R. J. (1990).
Multiobjective flow-shop scheduling.
Naval Research Logistics
,
37
, 981-995.
doi:10.1002/1520-6750(199012)37:6<981::AID-
NAV3220370617>3.0.CO;2-H
Carlier, J., & Rebaï, I. (1996). Two branch and
bound algorithms for the permutation flow
shop problem.
European Journal of Opera-
tional Research
,
90
, 238-251. doi:10.1016/0377-
2217(95)00352-5
Dorn, J., Girsch, M., Skele, G., & Slany, W.
(1996). Comparison of iterative improvement
techniques for schedule optimization.
European
Journal of Operational Research
,
94
, 349-361.
doi:10.1016/0377-2217(95)00162-X
Chang, P. C., Chen, S. H., & Liu, C. H. (2007).
Sub-population genetic algorithm with mining
gene structures for multiobjective flowshop sched-
uling problems.
Expert Systems with Applications
,
33
, 762-777. doi:10.1016/j.eswa.2006.06.019
Dudek, R. A., Panwalkar, S. S., & Smith, M.
L. (1992). The lessons of flowshop schedul-
ing research.
Operations Research
,
40
, 7-13.
doi:10.1287/opre.40.1.7
Chang, P. C., Hsieh, J.-C., & Lin, S. G. (2002).
The development of gradual priority weight-
ing approach for the multi-objective flowshop
scheduling problem.
International Journal of
Production Economics
,
79
, 171-183. doi:10.1016/
S0925-5273(02)00141-X
Eck, B. T., & Pinedo, M. (1993). On the mini-
mization of the makespan subject to flowtime
optimality.
Operations Research
,
41
, 797-801.
doi:10.1287/opre.41.4.797
Chankong, V., & Haimes, Y. Y. (1983).
Multiobjec-
tive Decision Making Theory and Methodology
.
New York: Elsevier Science.
Ehrgott, M. (2000). Approximation algorithms
for combinatorial multicriteria optimization prob-
lems.
International Transactions in Operational
Research
,
7
, 5-31. doi:10.1111/j.1475-3995.2000.
tb00182.x
Charnes, A., & Cooper, W. (1961).
Management
Models and Industrial Applications of Linear
Programming
. New York: John Wiley and Sons.
Search WWH ::
Custom Search