Job shop scheduling with multiple resources and an application to a semiconductor testing facility
暂无分享,去创建一个
[1] Peter B. Luh,et al. An improved Lagrangian relaxation approach for solving job shop scheduling problems , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.
[2] Reha Uzsoy,et al. A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .
[3] Hyunsil Ahn,et al. Convergence properties of the modified subgradient method of Camerini et al. , 1990 .
[4] Krishna R. Pattipati,et al. A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..
[5] P. Camerini,et al. On improving relaxation methods by modified gradient techniques , 1975 .
[6] Tsu-Shuan Chang,et al. Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation , 1995, IEEE Trans. Syst. Man Cybern..
[7] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[8] Uday S. Karmarkar,et al. Simultaneous Resource Scheduling to Minimize Weighted Flow Times , 1989, Oper. Res..
[9] P. Mellor,et al. A Review of Job Shop Scheduling , 1966 .
[10] K. Preston White,et al. Advances in the Theory and Practice of Production Scheduling , 1990 .
[11] Alan S. Manne,et al. On the Job-Shop Scheduling Problem , 1960 .
[12] R. Uzsoy,et al. Production scheduling algorithms for a semiconductor test facility , 1989, IEEE/SEMI International Semiconductor Manufacturing Science Symposium.
[13] Mark H. Karwan,et al. A computational evaluation of two subgradient search methods , 1987, Comput. Oper. Res..
[14] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..