62
Views
10
CrossRef citations to date
0
Altmetric
ORIGINAL ARTICLES

Minimizing flowtime and maximum earliness on a single machine

, &
Pages 192-200 | Received 01 Oct 1995, Accepted 01 May 1997, Published online: 31 May 2007

References

  • Heck , H. and Roberts , S. , ( 1972 ) A note on the extension of a result on scheduling with secondary criteria . Naval Research Logistics Quarterly , 19 , 403 – 405 .
  • Van Wassenhove , L.N. and Gelders , F. , ( 1980 ) Solving a bicnte-rion scheduling problem . European Journal of Operational Research , 4 , 42 – 48 .
  • Sen , T. and Gupta , S.K. , ( 1983 ) A branch and bound procedure to solve a bicntenon scheduling problem . HE Transactions , 15 , 84 – 88 .
  • Nelson , R.T. , Sarin , R.K. and Daniels , R.L. , ( 1986 ) Scheduling with multiple performance measures the one machine case . Management Science , 32 , 464 – 479 .
  • Kondakci , S. , Azizoglu , M. and Koksalan , M. , ( 1994 ) Generating efficient schedules for flowtime and maximum tardiness measures , in Multiple Criteria Decision Making Expand and Enrich the Domains of Thinking and Application , Gwo-Hshiung, Tzeng, Ue-Pyng, Wen and Po L. Yu (eds.) Springer-Verlag , New York .
  • Emmons , H. , ( 1975 ) One machine sequencing to minimize mean flow time with minimum tardy . Naval Research Logistics Quarterly , 22 , 585 – 592 .
  • Kiran , A.S. and Unal , A.T. , ( 1991 ) A single-machine problem with multiple criteria . Naval Research Logistics , 38 , 721 – 727 .
  • Lin , K.S. , ( 1983 ) Hybrid algorithm for sequencing with bicntena . Journal of Optimization Theory and Applications , 39 , 105 – 124 .
  • Monma , C.L. , ( 1980 ) Scheduling to minimize the maximum job cost . Operations Research , 28 , 942 – 951 .
  • Sidney , J.B. , ( 1977 ) Optimal single machine scheduling with earliness and tardiness penalties . Operations Research , 25 , 62 – 69 .
  • Lakshminarayan , S. , Lakshmanan , R. , Papineau , R. and Roche , R. , ( 1978 ) Optimal single machine scheduling with earliness and tardiness penalties . Operations Research , 26 , 1079 – 1085 .
  • Federgruen , A. and Mosheiov , G. , ( 1994 ) Greedy heuristic for single-machine scheduling problems with general earliness and tardiness costs . Operations Research Letters , 16 , 199 – 208 .
  • Fry , T.D. , Leong , G.K. and Rakes , T.R. , ( 1987 ) Single machine scheduling a comparison of two solution procedures . Omega , 15 , 277 – 282 .
  • Fry , T.D. and Leong , G.K. , ( 1987 ) A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden . Computers and Operations Research , 14 , 363 – 368 .
  • Hoogeveen , J.A. , ( 1992 ) Single machine bicriteria scheduling . Ph.D. thesis , CWI , Amsterdam .
  • Lenstra , J.K. , Rinnooy Kan , A H G. and Brucker , P. , ( 1977 ) Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 , 343 – 362 .
  • Kondakci , S. , Azizoglu , M. and Koksalan , M. , ( 1996 ) Note bicriteria scheduling minimizing flowtime and maximum tardiness . Naval Research Logistics , 43 , 929 – 936 .
  • Fisher , M.L. , ( 1976 ) A dual algorithm for the one machine scheduling problem . Mathematical Programming , 11 , 229 – 251 .
  • Koksalan , M.M. , ( 1993 ) An improved heuristic to minimizing a function of flowtime and maximum tardiness . Technical Report No 93–24, Department of Industrial Engineering , Middle East Technical University , Ankara , Turkey .
  • ∗ Author to whom all correspondence should be addressed.

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.