Heuristic approaches for n/m/F/ ∑Ci scheduling problems

European Journal of Operational Research

Volumn 96, Issue 3, 1997, Pages 636-644

  Wang, Chengen ^a,b   Chu, Chengbin ^b   Proth, Jean Marie ^b,c  

^a SHENYANG INSTITUTE OF AUTOMATION   (China)

^b INRIA   (France)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Flow shop; Heuristics; Job completion time; Scheduling

Indexed keywords

CALCULATIONS; MACHINERY; OPTIMIZATION; PRODUCTION; SCHEDULING;

FLOW SHOP; HEURISTICS; JOB COMPLETION TIME;

HEURISTIC METHODS;

EID: 0031075638     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00347-9     Document Type: Article

References (8)

1. Adiri, I., and Amit, N. (1984), "Openshop and flowshop scheduling to minimize sum of completion times," Computers & Operation Research 11, 275-284.
2. Adiri, I., and Pohoryles, D. (1982), "Flowshop/No-idle or No-wait scheduling to minimize the sum of completion times", Naval Research Logistics Quarterly 29, 495-504.
3. Ahmadi, R.H., and Bagchi, U. (1990a), "Lower bounds for single machine scheduling problems", Naval Research Logistics 37, 967-979.
4. Ahmadi, R.H., and Bagchi, U. (1990b), "Improved lower bounds for minimizing the sum of completion times of n jobs over m machines", European Journal of Operational Research 44, 331-336.
5. Garey, M.R., and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York.
6. Karabati, S., and Kouvelis, P. (1993), "The permutation flow shop problem with sum-of-completion times performance criterion", Naval Research Logistics 40, 843-862.
7. Panwalkar, S.S., and Woollam, C.R. (1980), "Ordered flow shop problems with no in-process waiting: Further results", Journal of the Operational Research Society 31, 1039-1043.
8. Van Deman, J.M., and Baker, K.R. (1973), "Minimizing mean flowtime in the flow shop with no intermediate queues", AIIE Transactions 6, 28-34.