Advanced search
Publication Cover
Journal of the Chinese Institute of Industrial Engineers Volume 20, 2003 - Issue 6
Journal homepage
46
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

SOLUTION MODELS CONSTRUCTION FOR OPEN SHOP SCHEDULING PROBLEM WITH SETUP, PROCESSING, AND REMOVAL TIMES SEPARATED

Chinyao Low Department of Industrial Engineering, Da-Yeh University, 112 Shan-Jiau Road, Da-Tsuen, Chang-hua
,
Jinn-Yi Yeh Department of Industrial Engineering, Da-Yeh University, 112 Shan-Jiau Road, Da-Tsuen, Chang-hua
&
Fang-Wu Low Department of Industrial Engineering, Da-Yeh University, 112 Shan-Jiau Road, Da-Tsuen, Chang-hua
Pages 565-574 | Received 01 Sep 2002, Accepted 01 Jul 2003, Published online: 15 Feb 2010

  • Achugbue , J. O. and Chin , F. Y. 1982 . Scheduling the open shop to minimize mean flow time . SIAMJ. Comput. , 11 : 709 – 720 .
  • Brucker , P. , Johann , H. , Bernd , J. and Birgit , W. 1997 . A branch & bound algorithm for the open shop problem . Discrete Applied Mathematics , 76 : 43 – 59 .
  • Du , J. Z. and Leung , Y. T. 1993 . Minimizing mean flow time in two-machine open shops and flow shops . Journal of Algorithms , 14 : 24 – 44 .
  • Gonzalez , T. and Sahni , S. 1976 . Open shop scheduling to minimize finish time . Journal of The Association for Computing Machinery , 23 ( 4 ) : 665 – 679 .
  • Kyparisis , G. J. and Koulamas , C. 2000 . Open shop scheduling with makespan and total completion time criteria . Computers & Operations Research , 27 ( 1 ) : 15 – 27 .
  • Liaw , C. 1999 . Applying simulated annealing to the open shop scheduling problem . IIE Transactions , 31 ( 5 ) : 457 – 465 .
  • Liaw , C. 1999 . An iterative improvement approach for the nonpreemptive open shop scheduling problem . European Journal of Operational Research , 111 ( 3 ) : 509 – 517 .
  • Liaw , C. 1999 . A tabu search algorithm for the open shop scheduling problem . Computers & Operations Research , 262 ( 2 ) : 109 – 126 .
  • Liaw , C. 2000 . A hybrid genetic algorithm for the open shop scheduling problem . European Journal of Operational Research , 124 ( 1 ) : 28 – 42 .
  • Liawler , E. L. , Lenstra , J. K. and Rinnooy Kan , A. H. G. 1981 . Minimizing maximum lateness in a two-machine open shop . Mathematics of Operations Research , 6 ( 1 ) : 153 – 158 .
  • Lin , H. F. , Liu , C. Y. and Liu , P. Y. 1995 . A heuristics approach to the total tardiness in nonpreemptive open shop scheduling . International Journal of Industrial Engineering , 2 ( 1 ) : 25 – 33 .
  • Lin , H. F. 1995 . A heuristics solution to the total tardiness and earliness penalties of an m-machine nonpreemptive scheduling . Journal of The Chinese Institue of Industrial Engineering , 15 ( 2 ) : 159 – 167 .
  • Pinedo , M. 1995 . Scheduling: Theory, Algorithm and Systems Englewood Cliffs, NJ : Prentice-Hall .
  • Low , C. and Wu , T. H. 2001 . Mathematical modeling and heuristic approaches to operation scheduling problems in an FMS environment . International Journal of Production Research , 39 ( 4 ) : 689 – 708 .
  • Proust , C. , Gupta , J. N. D. and Deschamps , V. 1991 . Flowshop scheduling with set-up, processing and removal times separated . International Journal of Production Research , 29 : 479 – 493 .
  • Strusevich , V. A. 1993 . Two machine open shop scheduling problem with setup, processing and removal times separated . Computational Operation Research , 20 : 597 – 611 .
  • Sule , D. R. 1982 . Sequencing n jobs on two machines with setup, processing and removal times separated . Naval Research Logistics Quarterly , 29 : 517 – 519 .
  • Sule , D. R. and Huang , K. Y. 1983 . Sequency on two and three machines with setup, processing and removal times separated . International Journal of Production Research , 21 : 723 – 732 .
  • Sule , D. R. 1996 . Industrial Scheduling 187 – 218 . PWS. Publishing Company .
  • Yoshida , T. and Hitomi , K. 1979 . Optimal two-stage production scheduling with setup times separated . AIIE Transactions , 11 : 261 – 263 .

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.