259
Views
57
CrossRef citations to date
0
Altmetric
Original Articles

Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals

, , &
Pages 727-738 | Received 01 May 1992, Published online: 26 Apr 2007

References

  • BAKER , K. R. , and CHADOWITZ , A. J. , 1989 , Heuristic procedures for minimizing earliness and tardiness penalty with a common due date . Working Paper No. 240 , The Amos Tuck School of Business Administration, Dartmough College .
  • BAKER , K. R. , and SCUDDER , G. D. , 1990 , Sequencing with earliness and tardiness penalties a review . Operations Research , 38 ( 1 ), 22 – 36 .
  • BARTHOLDI , III , J. J. , and PLATZMAN , L. K. , 1986 , Retrieval strategies for a carousel conveyor . HE Transactions , 18 ( 2 ), 166 – 173 .
  • BOZER , A. Y. , and WHITE , J. A. , 1984 , Travel-time models for automated storage/retrieval systems . HE Transactions , 16 ( 4 ), 329 – 338 .
  • BOZER , Y. A. , SCHORN, E. C, and SHARP , G. P. , 1990 , Geometric approaches to solve the Chebyshev travelling salesman problem , HE Transactions , 22 ( 3 ), 238 – 254 .
  • CHOE , K. I. , and SHARP , G. P. , 1988 , Class-based storage with multi-command operations , Report MHRC-TR - 88 – 08 , Georgia Institute of Technology , Atlanta .
  • ELSAYED , E. A. , 1981 , Algorithms for optimal material handling in automatic warehousing systems . International Journal of Production Research , 19 , ( 5 ), 525 – 535 .
  • ELSAYED , E. A. , 1985 , Design and scheduling rules for automated storage/retrieval systems . Technical Report 85-112. Department of Industrial Engineering, Rutgers University .
  • ELSAYED , E. A. , 1989 , Automated storage systems . International Handbook of Production and Operations Management , Edited by Ray Wild, Cassell Educational Ltd. , London , 174 – 193 .
  • ELSAYED , E. A. , and UNAL , O. I. , 1989 , Order batching algorithms and travel-time estimation for automated storage/retrieval systems . International Journal of Production Research , 27 ( 7 ), 1097 – 1114 .
  • ELSAYED , E. A. , 1991 , Order sequencing in automated storage/retrieval systems with due dates . Progress in Materials Handling and Logistics , edited by J. A. White and I. W. Pence , ( New York Springer-Verlag ), 244 – 267 .
  • FOLEY , R. D. , and FRAZELLE , E. H. , 1991 , Analytical results for miniload throughput and the distribution of dual command travel time . To appear in HE Transactions .
  • FRAZELLE , E. H. , 1989 , Stock location assignment and order picking productivity . Report MHRC-TD-89-11 , Georgia Institute of Technology , Atlanta .
  • FRY , T. D. , ARMSTRONG , R. D. , and BLACKSTONE , J. H. , 1987 , Minimizing weighted absolute deviation in single machine scheduling . HE Transactions , 19 , 445 – 450 .
  • GIBSON , D. R. , SHARP , G. P. , and FRAZELLE , E. H. , 1990 , Data preprocessing for order picking . MHRC-TR-90-07 , Georgia Institute of Technology , Atlanta .
  • HALL , N. G. , KUBIAK , W. , and SETHI , S. P. , 1991 , Earliness-tardiness scheduling problems, II deviation of completion times about a restrictive common due date . Operations Research , 33 , 847 – 856 .
  • HAN , M. H. , MCGINNIS , L. F. , SHIEH , J. S. , and WHITE , J. A. , 1987 , On sequencing retrievals in an automated storage/retrieval system . HE Transactions , 19 ( 3 ), 56 – 66 .
  • Ho , J. C. , and CHANG , Y-L. , 1991 , Heuristics for minimizing mean tardiness for m parallel machines . Naval Research Logistics , 38 , 367 – 381 .
  • HWANG , H. , and LEE , M. -K. , 1988 , Order batching algorithms for a man-on-board AS/RS . Engineering Cost and Production Economics , 13 , 285 – 294 .
  • JAIKUMAR , R. , and SOLOMON , M. M. , 1990 , Dynamic operational policies in an automated warehouse . HE Transactions , 22 , ( 4 ), 370 – 376 .
  • KUSIAK , A. , HAWALESHKA , O. , and CORMIER , G. , 1985 , Order picking policies in automated storage systems . Proceedings of the 6th International Conference on Automation in Warehousing, Stockholm , Sweden , pp. 230 – 248 .
  • LAWLER , E. L. , 1977 , A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness . Annals of Discrete Mathematics , 1 , 331 – 342 .
  • LENSTRA , J. K. , RINNOOY KAN , A. H. G. , and BRUCKER , P. , 1977 , Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 , 343 – 362 .
  • POTTS , C. N. ,VAN WASSENHOVE , L. N. , 1982 , A decomposition algorithm for the single machine total tardiness problem . Operations Research Letters , 1 , 177 – 181 .
  • POTTS , C. N. ,VAN WASSENHOVE , L. N. , 1985 , A branch and bound algorithm for the total tardiness problem . Operations Research , 33 , 363 – 377 .
  • POTTS , C. N. ,VAN WASSENHOVE , L. N. , 1987 , Dynamic programming and decomposition approaches for the single machine total tardiness problem . The European Journal of Operational Research , 32 , 405 – 414 .
  • POTTS , C. N. ,VAN WASSENHOVE , L. N. , 1991 , Single machine tardiness sequencing heuristics . HE Transactions , 23 , 346 – 354 .
  • RATLIFF , H. D. , and ROSENTHAL , A. S. , 1983 , Order-picking in a rectangular warehouse a solvable case of the traveling salesman problem . Operations Research , 31 ( 3 ), 507 – 521 .
  • ROSENBLATT , M. J. , and EYNAN , A. , 1989 , Deriving the optimal boundaries for class-based automatic storage/retrieval systems . Management Science , 35 ( 12 ), 1519 – 1524 .
  • SHARP , G. P. , and CHOE , K. I. , 1990 , Order retrieval in walk/ride- and pick systems . ORSA/TIMS Joint National Meeting , Philadelphia .
  • TAKAHASHI , T. , TAWARA , N. ,KUSUDA, Y. (eds.), 1981 , Proceedings of the 4th International Conference on Automation in Warehousing ( England IFS Publications )
  • Warehousing EducationResearch Councils 1986 Survey of Warehousing Professionals , 1986 , Warehousing Education and Research Council , Oak Brook , IL .

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.