Aggregate planning in hybrid flowshops

International Journal of Production Research

Volumn 36, Issue 9, 1998, Pages 2463-2477

  Aghezzaf, E H ^a   Artiba, A ^b  

^a AL AKHAWAYN UNIVERSITY   (Morocco)

^b FUCaM   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; INVENTORY CONTROL; LINEAR PROGRAMMING; PROBLEM SOLVING; PROCESS CONTROL; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

AGGREGATE PLANNING; HYBRID FLOWSHOPS;

PRODUCTION CONTROL;

EID: 0032164325     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075498192634     Document Type: Article

References (16)

1. Aghezzaf, E. H., and Artiba, A., 1995, A Lagrangean relaxation technique for the general assembly line balancing problem. Journal of Intelligent Manufacturing, 6, 123-131.
2. Aghezzaf, E. H., Magnanti, T. L., and Wolsey, L. A., 1995, Optimizing constrained subtrees of trees. Mathematical Programming, 71, 113-126.
3. Aghezzaf, E. H., and Wolsey, L. A., 1992, Lot-sizing polyhedra with a cardinality constraint. Operations Research Letters, 11, 13-18.
4. Anderson, E. J., and Cheah, B. S., 1993, Capacitated lot-size with minimum batch sizes and setup times. International Journal of Production Research, 30, 137-152.
5. Bahl, C., 1983, Column generation based heuristic for multi-item scheduling. AIIIE Transactions 15, 136-141.
6. Barany, I., Van Roy, T. J., and Wolsey, L. A., 1984, Strong formulations for multi-item lot sizing. Management Science, 30, 1255-1261.
7. Barr, R. S., Glover, F., and Klingman, D., 1979, Enhancement of spanning tree labeling procedure for network optimisation. INFOR, 17(4), 16-34.
8. Dixon, P. S., and Silver, E. A., 1981, A heuristic solution procedure for the multi-item, single level, limited capacity, lot-sizing problem. Journal of Operations Management, 2 (1), 23-39.
9. Dzielinski, B. P., and Gomory, R. E., 1965, Optimal programming of lot sizes, inventories, and labor allocations. Management Science, 11 (9), 874-890.
10. Eppen, G., and Martin, R., 1987, Multi-item capacitated lot sizing using variable redefinition. Operations Research, 35, 832-848.
11. Lasdon, L. S., and Terjung, R. C., 1971, An efficient algorithm for multi-item scheduling. Operations Research, 19 (4), 946-969.
12. Lotfi, V., and Chen, W. H., 1991, An optimal algorithms for the multi-item capacitated production planning problem. European Journal of Operational Research, 52, 179-193.
13. Maes, J., McClain. J. O., and Van Wassenhove. L. N., 1991, Multilevel capacitated lotsizing complexity and LP-based heuristic. European Journal of Operational Research, 53, 131-148.
14. Maes, J., and Van Wassenhove, L. N., 1986, A simple heuristic for the multi-item single level capacitated lotsizing problem. Operations Research Letters, 4(6), 265-273.
15. Millar, H. H., and Yang, M., 1993, An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem. Computer and Operations Research, 20(4), 409-420.
16. Wagner, H., and Whitin, T. C., 1958, Dynamic version of the economic lot-size model. Management Science, 5, 89-96.