Information Technology Reference
In-Depth Information
Haupt, R. (1989). A survey of priority rule-based
scheduling.
Operational Research Spektrum
,
11
,
3-16. doi:10.1007/BF01721162
Ishibuchi, H., & Murata, T. (1998). A multi-
objective genetic local search algorithm and its
application to flowshop scheduling.
IEEE Trans-
actions on Systems, Man and Cybernetics - Part
C, 28
(3), 392-403.
Ho, J. C., & Chang, Y.-L. (1991). A new heuris-
tic for the n-job, m-machine flowshop problem.
European Journal of Operational Research
,
52
,
194-202. doi:10.1016/0377-2217(91)90080-F
Jaszkiewicz, A. (2004). A Comparative Study
of Multiple-Objective Metaheuristics on the
Bi-Objective Set Covering Problem and the
Pareto Memetic Algorithm.
Annals of Op-
erations Research
,
13
, 135-158. doi:10.1023/
B:ANOR.0000039516.50069.5b
Hoogeveen, H. (2005). Multicriteria Scheduling.
European Journal of Operational Research
,
167
,
592-623. doi:10.1016/j.ejor.2004.07.011
Hoogeveen, J. A. (1992).
Single-Machine Bicrite-
ria Scheduling
. Unpublished doctoral dissertation,
CWI, The Netherlands Technology, Amsterdam.
Jaszkiewicz, A., & Ferhat, A. B. (1999). Solving
multiple criteria choice problems by interactive
trichotomy segmentation.
European Journal
of Operational Research
,
113
(2), 271-280.
doi:10.1016/S0377-2217(98)00216-1
Horsky, D., & Rao, M. R. (1984). Estimation of at-
tribute weights from preference comparison.
Man-
agement Science
,
30
(7), 801-822. doi:10.1287/
mnsc.30.7.801
Johnson, S. M. (1954). Optimal two- and three-
stage production schedules with setup times
included.
Naval Research Logistics
,
1
, 61-68.
doi:10.1002/nav.3800010110
Huang, G., & Lim, A. (2003). Fragmental Opti-
mization on the 2-Machine Bicriteria Flowshop
Scheduling Problem. In B. Werner (Ed.),
Pro-
ceedings: 15th IEEE International Conference on
Tools with Artificial Intelligence
(pp. 194-198).
Sacramento: IEEE Computer Society.
Jones, D. F., Mirrazavi, S. K., & Tamiz, M. (2002).
Multi-objective meta-heuristics: An overview of
the current state of the art.
European Journal of
Operational Research
,
137
, 1-9. doi:10.1016/
S0377-2217(01)00123-0
Ignall, E., & Schrage, L. E. (1965). Application
of the branch-and-bound technique to some flow-
shop scheduling problems.
Operations Research
,
13
, 400-412. doi:10.1287/opre.13.3.400
Knowles, J., & Corne, D. (2002). On Metrics
Comparing Nondominated Sets. In IEEE (Ed.),
Proceedings of the 2002 Congress on Evolution-
ary Computation
(pp. 711-716). New York: IEEE.
Isermann, H. (1977). The enumeration of the set of
all efficient solutions for a linear multiple objec-
tive program.
Operational Research Quarterly
,
28
(3), 711-725.
Koulamas, C. (1998). A new constructive heuristic
for the flowshop scheduling problem.
European
Journal of Operational Research
,
105
, 66-71.
doi:10.1016/S0377-2217(97)00027-1
Ishibuchi, H., Misaki, S., & Tanaka, H. (1995).
Modified simulated annealing algorithms for
the flow shop sequencing problem.
European
Journal of Operational Research
,
81
, 388-398.
doi:10.1016/0377-2217(93)E0235-P
Lageweg, B. J., Ixnstra, J. K., & Rinnooy Kan,
A. H. G. (1978). A general bounding to minimize
makespan/total flowtime of jobs.
European Jour-
nal of Operational Research
,
155
, 426-438.
Search WWH ::
Custom Search