| 摘要(英) |
In this research, we research the scheduling problem with n lots that can be divided into batches and m parallel machines under availability constraint. Due to the eligibility constraint, each lots has its own recipe, not all m machines can process the all recipes. And the lots have the waiting time before the processing, they can process together when their arrival time smaller than the batch’s waiting time. Therefore, the goal of our research is to find the minimum completion time for the last system to leave the system, subject to these constraints.
In order to find the optimal solution to this problem, this study proposes a model for mixed integer programming. And with time constraints, machine eligibility constraint, batch processing constraint, and parallel machine processing constraint. In our environment settings. The assumptions we put forward are more similar to the actual environment of the semiconductor industry. Finally, we use mixed integer programming to solve this scheduling problem.
|
| 參考文獻 |
[1] Ali Husseinzadeh Kashan, Behrooz Karimi & Masoud Jenabi (2006). A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Computers & Operations Research ,1084-1098.
[2] Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., & Van De Velde, S. L. (1998). Scheduling a batching machine. Journal of scheduling, 1(1), 31-54.
[3] Centeno, G., and Armacost, R. L., (1997). Parallel machine scheduling with release time and machine eligibility restrictions. Computers and Industrial Engineering, 33(1–2), 273–276.
[4] Chang P.-Y., Damodaran P., Melouk S. (2004) Minimizing makespan on parallel batch processing machines. International Journal of Production Research 42(19):4211–4220
[5] Cheng, B., Yang, S., Hu, X., & Chen, B. (2012). Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes. Applied Mathematical Modelling, 36(7), 3161-3167.
[6] Li X, Yalaoui F, Amodeo L (2010). A multi objective meta-heuristic with a fuzzy logic controller for solving a scheduling problem. Computational intelligence: foundations and applications: proceedings of the 9th international FLINS conference, Emei, CHINA, August 02–04
[7] Li, S. A hybrid two-stage flowshop with part family, batch production, major and minor set-ups. European Journal of Operational Research, 102(1), 142-156. (1997)
[8] Liao, L. W., & Sheen, G. J. (2008). Parallel machine scheduling with machine availability and eligibility constraints. European Journal of Operational Research, 184(2), 458-467.
[9] Pinedo ML (2009). Planning and scheduling in manufacturing and services. Springer, New York.
[10] Pinedo ML (2011). Scheduling theory, algorithms, and systems. Springer, New York
[11] Su, L. H. (2003). A hybrid two-stage flow shop with limited waiting time constraints. Computers & Industrial Engineering, 44(3), 409-424.
[12] Tu, Y. M., & Liou, C. S. (2006). Capacity determination model with time constraints and batch processing in semiconductor wafer fabrication. Journal of the Chinese Institute of Industrial Engineers, 23(3), 192-199.
[13] Xu, R., Chen, H., Li, X., (2012). Makespan minimization on single batch-processing machine via ant colony optimization. Comput. Oper. Res. 39 (3), 582–593.
[14] Zhu X, Wilhelm WE (2006). Scheduling and lot sizing with sequence-dependent setup: a literature review. IIE Trans, 38,987–1007
|
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
至系統瀏覽論文 ( 永不開放)
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit