在此論文當中，我們研究了一個新的彈性零工式排程的新問題，名為「有效節能之彈性零工式排程問題」。近年來，由於如何有效的利用能源日趨重要，因此我們研究的目標為如何在給定的時間限制內使總能量消耗值最小化。為了進一步減少耗能，我們改善且加強了原先問題當中機器的定義─機器不但是多功能的，每部機器尚能以多樣的速度模式運作，伴隨著不同功率的消耗。在一個時間限制下，使用以低耗能模式運作的機器對能量減少總是十分有利的。我們採用整數線性規劃來使總消耗能量之值最佳化，同時解決如何安置操作於機器以及操作的先後順序關係。研究實驗結果顯示，提出的演算法確實在減少能量方面十分有效。

In this thesis, we study a new Flexible Job−Shop Scheduling Problem (FJSP) named Energy−Efficient Flexible Job−Shop Scheduling Problem (EEFJSP). Our goal is to minimize the total energy consumption under a makespan constraint. In our problem, machines are multi−functional and each machine may run in various speed modes consuming different amount of power. Within a time constraint, it is always beneficial to use a machine running in a low power mode. We employ an ILP−based approach for machine assignment and operation sequencing under a makespan constraint while minimizing total energy consumption. Experimental results show that the proposed algorithm is indeed effective for energy minimization.

[1] P. Brandimarte, “Routing and scheduling in a flexible job shop by tabu search,” Annals of Operations Research, vol. 41, no. 3, pp. 157–183, 1993.
[2] I. Kacem, S. Hammadi, and P. Borne, “Approach by localization and multiobjective evolutionary optimization for flexible job−shop scheduling problems,” IEEE Transactions on systems, man, and cybernetics, Part C, vol. 32, no. 1, pp. 1–13, 2002a.
[3] I. Kacem, S. Hammadi, and P. Borne, “Pareto−optimality approach for flexible job−shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic,” Mathematics and Computers in Simulation, vol. 60, pp. 245–276, 2002b.
[4] W. Xia and Z. Wu, “An effective hybrid optimization approach for multi−objective flexible job−shop scheduling problems,” Computers and Industrial Engineering, vol. 48, no. 2, pp. 409–425, 2005.
[5] G. Zhang, X. Shao, P. Li, and L. Gao, “An effective hybrid particle swarm optimization algorithm for multi−objective flexible job−shop scheduling problem,” Computers and Industrial Engineering, vol. 56, pp. 1309–1318, 2009.
[6] J. Gao, L. Sun, and M. Gen, “A hybrid genetic and variable neighborhood descent algorithm for flexible job−shop scheduling problems,” Computers and Operations Research, vol. 35, pp. 2892–2907, 2008.
[7] P. Bruker and R. Schlie, “Job−shop scheduling with multi−purpose machines,” Computing, vol. 45, no. 4, pp. 369–375, 1990
[8] E. Hurink, B. Jurisch, and M. Thole, “Tabu Search for the Job Shop Scheduling Problem with multi-purpose machines,” Operations Research Spektrum, vol. 15, no. 4, pp. 205–215, 1994.
[9] L. F. Tung Lf, L. Li, and R. Nagi, “Multi-objective scheduling for the hierarchical control of flexible manufacturing systems,” The International Journal of Flexible Manufacturing Systems, vol. 11, no. 4, pp. 379–409, 1999.
[10] S. Dauzere-Peres and J. Paulli, “An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using Tabu Search,” Annals of Operations Research, vol. 70, no. 3, pp. 281–306, 1997.
[11] M. Mastrolilli, and L. M. Gambardella, “Effective neighborhood functions for the flexible job shop problem,” Journal of Scheduling vol. 11, no. 4, pp. 379–409, 1999.
[12] M. R. Garey, D. S. Johnson, and R. Sethi, “The complexity of flowshop and job−shop scheduling,” Mathematics of Operations Research, vol. 1, pp. 117–129, 1976.
[13] Y. C. Lee and A. Y. Zomaya, “Minimizing Energy Consumption for Precedence−constrained Applications Using Dynamic Voltage Scaling,” IEEE/ACM 9th International Symposium on Cluster Computing and the Grid, 2009.
[14] K. H. Kim, R. Buyya, and J. Kim, “Power AwareScheduling of Bag−of−Tasks Applications with Deadline Constraints on DVS−enabled Clusters,” Proc. the 7th IEEE International Symp. Cluster Computing and the Grid, 2007.
[15] D. P. Bunde, “Power−aware scheduling for makespan and flow,” Proc. the 8th annual ACM symposium on Parallelism in algorithms and architectures, 2006.
[16] D. Zhu, R. Melhem, and B. R. Childers, “Scheduling with Dynamic voltage/speed adjustment using slack reclamation in multiprocessor real−time systems,” IEEE Trans. Parallel Dist. Systems, vol. 14, no. 7, pp. 686–700, 2003.
[17] D. Zhu, D. Mosse, and R. Melhem, “Power−aware scheduling for AND/OR graphs in real−time systems,” IEEE Trans. Parallel Dist. Systems, vol. 15, no. 9, pp. 849–864, 2004.
[18] R. Ge, X. Feng, and K. W. Cameron, “Performance−constrained Distributed DVS Scheduling for Scientific Applications on Power−aware Clusters,” Proc. the ACM/IEEE Conference on Supercomputing, pp. 34–44, 2005.
[19] B. Rountree, D. K. Lowenthal, S. Funk, V.W. Freeh, B. R. de Supinski, and M. Schulz, “Bounding energy consumption in large−scale MPI programs,” Proc. the ACM/IEEE Conference on Supercomputing, 2007.
[20] J. Cong, and K. Gururaj, “Energy Efficient Multiprocessor Task Scheduling under Input−dependent Variation,” DATE 2009, pp. 411–416, 2009.
[21] W. Kim, M. S. Gupta, G.−Y. Wei and D. Brooks. “System Level Analysis of Fast, Per−Core DVFS using On−Chip Switching Regulators,” International Symposium on High−Performance Computer Architecture, 2008
[22] ILOG CPLEX User’s Guideline:
http://class.ece.iastate.edu/ee458/CplexLargeUsersManual.pdf
[23] C.−T. Hwang, J.−H. Lee, and Y.−C. Hsu, “A formal approach to the scheduling problem in high−level synthesis,” IEEE Transactions on Computer−Aided Design of Integrated Circuits and Systems, vol. 10, No. 4, pp.464−475, 1991.
[24] S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, May 1983.
[25] J. Kennedy and R. Eberhart, “Particle swarm optimization,” Proceeding of the 1995 IEEE international conference on neural network, vol. 4, pp. 1942–1948, 1995.