Information Technology Reference
In-Depth Information
Laha, D., & Chakraborty, U. K. (2007). An ef-
ficient stochastic hybrid heuristic for flowshop
scheduling.
Engineering Applications of Artificial
Intelligence
,
20
, 851-856. doi:10.1016/j.engap-
pai.2006.10.003
Lomnicki, A. (1965). Branch-and-bound algo-
rithm for the exact solution of the three-machine
scheduling problem.
Operational Research
Quarterly
,
16
, 89-100. doi:10.1057/jors.1965.7
Loukil, T., Teghem, J., & Tuyttens, D. (2005).
Solving multi-objective production schedul-
ing problems using metaheuristics.
European
Journal of Operational Research
,
161
, 42-61.
doi:10.1016/j.ejor.2003.08.029
Laha, D., & Chakraborty, U. K. (2008). An efficient
heuristic approach to flowtime minimization in
permutation flowshop scheduling.
International
Journal of Advanced Manufacturing Technology
,
38
, 1018-1025. doi:10.1007/s00170-007-1156-z
Minella, G., Ruiz, R., & Ciavotta, M. (2007).
A review and evaluation of multi-objective al-
gorithms for the flowshop scheduling problem.
INFORMS Journal on Computing
,
20
, 451-471.
doi:10.1287/ijoc.1070.0258
Laha, D., & Chakraborty, U. K. (2009). A construc-
tive heuristic for minimizing makespan in no-wait
flowshop scheduling.
International Journal of
Advanced Manufacturing Technology
,
41
, 97-109.
doi:10.1007/s00170-008-1454-0
Mokotoff, E. (2009). Minimizing the Makespan
and Total Flow Time on the Permutation Flow
Shop Scheduling Problem. In J. Blazewicz, M.
Drozdowski, G. Kendall & B. McCollum (Eds.),
Proceedings of the 4
th
Multidisciplinary Interna-
tional Conference on Scheduling: Theory and Ap-
plications
(pp. 479-506). Dublin: The University
of Nottingham.
Landa-Silva, J. D., Burke, E. K., & Petrovic,
S. (2004). An Introduction to Multiobjective
Metaheuristics for Scheduling and Timetabling.
Lecture Notes in Economics and Mathematical
Systems
,
535
, 91-129.
Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H.
G. (1993). Sequencing and scheduling: Algorithms
and complexity . In Graves, S. C., Rinnooy Kan,
A. H. G., & Zipkin, P. H. (Eds.),
Handbooks in
Operations Research and Management Science,
4, Logistics of Production and Inventory
(pp.
445-524). Amsterdam: Elsevier. doi:10.1016/
S0927-0507(05)80189-6
Monma, C. L., & Rinnooy Kan, A. H. G. (1983).
A concise survey of efficiently solvable special
cases of the permutation flow-shop problem.
RAIRO Recherche Opérationelle
,
17
, 105-119.
Murata, T., Ishibuchi, H., & Tanaka, H. (1996).
Multi-Objective Genetic Algorithm and its Ap-
plications to Flowshop Scheduling.
Comput-
ers & Industrial Engineering
,
30
(4), 957-968.
doi:10.1016/0360-8352(96)00045-9
Leung, J. Y.-T., & Young, G. H. (1989). Minimiz-
ing schedule length subject to minimum flow
time.
SIAM Journal on Computing
,
18
, 314-326.
doi:10.1137/0218022
Nagar, A., Heragu, S. S., & Haddock, J. (1995b).
A Branch and Bound approach for a two machine
flowshop scheduling problem.
The Journal of
the Operational Research Society
,
46
, 721-734.
Liao, C. J., Yu, W. C., & Joe, C. B. (1997). Bicri-
terion scheduling in the two-machine flowshop.
The Journal of the Operational Research Society
,
48
, 929-935.
Nagar, J., Haddock, J., & Heragu, S. S. (1995a).
Multiple and bicriteria scheduling: A literature sur-
vey.
European Journal of Operational Research
,
81
, 88-104. doi:10.1016/0377-2217(93)E0140-S
Liu, J., & Reeves, C. R. (2001). Constructive
and composite heuristic solutions to the
P//
Σ
C
i
scheduling problem.
European Journal of Op-
erational Research
,
132
, 439-452. doi:10.1016/
S0377-2217(00)00137-5
Search WWH ::
Custom Search