Information Technology Reference
In-Depth Information
Rajendran, C., & Ziegler, H. (2009). A Multi-
Objective Ant- Colony Algorithm for Permutation
Flowshop Scheduling to Minimize the Makespan
and Total Flowtime of Jobs . In Chakraborty, U.
K. (Ed.),
Computational Intelligence in Flow
Shop and Job Shop Scheduling
(pp. 53-99).
Berlin: Springer-Verlag. doi:10.1007/978-3-642-
02836-6_3
Schulz, A. (1996).
Scheduling and Polytopes
.
Unpublished doctoral dissertation, Technical
University of Berlin, Berlin.
Selen, W. J., & Hott, D. D. (1986). A mixed-integer
goal-programming formulation of the standard
flow-shop scheduling problem.
The Journal of the
Operational Research Society
,
12
(37), 1121-1128.
Serafini, P. (1992). Simulated annealing for
multiple objective optimization problems. In
Proceedings of the Tenth International Confer-
ence on Multiple Criteria Decision Making, vol.
1
(pp. 87-96). Taipei.
Reeves, C. R. (1993). Improving the Efficiency of
Tabu Search for Machine Scheduling Problems.
The Journal of the Operational Research Society
,
44
(4), 375-382.
Reeves, C. R. (1995). A Genetic Algorithm for
Flowshop Sequencing.
Computers & Operations
Research
,
22
, 5-13. doi:10.1016/0305-0548(93)
E0014-K
Shmoys, D. B., & Tardos, É. (1993). An ap-
proximation algorithm for the generalized assign-
ment problem.
Mathematical Programming
,
62
,
461-474. doi:10.1007/BF01585178
Rinnooy Kan, A. H. G. (1976).
Machine Sched-
uling problems: Classification, Complexity and
Computations
. The Hague: Martinus Nijhoff.
Sin, C. C. S. (1989).
Some topics of parallel-
machine scheduling theory
. Unpublished doctoral
dissertation, University of Manitoba, Winnipeg.
Ruiz, R. (2003).
Técnicas Metaheurísticas para
la Programación Flexible de la Producción.
Unpublished doctoral dissertation, Universidad
Politécnica de Valencia, Valencia.
Sivrikaya-Serifoglu, F. S., & Ulusoy, G. (1998).
A bicriteria two machine permutation flowshop
problem.
European Journal of Operational
Research
,
107
, 414-430. doi:10.1016/S0377-
2217(97)00338-X
Ruiz, R., & Maroto, C. (2005). A comprehen-
sive review and evaluation of permutation
flowshop heuristics.
European Journal of Op-
erational Research
,
165
, 479-494. doi:10.1016/j.
ejor.2004.04.017
Srinivas, N., & Deb, K. (1995). Multiobjective
function optimization using nondominated sorting
genetic algorithms.
Evolutionary Computation
,
2
(3), 221-248. doi:10.1162/evco.1994.2.3.221
Ruiz-Díaz, F., & French, S. (1983). A survey of
multi-objective combinatorial scheduling . In
French, S., Hartley, R., Thomas, L. C., & White,
D. J. (Eds.),
Multi-Objective Decision Making
(pp. 59-77). New York: Academic Press.
T'kindt, V., & Billaut, J.-C. (2001). Multicriteria
scheduling problems: a survey. RAIRO- .
Op-
erations Research
,
35
, 143-163. doi:10.1051/
ro:2001109
T'kindt, V., & Billaut, J.-C. (2006).
Multicriteria
scheduling: Theory, Models and Algorithms
(2nd
ed.). Berlin: Springer.
Saaty, T. L. (1980).
The Analytic Hierarchy Pro-
cess
. New York: McGrawHill.
Sayin, S., & Karabati, S. (1999). A bicriteria
approach to the two-machine flow shop schedul-
ing problem.
European Journal of Operational
Research
,
113
, 435-449. doi:10.1016/S0377-
2217(98)00009-5
Search WWH ::
Custom Search