|
Brucker,P(1995), Scheduling Algorithms, Berlin: Springer, 1995. Djellab,H and Djellab, K(2002), “Preemptive hybrid flowshop scheduling problem of interval orders”, European Journal of Operational Research, vo.137, no.1 , pp.37–49. Gupta,J.N.D.(1988), “Two stage hybrid flow shop scheduling problem”, Journal of Operational Research Society, vol.39, no.4, pp.359-364. Graham,R. L. and Lawler, E. L. and Lenstra, J. K. and Kan, A. H. G. Rinnooy (1979), “Optimization and approximation in deterministic machine scheduling: A survey”, Annals of Discrete Mathematics, vol.5, pp. 287-326, 1979. Kahraman,C and Engin,O and Kaya, İ. and , Öztürk, R. E. (2010), “Multiprocessor task scheduling in multistage hybrid flow: shops A parallel greedy algorithm approach”, Applied Soft Computing, vol.10, no.4, pp.1293-1300. Kan , A. H. G. R(1976), Machine Scheduling Problems. Martinus Nijhoff: The Hague. Potts,C. N.and Kovalyov,M. Y.(2000), ”Scheduling with batching: A review”, European Journal of Operational Research, vol.120, no.2, pp.228-249. Kwak,K and Uno,T (2010), “Panel Makers’ Plans for Q4’10 - LCD TV Panel Shipments by Backlight Type”, Quarterly LED Backlight Panel Shipment and Forecast Report, DisplaySearch, September, 2010. http://www.displaysearch.com/cps/rde/xchg/displaysearch/hs.xsl/100126_led_to_surpass_ccfl_in_large_area_tft_lcd_backlights_in_2011.asp Lopez,P and Roubellat,F(2008), Production scheduling, London: ISTE Hoboken, NJ: John Wiley & Sons. Mitchell,M(1996), An introduction to genetic algorithms, Massachusetts Institute of Technology Cambridge, Massachusetts 02142. Vignier,A. and Billaut, J. C. and Proust, C.(1999), “Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art”, RAIRO-Operations Research, vol.33, no.2, pp.117-183. Zipkin,P. H.(1991), “Computing optimal lot sizes in the economic lot scheduling Problem”, Operations Research, vol. 39, no.1, pp.56-63.
|