Advanced search
Publication Cover
International Journal of Systems Science Volume 28, 1997 - Issue 4
Submit an article Journal homepage
147
Views
25
CrossRef citations to date
0
Altmetric
Original Articles

Two-machine flowshop scheduling to minimize total tardiness

JASON CHAO-HSIEN PAN Department of Industrial Management, National Taiwan Institute of Technology, 43 Keelung Road, Section 4, Taipei, Taiwan, Republic of China
&
EN-TSU FAN Department of Industrial Management, National Taiwan Institute of Technology, 43 Keelung Road, Section 4, Taipei, Taiwan, Republic of China
Pages 405-414 | Received 15 Jul 1996, Accepted 20 Sep 1996, Published online: 05 Apr 2007

References

  • BAKER , K. R. , and SCHRAGE , L. E. , 1978 , Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks . Operations Research , 26 , 111 – 120 .
  • EMMONS , H. , 1969 , One-machine scheduling to minimize certain function of job tardiness . Operations Research , 17 , 701 – 715 .
  • FISHER , M. L. , 1976 , A dual algorithm for the one-machine scheduling problem . Mathematical Programming , 11 , 229 – 251 .
  • GHLDERS , L. , and SAMBANDAM , N. , 1978 , Four simple heuristic for scheduling a flow-shop . International Journal of Production Research , 16 , 221 – 231 .
  • JOHNSON , S. M. , 1954 , Optimal two- and three-stage production schedules with set-up times included . Naval Research Logistics Quarterly , 1 , 61 – 68 .
  • KIM , Y. , 1993a , Heuristics for flowshop scheduling problems minimizing mean tardiness . Journal of Operational Research Society , 44 , 19 – 28 ; 1993b, A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers and Operations Research, 20, 391–401 .
  • PICARD , J. , and QUEYRANNE , M. , 1978 , The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling . Operations Research , 26 , 86 – 110 .
  • POTTS , C. N. , and VAN WASSENHOVE , L. N. , 1982 , A decomposition algorithm for the single machine total tardiness problem . Operations Research Letters , 1 , 177 – 180 .
  • RINNOOY KAN , A. H. G. , 1976 , Machine Scheduling Problems: Classification, Complexity and Computations ( Holland : Martinus Nijhoff ).
  • RINNOOY KAN , A. H. G. , LAGEWEO , B. J. , and LENSTRA , J. K. , 1975 , Minimizing total costs in one-machine scheduling . Operations Research , 23 , 908 – 927 .
  • SCHRAGE , L. E. , and BAKER , K. R. , 1978 , Dynamic programming solution of sequencing problems with precedence constraints . Operations Research , 26 , 444 – 449 .
  • SEN , T. , DILEEPAN , P. , and GUPTA , J. N. D. , 1989 , The two-machine flowshop scheduling problem with total tardiness . Computers and Operations Research , 16 , 333 – 340 .
  • SMITH , W. E. , 1956 , Various optimizers for single-stage production . Naval Research Logistics Quarterly , 3 , 59 – 66 .
  • TOWNSEND , W. , 1977 , Sequencing n jobs m machines to minimise maximum tardiness: a branch-and-bound solution . Management Science , 23 , 1016 – 1019 .

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.