參考文獻 |
Adams, J., Balas, E., Zawack, D., 1988. Shifting Bottleneck Procedure for Job Shop Scheduling. Manage. Sci. 34, 391–401.
Amaral Armentano, V., Rigão Scrich, C., 2000. Tabu search for minimizing total tardiness in a job shop. Int. J. Prod. Econ. 63, 131–140.
Amjad, M.K., Butt, S.I., Kousar, R., Ahmad, R., Agha, M.H., Faping, Z., Anjum, N., Asgher, U., 2018. Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems. Math. Probl. Eng. 2018.
Anh, N.H.G., 2023. Scheduling Parallel Batch Processing Machines with Incompatible Families, Time Window Con-straints and Machine Eligibility Determination. Unpublished master’s thesis, National Central University, Taoyuan City.
Balas, E., 1969. Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Oper. Res. 17, 941–957.
Balas, E., Lenstra, J.K., Vazacopoulos, A., 1995. The One-machine Problem with Delayed Precedence Constraints and Its Use in Job Shop Scheduling. Manage. Sci. 41(1), 94–109.
Balas, E., Vazacopoulos, A., 1998. Guided local search with shifting bottleneck for job shop scheduling. Manage. Sci. 44(2), 262–275.
Barnes, J.W., Chambers, J.B., 1995. Solving the job shop scheduling problem with tabu search. IIE Trans. (Institute Ind. Eng. 27, 257–263.
Bellman, R., 1958. On a routing problem. Q. Appl. Math. 16, 87–90.
Bierwirth, C., 1995. A generalized permutation approach to job shop scheduling with genetic algorithms. OR Spectrum. 17, 87–92
Bierwirth, C., Kuhpfahl, J., 2017. Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. Eur. J. Oper. Res. 261(3), 835-848.
Brandimarte, P., 1993. Routing and scheduling in a flexible job shop by tabu search. Ann Oper. Res. 41, 157–183.
Braune, R., Zäpfel, G., Affenzeller, M., 2013. Enhancing local search algorithms for job shops with min-sum objectives by approximate move evaluation. J. Sched. 16, 495–518.
Brucker, P., Jurisch, B., Sievers, B., 1994. A branch and bound algorithm for the job-shop scheduling problem. Discret. Appl. Math. 49, 107–127.
Bülbül, K., 2011. A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Comput. Oper. Res. 38, 967–983.
Carlier, J., Pinson, É., 1989. An algorithm for solving the job-shop problem. Manage. Sci. 35, 164–176.
Carlier, J., Pinson, É., 1994. Adjustment of heads and tails for the job-shop problem. Eur. J. Oper. Res. 78, 146-161.
Chang, S.C., Lee, L.H., Pang, L.S., Chen, T.W.Y., Weng, Y.C., Chiang, H.Der, Dai, D.W.H., 1995. Iterative capacity allocation and production flow estimation for scheduling semiconductor fabrication. Proc. IEEE/CPMT Int. Electron. Manuf. Technol. Symp. 508–512.
Chaudhry, I.A., Khan, A.A., 2016. A research survey: Review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23, 551–591.
Clarke, G., Wright, J.R., 1964. Scheduling of Vehicle Routing Problem from a Central Depot to a Number of Delivery Points. Oper. Res. 12, 568-581.
Cruz-Chávez, M.A., 2015. Neighborhood generation mechanism applied in simulated annealing to job shop scheduling problems. Int. J. Syst. Sci. 46, 2673–2685.
Cruz-Chavez, M.A., Frausto-Solis, J., 2004. Simulated annealing with restart to job shop scheduling problem using upper bounds. Lect. Notes Artif. Intell. (Subseries Lect. Notes Comput. Sci. 3070, 860–865.
Dauzère-Pérès, S., Paulli, J., 1997. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Oper. Res. 70, 281-306.
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., 2002, A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182-197.
DeBontridder, K.M.J., 2005. Minimizing total weighted tardiness in a generalized job shop. J. Sched. 8, 479–496.
Dell’Amico, M., Trubian, M., 1993. Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41, 231–252.
DellaCroce, F., Tadei, R., Volta, G., 1995. A genetic algorithm for the job shop problem. Comput. Oper. Res. 22, 15–24.
Dorndorf, U., Pesch, E, 1995. Evolution based learning in a job shop scheduling environment. Comput. Oper. Res. 22, 25-40.
M.Essafi, I., Mati, Y., Dauzère-Pérès, S., 2008. A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput. Oper. Res. 35, 2599–2616.
Fieldsend, J.E., Everson, R.M., Singh, S., 2003. Using unconstrained elite archives for multiobjective optimization. IEEE Trans. Evol. Comput. 7, 305–323.
Gao, J., Gen, M., Sun, L., Zhao, X., 2007. A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Comput. Ind. Eng. 53, 149–162.
Gao, K.Z., Suganthan, P.N., Pan, Q.K., Chua, T.J., Cai, T.X., Chong, C.S., 2014. Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J. Intell. Manuf. 27, 363–374.
García-León, A., Dauzère-Pérès, S., Mati, Y., 2016. A General Approach for the Multi-Objective Flexible Job-Shop Scheduling Problem with Regular Criteria. Proc. 15th Int. Conf. Proj. Manag. Sched. 260–263.
García-León, A.A., Dauzère-Pérès, S., Mati, Y., 2019. An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 108, 187–200.
Garey, M.R., Johnson, D.S., Laboratomes, B., Hill, M., 1976. Scheduling Tasks with Non-uniform Deadlines on Two Processors. J. Assoc. Comput. Mach. 23, 461–467.
Genova, K., Kirilov, L., Guliashki, V., 2015. A survey of solving approaches for multiple objective flexible job shop scheduling problems. Cybern. Inf. Technol. 15, 3–22.
Geramianfar, R., Pakzad, M., Golhashem, H., Tavakkoli-Moghaddam, R., 2013. A multi-objective hub covering location problem under congestion using simulated annealing algorithm. Uncertain Supply Chain Manag. 1, 153–164.
Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discret. Math. 5, 287-326.
Huang, K.L., Liao, C.J., 2008. Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput. Oper. Res. 35, 1030–1046.
Jia, S., Hu, Z.H., 2014. Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem. Comput. Oper. Res. 47, 11–26.
Kao, Y.T., Chang, S.C., 2018. Setting daily production targets with novel approximation of target tracking operations for semiconductor manufacturing. J. Manuf. Syst. 49, 107–120.
Knowles, J., Corne, D., 2004. Bounded Pareto Archiving: Theory and Practice. Metaheuristics multiobjective Optim. Springer, Berlin, Heidelb. 39–64.
Kreipl, S, 2000. A large step random walk for minimizing total weighted tardiness in a job shop. J. Sched. 3,125-138.
Kuo, Y.H., 2023. An extended batch-oblivious approach for flexible Job shop with batching and material consumption when minimizing the total weighted material consumed and makespan. Unpublished master’s thesis, National Central University, Taoyuan City.
Lange, J., Werner, F., 2018. Approaches to modeling train scheduling problems as job-shop problems with blocking constraints. J. Sched. 21, 191–207.
Li, J.Q., Pan, Q.K., Chen, J., 2012. A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems. Int. J. Prod. Res. 50, 1063–1078.
Li, J.Q., Pan, Q.K., Tasgetiren, M.F., 2014. A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl. Math. Model. 38, 1111–1132.
M’Hallah, R., Al-Khamis, T., 2015. A Benders decomposition approach to the weighted number of tardy jobs scheduling problem on unrelated parallel machines with production costs. Int. J. Prod. Res. 53, 5977–5987.
Manne, A.S., 1960. On the job-shop scheduling problem. Oper. Res. 8, 219–223.
Mason, S.J., Fowler, J.W. and Matthew Carlyle, W., 2002. A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. J. Sched. 5, 247-262.
Mati, Y., Dauzere-Pérès, S., Lahlou, C., 2011. A general approach for optimizing regular criteria in the job-shop scheduling problem. Eur. J. Oper. Res. 212, 33–42.
Miguel A. González, Riccardo Rasconi, Angelo Oddi., 2022. Metaheuristics for multiobjective optimization in energy-efficient job shops. Engineering Applications of Artificial Intelligence. 115.
Mokhtari, H., Hasani, A., 2017. An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput. Chem. Eng. 104, 339–352.
Mönch, L., Fowler, J.W., Mason, S.J., 2012. Production planning and control for semiconductor wafer fabrication facilities: modeling, analysis, and systems. Springer Science & Business Media.
Moslehi, G., Mahnam, M., 2011. A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int. J. Prod. Econ. 129, 14–22.
Murovec, B., 2015. Job-shop local-search move evaluation without direct consideration of the criterion’s value. Eur. J. Oper. Res. 241, 320-329.
Muth, J.F., Thompson, G.L., 1963. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, N.J.
Nicoarǎ, E.S., Filip, F.G., Paraschiv, N., 2011. Simulation-based optimization using genetic algorithms for multi-objective flexible JSSP. Stud. Informatics Control 20, 333–344.
Nowicki, E., Smutnicki, C., 1996. A fast taboo search algorithm for the job shop problem. Manage. Sci. 42, 797–813.
Rabiee, M., Zandieh, M., Ramezani, P., 2012. Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches. Int. J. Prod. Res. 50, 7327–7342.
Pezzella, F., Merelli, E., 2000. Tabu search method guided by shifting bottleneck for the job shop scheduling problem. Eur. J. Oper. Res. 120, 297–310.
Pinedo, M., Singer, M., 1999. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Nav. Res. Logist. 46, 1–17.
Riquelme, N., Von Lücken, C., Baran, B., 2015. Performance metrics in multi-objective optimization. CLEI 2015: Arequipa, Peru. 1-11.
Roy, B. and Sussmann, B, 1964. Les Problems d’Ordon Ordonnancement Avec Constraints Disjunctives. SEMA. Note D.S., No. 9, Paris.
Schott, J.R., 1995. Fault tolerant design using single and multicriteria genetic algorithm optimization. Department of Aeronautics and Astronautics, Massachusetts Institute of Technology.
Schulz, S., Neufeld, J.S., Buscher, U., 2019. A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling. J. Clean. Prod. 224, 421–434.
Sebastian Knopp, Stéphane Dauzère-Pérès, Claude Yugma., 2017. A batch-oblivious approach for Complex Job-Shop scheduling problems. Eur. J. Oper. Res. 263(1), 50-61.
Sheen, G.J., 2023. A Bi-Objeective Optimization for Job Shop Scheduling Problem Minimizing Both Makespan and Number of Tardy Stage-Outs. Retrieved from National Science and Technology Council.
Singh, M.R., Singh, M., Mahapatra, S.S., Jagadev, N., 2016. Particle swarm optimization algorithm embedded with maximum deviation theory for solving multi-objective flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 85, 2353–2366.
Snyman, S. & Bekker, J., 2019. Comparing the performance of different metaheuristics when solving a stochastic bi-objective job shop scheduling problem. In Proceedings of the 2019 ORSSA Annual Conference.
Sobeyko, O., Mönch, L., 2016. Heuristic approaches for scheduling jobs in large-scale flexible job shops. Comput. Oper. Res. 68, 97–109.
Taillard, E.D., 1994. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem. ORSA J. Comput. 6(2), 107-220.
Tamaki, H., Kita, H., Kobayashi, S., 1996. Multi-objective optimization by genetic algorithms: A review. Proc. IEEE Int. Conf. Evol. Comput. 517–522.
Tamssaouet, K., Dauzère-Pérès, S., Knopp, S., Bitar, A., Yugma, C., 2022. Multiobjective optimization for complex flexible job-shop scheduling problems. Eur. J. Oper. Res. 296, 87–100.
Türkyılmaz, A., Senvar, O., Ünal. İ., Bulkan. S., 2022. A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem. Comput. Oper. Res. 141, 105694.
Vilcot G., Billaut J.C., 2008. A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur. J. Oper. Res. 190(2), 398-411.
VanLaarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K., 1992. Job shop scheduling by simulated annealing. Oper. Res. 40, 113–125.
Wagner, H.M., 1959. An integer linear-programming model for machine scheduling. Nav. Res. Logist. Q. 6, 131–140.
Wang, L., Wang, S., Liu, M., 2013. A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem. Int. J. Prod. Res. 51, 3574–3592.
Wu, G.L., Wei, K., Tsai, C.Y., Chang, S.C., Wang, N.J., Tsai, R.L., Liu, H.P., 1998. TSS: A daily production target setting system for fabs. In 1998 Semicond. Manuf. Technol. Workshop. 86–98.
Xia, W., Wu, Z., 2005. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 48, 409–425.
Xing, L.N., Chen, Y.W., Yang, K.W., 2009. An efficient search method for multi-objective flexible job shop scheduling problems. J. Intell. Manuf. 20, 283–293.
Yan, H., Sen, Li, W.C., 2017. A multi-objective scheduling algorithm with self-evolutionary feature for job-shop-like knowledgeable manufacturing cell. J. Intell. Manuf. 28, 337–351.
Yuan, Y., Xu, H., 2015. Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans. Autom. Sci. Eng. 12, 336–353.
Zhang, C.Y., Li, P.G., Guan, Z.L., Rao, Y.Q., 2007. A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput. Oper. Res. 34, 3229–3242.
Zhang, C.Y., Li, P.G., Rao, Y.Q., Guan, Z.L., 2008. A very fast TS/SA algorithm for the job shop scheduling problem. Comput. Oper. Res. 35, 282–294.
Zhang, G., Shao, X., Li, P., Gao, L., 2009. An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 56, 1309–1318.
Zhang, R., Wu, C., 2011. A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective. Comput. Oper. Res. 38, 854–867.
Zhou, H., Cheung, W., Leung, L.C., 2009. Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. Eur. J. Oper. Res. 194,637-649. |