40
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

禁忌搜尋法在彈性零工型製造系統排程之探討

An application of Tabu Search in flexible job shop scheduling

Pages 605-615 | Received 01 Apr 1998, Accepted 01 Feb 1999, Published online: 30 Mar 2012

References

  • Adams , J. , Balas , Egon and Zawack , Daniel . 1988 . “The shifting bottleneck procedure for job shop scheduling” . Management Science , 34 : 391 – 401 .
  • Anderson , E. J. and Nyirenda , J. C. 1990 . “Two new rules to minimize tardiness in a job shop” . International Journal of Production Research , 28 ( 12 ) : 2277 – 2292 .
  • Barnes , J. W. and Laguna , M. 1993 . “Solving the multiple machine weighted flow time problem using tabu search” . IIE Transactions , 25 ( 2 ) : 121 – 128 .
  • Barnes , J. W. and Chambers , J. B. 1995 . “Solving the job shop scheduling problems with tabu search” . IIE Transactions , 27 ( 2 ) : 257 – 263 .
  • Blazewicz , Jacek , Domschke , Wolfgang and Pesch , Edwin . 1996 . “The job shop scheduling problem: convention and new solution techniques” . European Journal of Operational Research , 93 : 1 – 33 .
  • Chen , Chuen-Lung , Vempati , Venkateswara S. and Nasser , A. 1995 . “An application of genetic algorithms for flow shop problems” . European Journal of Operational Research , 80 : 389 – 396 .
  • Dell'Amico , M. and Trubian , M. 1993 . “Applying tabu search to the job shop scheduling problem” . Annals of Operational Research , 41 ( 2 ) : 231 – 252 .
  • 1997 . Tabu Search , Kluwer Academic Publishers .
  • Hor Edwin , S. H. , Nikawan , A. and Hong , R. 1994 . “A genetic algorithms for multiprocessor scheduling” . IEEE Transaction on Parallel and Distributed System , 15 ( 2 ) : 113 – 120 .
  • Hutchison , J. , Leong , K. , Snyder , D. and Ward , P. 1991 . “Scheduling approaches for random job shop flexible manufacturing systems” . International Journal of Production Economics , 29 ( 5 ) : 1053 – 1067 .
  • Kolahan , F. M. and Liang , M. Z. 1995 . “Solving the combined part sequencing and tool replacement center: a tabu search approach” . Computers industrial Engineering , 28 ( 4 ) : 731 – 743 .
  • Krishan , K. , Ganeshan , K. and Ram , D. J. 1995 . “distributed simulated annealing algorithm for job shop scheduling” . IEEE Transaction on Systems, Man and Cybernetics , 25 ( 7 ) : 1102 – 1109 .
  • Lourenco , H. R. 1995 . “Job-shop scheduling: computational study of local search and large-step optimization methods” . European Journal of Operational Research , 83 : 347 – 364 .
  • Moser , M. and Engell , S. 1992 . “A survey of priority rules for FMS scheduling and their performance for the benchmark problem” . Proceedings of the 31st Conference on Decision and Control , : 392 – 397 .
  • Murata , Tadahiko and Hisao , Ishibuchi . 1994 . “performance evaluation of genetic algorithm for flow shop scheduling problem” . IEEE Transaction on Engineering Management , 22 ( 2 ) : 812 – 817 .
  • Raghu , T. S. and Rajendrn , C. 1995 . “Due-date setting methodologies based on simulated annealing- an experimental study in a real-life job shop” . International Journal of Production Research , 33(9) : 2535 – 2554 .
  • Sawik , Tadeusz . 1990 . “Modeling and scheduling of flexible manufacturing system” . European Journal of Operational Research , 45 : 177 – 190 .
  • Song , Ju-Seog auT. E. 1996 . “A tabu search procedure for periodic job shop scheduling” . Computers Industrial Engineering , 30 ( 3 ) : 433 – 447 .
  • Sridhar , J. and Rajendran , C. 1993 . “Scheduling in a cellular manufacturing system: a simulated annealing approach” . International Journal of Production Research , 31(12) : 2927 – 2945 .
  • Van Laarhoven , P. J. M. , Aarts , E. H. L. and J. K. Lenstra . 1992 . “Job shop scheduling by simulated annealing” . Operations Research , 40 ( 1 ) : 113 – 125 .
  • Wen , Ue-Pyng and Yeh , Ching-I . 1997 . “Tabu search methods for the 11ow shop sequencing problem” . Journal of the Chinese Institute of Engineers , 20 ( 4 ) : 465 – 470 .
  • Widmer , M., and Hertz , A. 1989 . “A new heuristic method for the flow shop sequencing problem” . European Journal of Operations Research , 41 : 186 – 193 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.