參考文獻 |
參考文獻
1.許淑芬, “具等候時間窗口限制之零工式生產排程問題,”國立中央大
學研究所碩士論文, 1998.
2.Adams, J., Balas, E., and Zawack, D., “The Shifting
Bottleneck Procedure for Job Shop Scheduling,” Management
Science, 34(3), 1989, pp 391-401.
3.Ahn, B. H., and Shin, J. Y., “Vehicle-routing with Time
Windows and Time-varying Congestion,” Journal of Operational
Research Society, 42, 1991, pp 393-400.
4.Armstrong, R., and Lei, L., and Gu, S., “A Bounding Scheme
for Deriving the Minimal Cycle Time of a Single-transporter N-
stage Process with Time-window Constraint,” European Journal
of Operational Research, 78, 1994 ,pp 130-140.
5.Carlier, J., and Pinson, E., “An Algorithm for Solving the
Job-shop Problem,” Management Science, 35, 1989, pp 164-176.
6.Carlier, J., and Pinson, E., “Adjustments of Heads and Tails
for the Job-shop Scheduling Problem,” In the European
Journal of Operational Research, 78, 1994, pp 146-161.
7.Desrosiers, J., Soumis, F., Desrochers, M., and Sauve., M.,
“Methods for Routing with Time Windows,” European Journal of
Operational Research, 23, 1986, pp 236-245.
8.Desrochers, J., Desrosiers, M., and Solomom, M., “A New
Optimization Algorithm for the Vehicle Routing Problem with
Time Windows ,” Operations Research, 40, 1992, pp 342-354.
9.Desrosiers, J., Dumas, Y., Gelinas, E., and Solomom, M., “An
Optimal Algorithm for the Traveling Salesman Problem with
Time Windows,” Operations Research, 43, 1995, pp 367-371.
10.Fisher, M., and Jaikumar, R., “A Generalized Assignment
Heuristic for Vehicle Routing,” Networks, 11(2), 1981, pp
109-124.
11.Gillett, B., and Miller, L., “A Heuristic Algorithm for the
Vehicle Dispatch Problem,” Operations research, 22, 1974,
pp 340-349.
12.Grabowski, J., and Janiak, A., “Job Shop Scheduling with
Resource - Time Models of Operations,” European Journal of
Operational Research, 28, 1987, pp 58-73.
13.Kolen , A., Rinnooy Kan, A. H. G., and Trienekens, H. W. J.
M., “Vehicle Routing with Time Windows,” Operations
Research, 35, 1987, pp 266-273.
14.Koskosidis, Y. A., and Powell, W. B., “Clustering
Algorithms for Consolidation of Customer Orders into Vehicle
Shipments,” Transportation Research-B, 26B, 1992, pp 365-
379.
15.Lei, L., and Wang, T. J., “A proof: The Cyclic Hoist
Scheduling Problem is NP-complete,” Working paper No.89-16,
Rutger University, August 1989.
16.Lei, L., and Wang, T. J., “The Minimum Common-cycle
Algorithm for Cycle Scheduling of Time Windows
Constraints,” Management Science, 37/12,1991, pp 1629-1639.
17.Levy, L., and Bodin, L., “Scheduling the Postal Carriers
for the United States Postal Service : An Application of Arc
Partitioning and Routing,” In: Golden, B. L. and Assad, A.
A. (eds.), Vehicle Routing: Methods and Studies,North-
Holland,1988.
18.Phillips, D. T., and Alberto, G. D., “Fundamentals of
Network Analysis,” Prentice-Hall, Chapter 2, 1981, pp 72-90.
19.Phillips, L. W., and Unger, P. S., “Mathematical
Programming Solution of a Hoist Scheduling Program,” AIIE
Transactions, 8/2, 1976, pp 219-225.
20.Psaraftis, H., “An Exact Algorithm for the Single Vehicle
Many-to-many Dail-a-ride Problem with Time Windows,”
Transportation Science, 17, 1983, pp 351-360.
21.Shapiro, G. W., and Nuttle, H. W., “Hoist Scheduling for a
PCB Electroplating Facility,” AIIE Transactions, 20/2,
1988, pp 157-167.
22.Shier, D. R., “Iterative Methods for Determining the k
Shortest Paths in a Network,” Networks, 6, 1976, pp 205-230.
23.Swersey, A. J., and Ballard, W., “Scheduling School
Buses,” Management Science, 30, 1984, pp 844-853.
24.Yamada, T., and Nakano, R., “Job-shop Scheduling,” Genetic
Algorithms in Engineering Systems, Chapter 7, 1997, pp 134-
160.
25.Yang, D. L., and Chern, M. S.,“A Two Machine Flow shop
Sequencing Problem with Limited Waiting Time Constraints,”
Computers and Industrial Engineering, 28/2, 1994, pp 63-70.
26.Yih, Y., Liang, T. P., and Moskowitz, H., “Robot Scheduling
in a Circuit Board Production Line a Hybrid OR/ANN
Approach,” AIIE Transactions, 1993. |