整合產品製造與成品配送兩階段問題方面

1. 考慮加入適用於其他情境的假設，如加入時窗限制、整備時間或 卸貨時間的限制等，以期問題能更符合真實情境。

2. 探討不同的目標函數，如加入與運送相關之操作成本或是與滿足 交貨期限要求的目標，以更符合實際應用的需求。

參考文獻 參考文獻 參考文獻 參考文獻

周碩鴻 (2006)。應用基因演算法求解供應鏈中生產排程與物流配送兩階段 總成本最小化問題。國立交通大學工業工程與管理學系，碩士論文。

陳昱皓 (2006) 。塔布搜尋法於求解供應鏈中整合生產排程與成品配送兩 階段問題，國立交通大學工業工程與管理學系，碩士論文。

陳正雄 (2000)。塔布搜尋法在塑化排程之應用-以 BOPP FILM 為例。元智 大學工業工程研究所，碩士論文。

夏萬春 (2000)。塔布搜尋法於車輛排班之探討。國立高雄第一科技大學機 械工程研究所，碩士論文。

蔡志強 (2003)。以蟻群系統建立物流宅配最佳化配送路徑規劃。國立屏東 科技大學工業管理系，碩士論文。

Allahverdi, A. and J. Mittenthal (1994).Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time.

Naval Research Logistics, 41(5), 677-682.

Azizoglu, M. and O. Kirka (1999). Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions, 31, 153–159.

Bodin, L.D., B.L. Golden, A.A. Assad and M.O. Ball (1983). Routing and scheduling of vehicle and crews-the state of the art. Computer &

Operations Research, 10, 69-211.

Booker, L. B., D. E. Goldberg and J. H. Holland (1989). Classifier systems and genetic algorithms. Artificial Intelligence, 40(1-3), 235-282.

Bruno, L.G., E.G. Coffman and R. Sethi (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17, 382–387.

Chang, Y. C. , C. Y. Lee (2003). Logistics scheduling: analysis of two-stage problems. Journal of System Science And Systems Engineering, 12(4), 371-393.

Chang, Y. C. , C. Y. Lee (2004). Machine scheduling with job delivery coordination. European Journal of Operation Research, 158(2), 470-487 .

Chen, J.F. (2006). Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. International Journal of Advanced Manufacturing Technology, 29(5), 557-563.

Chen, Z.L. and G.L. Vairaktarakis (2005). Integrated scheduling of production and distribution operations. Management Science, 51(4), 614-628.

Chiu, H.N. (1995). The integrated logistics management system: a framework and case study. International Journal of Physical Distribution &

Logistics Management, 25(6), 4-22.

Christofides, N., A. Mingozzi, and P. Toth (1981).Exact algorithm for the vehicle routing problem, based on Spanning Tree and shortest path relaxations. Mathematical Programming, 20, 255-282.

Class, C.A., C.N. Potts and P. Shade (1994). Unrelated parallel machine scheduling using local search. Mathematical and Computer Modeling, 24(9), 11-19.

Colorni, A., M. Dorigo, and V. Maniezzo (1991). Distributed optimization by ant colonies. F. J. Varela and P. Bourgine (Ed.), In Proceedings of the First European Conference on Artificial Life (pp. 134-142). Cambridge, Massachusetts: MIP Press.

Dorigo, M. and L. M. Gambardella (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53-66.

Fisher, M.L. and R. Jaikumar. (1978). A decomposition algorithm for large-scale vehicle routing. working paper 78-11-05, Department of Decision Sciences, University of Pennsylvania.

Fisher, M.L. and R. Jaikumar (1981). A generalized assignment heuristic for vehicle routing. Networks, 11, 109-124.

Garey, M.R. and D.S. Johnson (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman and Company.

Gendreau, M., A. Hertz and G. Laporte (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 12, 76-90.

Ghirardi, M. and C.N. Potts (2005). Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach.

European Journal of Operational Research, 165(2), 457-467.

Glover, F. (1989). Tabu search: Part I. ORSA Journal on Computing, 1, 190-206.

Glover, F. (1990). Tabu search: Part II. ORSA Journal on Computing, 2, 4-32.

Hall, N.G. and C.N. Potts (2003). Supply chain scheduling：batching and delivery. Operation Research, 51(4), 566-584.

Hall, N.G. and C.N. Potts (2005). The coordination of scheduling and batch deliveries. Annals of Operations Research, 135, 41-64.

Herrmann, J., J.M. Proth and N. Sauer (1997). Heuristics for unrelated machine scheduling with precedence constraints. European Journal of

Operational Research, 102,(3): 528-537.

Ho, S.C. and D.Haugland (2004). A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers &

Operations Research, 31, 1947–1964.

Holland, J.H. (1992). Genetic algorithms. Scientific American, 267(1), 66-72.

Homberger, J. and H. Gehring (2005). A two-phase hybrid meta-heuristic for the vehicle routing problem with time windows. European Journal of Operational Research, 162, 220–238.

Horn, W.A. (1973). Minimizing average flow time with parallel machines.

Operations Research, 21, 846–847.

Hsieh, J.C., P.C. Chang and L.C. Hsu (2003). Scheduling of drilling operations in printed circuit board factory. Computers & Industrial Engineering, 44, 461-473.

Kirkpatrick, S., C.D. Gelatt and M.P. Vecchi (1983). Optimization by simulated annealing. Science, 220(4598), 671-680.

Lee, C.Y. and Z.L. Chen (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3-24.

Lee, I. (2001). Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs. Computers &Operations Research, 28, 835-852.

Li, C. L., G. Vairaktarakis, C. Y. Lee. (2003). Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research, 164, 39–51.

Liaw, C.F., Y.K. Lin and C.Y. Cheng (2003). Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers & Operations Research, 30(12), 1777-1789.

Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59, 345-358.

Metropolis, N., A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller and E. Teller, (1953). Equations of calculation by fast computing machines, Journal of Chemical Physics, 21(6), 1087-1092, 1953.

Mokotoff, E. and J.L. Jimeno (2002). Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Annals Journal of Operational Research, 117(1-4), 133-150.

Nowicki E., and C. Smutnicki (1998). The flow shop with parallel machines: A tabu search approach. European Journal of Operational Research, 106(2-3):, 226-253

Osman, I. H. (1993). Meta-strategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41, 421-451.

Piersma, N. and W.Van Dijk (1996). A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. Math Computer Modeling, 24(9), 11-19.

Pirlot, M (1996). General local search methods. European Journal of Operational Research, 92(3), 493-511.

Reeves, C.R. (1993). Improving the efficiency of tabu search for machine sequencing problems. Journal of the Operational Research Society, 44(4), 375-382.

Renaud, J., G. Laporte and F.F. Boctor (1996). A tabu search heuristics for the multi-depot vehicle routing problems. Computer& Operations Research, 23(3), 229-235.

Sarmiento, A. M., R. Nagi (1999). A review of integrated analysis of

production-distribution systems. IIE Transactions 31 (11), 1061-1074.

Suresh, V. and D. Chaudhuri (1994). Minimizing maximum tardiness for unrelated parallel machines. International Journal of Production Economics, 34(2), 223-239.

Suresh, V. and D. Chaudhuri (1996). Bicriteria schelduling problem for

unrelated parallel machines. Computer & Industrial Engineering, 30(1), 77-82.

Thomas, D. J. and P. M. Griffin (1996). Coordinated supply chain management.

European Journal of Operational Research, 94, 1-15.

Weng, M. , J. Lu and H. Ren (2001). Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective.

International Journal of Production Economics, 70, 215–226.