Optimization-Based manufacturing scheduling with multiple resources, setup requirements, and transfer lots

IIE Transactions (Institute of Industrial Engineers)

Volumn 35, Issue 10, 2003, Pages 973-985

  Chen, Dong ^a   Luh, Peter B ^b   Thakur, Lakshman S ^c   Moreno, Jack ^d  

^a Aristeia Capital LLC   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c UNIVERSITY OF CONNECTICUT   (United States)

^d JM Products Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INDUSTRIAL ENGINEERING; INVENTORY CONTROL; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCT DEVELOPMENT; RESOURCE ALLOCATION; SCHEDULING;

JOB SHOPS;

PRODUCTION CONTROL;

EID: 0041417617     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170309342349     Document Type: Article

References (20)

1. Brucker, P., and Thiele, O., 1996. A branch and bound method for the general-shop problem with sequence dependent setup-times. OR-Spectrum, 18 (3):145–161.
2. Chen, T., and Hsia, T. C., Job shop scheduling with multiple resources and an application to a semiconductor testing facility. Proceedings of the 33rd IEEE Conference on Decision and Control. pp. 1564–1570. Lake Buena Vista, FL:IEEE.
3. Czerwinski, C., and Luh, P. B., 1994. Scheduling products with bills of materials using an improved Lagrangian relaxation technique. IEEE Transactions on Robotics and Automation, 10 (2):99–111.
4. Dobson, G., and Karmarkar, U. S., 1989. Simultaneous resources scheduling to minimize weighted flow times. Operations Research, 37 (4):592–600.
5. Dobson, G., and Karmarkar, U. S., Large scale shop scheduling:formulations and decompositions. Presented at the LAAS Paris Workshop on Production Planning and Scheduling. Toulouse, France.
6. Gargeya, V. B., and Deane, R. H., 1996. Scheduling research in multiple resource constrained job shops:a review and critique. International Journal of Production Research, 34 (8):2077–2097.
7. Kaskavelis, C. A., and Caramanis, M. C., 1998. Efficient Lagrangian relaxation algorithms for real-life-size job-shop scheduling problems. IIE Transactions, 30 (11):1085–1097.
8. Kim, S. C., and Bobrowski, P. M., 1994. Impact of sequence-dependent setup time on job shop scheduling performance. International Journal of Production Research, 32 (7):1503–1520.
9. Liao, C., and Chuang, C., 1996. Sequencing with setup time and order tardiness trade-offs. Naval Research Logistics, 43 (7):971–984.
10. Liu, G., and Luh, P. B., Scheduling job shops with transfer lots. Proceedings of the 1996 IEEE International Conference on Robotics and Automation. pp. 2523–2528. Piscataway, NJ:IEEE.
11. Luh, P. B., Liu, F., and Moser, B., 1999. Scheduling of design projects with uncertain number of iterations. European Journal of Operational Research, 113:575–592.
12. Luh, P. B., Gou, L., Zhang, Y., Nagahora, T., Tsuji, M., Yoneda, K., Hasegawa, T., Kyoya, Y., and Kano, T., 1998. Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annals of Operations Research, 76:233–259.
13. Ovacik, I. M., and Uzsoy, R., 1994. Rolling horizon algorithm for a single-machine dynamic scheduling problem with sequence-dependent setup times. International Journal of Production Research, 32 (6):1243–1263.
14. Panwalkar, S. S., Dudek, R. A., and Smith, M. L., Sequencing research and the industrial scheduling problem. Proceedings of the Symposium on the Theory of Scheduling and its Applications. pp. 29–32.
15. Soumen, G., and Cheryl, G., 1993. Production scheduling in a flexible manufacturing system with setups. IIE Transactions, 25 (5):21–35.
16. Treleven, M. D., and Elvers, D. A., 1985. An investigation of labor assignment rules in a dual-constrained job shop. Journal of Operations Management, 6:51–68.
17. Trietsch, D., and Baker, K. R., 1993. Basic techniques for lot streaming. Operations Research, 41 (6):1065–1076.
18. Vickson, R. G., and Alfredsson, B. E., 1992. Two- and three-machine flow shop scheduling problems with equal sized transfer batches. International Journal of Production Research, 30 (7):1551–1574.
19. Young, H. L., Bhaskaran, K., and Pinedo, M., 1997. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29 (1):45–52.
20. Zhao, X., Luh, P. B., and Wang, J., 1999. Surrogate gradient algorithm for Lagrangian relaxation. Journal of Optimization Theory and Application, 100 (3):699–712.