Information Technology Reference
In-Depth Information
Ehrgott, M., & Gandibleux, X. (2001). Bounds
and bound sets for biobjective Combinatorial Op-
timization problems . In Köksalan, M., & Zionts,
S. (Eds.), Multiple Criteria Decision Making in
the New Millennium (5 th ICMCDM), LNEMS 507
(pp. 241-253). Berlin: Springer.
Geiger, M. (2007). On operators and search space
topology in multi-objective flow shop scheduling.
European Journal of Operational Research , 181 ,
195-206. doi:10.1016/j.ejor.2006.06.010
González, T., & Johnson, D. B. (1980). A new
algorithm for preemptive scheduling of trees.
Journal of the Association for Computing Ma-
chinery , 27 , 287-312.
Ehrgott, M., & Gandibleux, X. (2002). Multi-
objective Combinatorial Optimization: Theory,
Methodology, and Applications . In Ehrgott,
M., & Gandibleux, X. (Eds.), Multiple Criteria
Optimization: State of the Art Annotated Biblio-
graphic Surveys (pp. 369-444). Boston: Kluwer
Academic Publishers.
Gordon, V., Proth, J. M., & Chu, C. (2002). A
survey of the state of the art of common due date
assignment and scheduling research. European
Journal of Operational Research , 139 , 1-25.
doi:10.1016/S0377-2217(01)00181-3
Ehrgott, M., & Wiecek, M. (2005). Multiobjec-
tive Programming . In Figueira, J., Greco, S., &
Ehrgott, M. (Eds.), Multiple Criteria Decision
Analysis (pp. 667-722). New York: Springer.
Grabowski, J., & Wodecki, M. (2004). Some local
search algorithms for no-wait flow-shop problem
with makespan criterion. Computers & Opera-
tions Research , 32 , 2197-2212. doi:10.1016/j.
cor.2004.02.009
Emelichev, V. A., & Perepelista, V. A. (1992). On
cardinality of the set of alternatives in discrete
many-criterion problems. Discrete Mathematics
and Applications , 2 (5), 461-471. doi:10.1515/
dma.1992.2.5.461
Graham, R. L., Lawler, E. L., Lenstra, J. K., &
Rinnooy Kan, A. H. G. (1979). Optimization
and approximation in deterministic sequencing
and scheduling: A survey. Annals of Discrete
Mathematics , 5 , 287-326. doi:10.1016/S0167-
5060(08)70356-X
Framinan, J. M., Leisten, R., & Ruiz-Usano, R.
(2002). Efficient heuristics for flowshop sequenc-
ing with the objectives of makespan and flowtime
minimisation. European Journal of Operational
Research , 141 , 559-569. doi:10.1016/S0377-
2217(01)00278-8
Gupta, J. N. D. (1972). Heuristic Algorithms for
Multistage Flowshop Scheduling Problem. AIIE
Transactions , 4 (1), 11-18.
Gupta, J. N. D., Neppalli, V. R., & Werner, F.
(2001). Minimizing total flow time in a two-
machine flowshop problem with minimum
makespan. International Journal of Production
Economics , 69 (3), 323-338. doi:10.1016/S0925-
5273(00)00039-6
French, S. (1982). Sequencing and Scheduling:
An Introduction to the Mathematics of the Job
Shop . Chichester, UK: Ellis Horwood.
Gandibleux, X., Mezdaoui, N., & Fréville, A.
(1997). A tabu search procedure to solve multi-
objective combinatorial optimization problems.
Lecture Notes in Economics and Mathematical
Systems , 455 , 291-300.
Hapke, M., Jaszkiewicz, A., & Slowinski, R.
(1998). Interactive Analysis of multiple-criteria
project scheduling problems. European Jour-
nal of Operational Research , 107 (2), 315-324.
doi:10.1016/S0377-2217(97)00336-6
Garey, M. R., & Johnson, D. S. (1979). Comput-
ers and Intractability: A Guide to the Theory of
NP-Completeness . San Francisco: Freeman.
Search WWH ::




Custom Search