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

SCHEDULING OPEN SHOPS TO MINIMIZE TOTAL WEIGHTED TARDINESS

Ching-Fang Liaw Department of Industrial Engineering and Management, Chaoyang University of Technology, 168, Gi-feng East Road, Wu-feng Shiang, Taichung, Taiwan, 413, R.O.C.
&
An-Hsiang Lin Department of Industrial Engineering and Management, Chaoyang University of Technology, 168, Gi-feng East Road, Wu-feng Shiang, Taichung, Taiwan, 413, R.O.C.
Pages 29-42 | Received 01 Aug 2000, Accepted 01 Apr 2001, Published online: 17 Feb 2010

  • Anderson , E. J. and Nyirendan , J. C. 1990 . Two new rules to minimize tardiness in a job shop . International Journal of Production Research , 28 ( 12 ) : 2277 – 2292 .
  • Armentano , V. A. and Scrich , C. R. 2000 . Tabu search for minimizing total tardiness in a job shop . International Journal of Production Economics , 63 ( 2 ) : 131 – 140 .
  • Arementano , V. A. and Ronconi , D. P. 1999 . Tabu search for total tardiness minimization in flowshop scheduling problems . Computers and Operations Research , 26 ( 3 ) : 219 – 235 .
  • Baker , K. R. and Kanet , J. J. 1983 . Job shop scheduling with modified due date . Journal of Operations Management , 4 : 11 – 22 .
  • Baker , K. R. 1984 . Sequencing rules and due date assignments in a job shop . Management Science , 30 : 1093 – 1104 .
  • Croce , D. F. , Gupta , J. N. D. and Tadei , R. 2000 . Minimizing tardy jobs in a flowshop with common due date . European Journal of Operational Research , 120 : 375 – 381 .
  • Brucker , P. , Johann , H. , Bernd , J. and Birgit , W. 1997 . A branch and bound algorithm for the open shop problem . Discrete Applied Mathematics , 76 : 43 – 59 .
  • Bayeon , E. S. , Wu , S. D. and Robert , H. S. 1998 . Decomposition heuristics for robust job shop scheduling . IEEE Transactions on Robotics and Automation , 14 ( 2 ) : 303 – 313 .
  • Gelder , L. F. and Sambandam , N. 1978 . Four simple heurstics for scheduling a flow-shop . International Journal of Production Research , 16 : 221 – 231 .
  • Giffler , B. and Thompson , G. L. 1960 . Algorithm for solving production scheduling problems . Operations Research , 8 : 487 – 503 .
  • Gonzalez , T. and Sahni , S. 1976 . Open shop scheduling to minimize finish time . Journal of the Association for Computing Machinery , 23 ( 4 ) : 665 – 679 .
  • Gupta , J. N. D. and Hariri , A. M. A. 1997 . Two machine flow-shop to minimize number of tardy jobs . Journal of the Operational Research Society , 48 : 212 – 220 .
  • Hariri , A. M. A. and Potts , C. N. 1989 . A branch and bound algorithm to minimize number of tardy jobs . European Journal of Operational Research , 38 : 228 – 237 .
  • Holthaus , O. and Chandrasekharanb , R. 1997 . Efficient dispatching rules for scheduling in a job shop . International Journal of Production Economics , 48 ( 1 ) : 87 – 105 .
  • Kanet , J. J. and Hayya , J. C. 1982 . Priority dispatching with operation due date . Journal of Operations Management , 2 : 167 – 175 .
  • Kim , Y. 1993 . A new branch and bound algorithm for minimizing mean Ttrdiness in two-machine flowshop . Computers and Operations Research , 20 : 391 – 401 .
  • Kim , Y. 1993 . Heuristics for flowshop scheduling problems minimizing tardiness . Journal of Operational Research Society , 44 : 19 – 28 .
  • Kim , Y. 1995 . Minimizing mean tardiness on flowshop . European Journal of Operational Research , 85 : 541 – 555 .
  • Kyparisis , G. J. and Christosa , K. 1997 . Open shop scheduling with maximal machines . Discrete Applied Mathematics , 78 : 175 – 187 .
  • Liaw , C. 2000 . A hybrid genetic algorithm for the open shop scheduling problem . European Journal of Operational Research , 124 ( 1 ) : 28 – 42 .
  • Liaw , C. 1999 . A Tabu search algorithm for the open shop scheduling problem . Computers and Operations Research , 26 ( 2 ) : 109 – 126 .
  • Liaw , C. 1998 . An iterative improvement approach for the nonpreemptive open shop scheduling problem . European Journal of Operational Research , 111 ( 3 ) : 509 – 517 .
  • Lin , H. F. 1998 . A heurstics solution to the total tardiness and earliness penalties of an m-machine nonpreemptive schedule . Journal of the Chinese Institute Of Industrial Engineers , 15 ( 2 ) : 159 – 167 .
  • Lin , H. F. , Liu , C. Y. and Liu , P. Y. 1995 . A heurstics approach to the total tardiness in nonpreemptive open shop scheduling . International Journal of Industrial Engineering , 2 ( 1 ) : 25 – 33 .
  • Lin , H. F. 1995 . A heurstic solution to the total tardy cost of an m-machine non-preemptive open shop scheduling . Sun Yat Sen Management Review , 3 ( 4 ) : 122 – 143 .
  • Nawaz , M. , Enscore , E. E. and Ham , I. 1983 . A heurstics algorithm for the m-machine n-job flow-shop sequencing problem . OMEGA , 11 : 91 – 95 .
  • Pinedo , M. 1995 . Scheduling: Theory, Algorithm and Systems Englewood Cliffs, New Jersey : Prentice-Hall .
  • Sabuncuoglu , I. and Bayiz , M. 1999 . Job shop scheduling with beam search . European Journal of Operational Research , 118 : 390 – 412 .
  • Sen , T. , Dileepan , P. and Gupta , J. N. D. 1993 . The two machine flowshop with total tardiness . Computers and Operations Research , 20 : 391 – 401 .
  • Singer , M. and Michael , P. 1998 . A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops . IIE Transactions , 30 : 109 – 118 .
  • Sule , D. R. 1996 . Industrial Scheduling 187 – 218 . Boston : PWS Publishing Company .
  • Townsend , W. 1977 . Sequencing n jobs on m machine to minimize maximum tardiness . Management Science , 23 : 1016 – 1019 .
  • Vepsalainen , A. P. J. and Morton , T. E. 1987 . Priority rules for job shops with weighted tardiness costs . Management Science , 33 : 1035 – 1047 .
  • Widmer , M. and Hertz , A. 1989 . A new heurstics method for the flow shop sequencing problem . European Journal of Operational 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:

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.