參考文獻 |
[1] Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., and Van De Velde, S. L., Scheduling a batching machine. Journal of scheduling, 1(1), 31-54, 1998.
[2] Carlier, J. “The one-machine sequencing problem”, European Journal of Operational Research, 11(1), 42-47, 1982.
[3] Carlier, J., and Pinson, É., An algorithm for solving the job-shop problem. Management science, 35(2), 164-176, 1989.
[4] Dupont, L and Dhaenens-Flipo, C, “Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure”, Computers & operations research, 29(7), 807-819, 2002.
[5] Dupont, L and Ghazvini., F. J. “Minimizing makespan on a single batch processing machine with non-identical job sizes”, European Journal of Automation, 32(4), 431-440, 1998.
[6] Ghazvini, F. J., & Dupont, L., Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. International Journal of Production Economics, 55(3), 273-280,1998.
[7] Graham, R. L., Lawler, E. L., Lenstra, J. K., and Kan, A. R, “Optimization and approximation in deterministic sequencing and scheduling: a survey”, Annals of discrete mathematics, Vol. 5. Elsevier, 287-326, 1979.
[8] Hu, H. B., Li, C. H., and Miao, Q. Y., “Opinion diffusion on multilayer social networks”, Advances in Complex Systems, 20(06n07), 1750015, 2017.
[9] Kivelä, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A., Multilayer networks. Journal of complex networks, 2(3), 203-271, 2014.
[10] Li, C. L., and Lee, C. Y., Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research, 96(3), 564-569, 1997.
[11] Magnanti, T. L., & Orlin, J. B., Network Flows. PHI Englewood Cliffs NJ, 1993.
[12] Mönch, L., Fowler, J. W., Dauzère-Pérès, S., Mason, S. J., & Rose, O. A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of scheduling, 14(6), 583-599, 2011.
[13] Morrison, D. R., Jacobson, S. H., Sauppe, J. J., and Sewell, E. C, Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization, 19, 79-102, 2016.
[14] Morrison, D. R., Sauppe, J. J., Zhang, W., Jacobson, S. H., and Sewell, E. C., Cyclic best first search: Using contours to guide branch‐and‐bound algorithms. Naval Research Logistics (NRL), 64(1), 64-82, 2017.
[15] Sheen, G. J., & Liao, L. W., A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags. European journal of operational research, 181(1), 102-116, 2007.
[16] Sung, C. S., and Choung, Y. I., Minimizing makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Operational Research, 120(3), 559-574, 2000.
[17] Sung, C. S., Kim, Y. H., and Yoon, S. H., A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. European Journal of Operational Research, 121(1), 179-192, 2000.
[18] Tangudu, S. K., and Kurz, M. E., A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families. Production Planning & Control, 17(7), 728-741, 2006.
[19] Uzsoy, R. Scheduling a single batch processing machine with non-identical job sizes. The International Journal of Production Research, 32(7), 1615-1635, 1994.
[20] Uzsoy, R., Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33(10), 2685-2708, 1995.
[21] Zhang, W., Sauppe, J. J., & Jacobson, S. H., Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search. Computers & Operations Research, 126, 105129, 2021.
[22] Carlier, J., and Pinson, E., Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78(2), 146-161, 1994.
[23] Brucker, P., Jurisch, B., and Sievers, B., A branch and bound algorithm for the job-shop scheduling problem. Discrete applied mathematics, 49(1-3), 107-127, 1994.
[24] Yan, P., Chu, C., Yang, N., & Che, A., A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows. International Journal of Production Research, 48(21), 6461-6480, 2010. |