Scheduling with generalized batch delivery dates and earliness penalties

IIE Transactions (Institute of Industrial Engineers)

Volumn 32, Issue 8, 2000, Pages 735-741

  Yang, Xiaoguang ^a  

^a INSTITUTE OF SYSTEMS SCIENCE   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2642547687     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170008967431     Document Type: Article

References (17)

1. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.G.H., and Shmoys, D.B., (1993) Sequencing and scheduling algorithms and complexity, in Handbooks in Operation Research and Management Science.
2. Smith, W.E., (1956) Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59–66.
3. Cheng, T.C.E., and Kahlbacher, H.G., (1993) Scheduling with delivery and earliness penalties. Asia-Pacific Journal of Operational Research, 10, 145–152.
4. Cheng, T.C.E., and Gordon, V.S., (1994) On batch delivery scheduling on a single machine. Journal of the Operational Research Society, 45, 1211–1215.
5. Cheng, T.C.E., Gordon, V.S., and Kovalyov, M.Y., (1996) Single machine scheduling with batch deliveries. European Journal of Operational Research, 94, 277–283.
6. Cheng, T.C.E., Kovalyov, M.Y., and Lin, B.M.-T., (1997) Single machine scheduling to minimize batch delivery and job earliness penalties. SI AM Journal on Optimization, 7, 547–559.
7. Hall, N.G., (1986) Scheduling problems with generalized due dates. 11E Transactions, 18, 220–222.
8. Hall, N.G., Sethi, S.P., and Sriskandarajah, C., (1991) On the complexity of generalized due date scheduling problems. European Journal of Operational Research, 51, 100–109.
9. Sriskandarajah, C., (1990) A note on the generalized due date scheduling problems. Naval Research Logistics, 37, 587–597.
10. Tanaka, K., and Vlach, M., (1996) Single machine scheduling with generalized due dates, in Conference Programme for the Symposium on Combinatorial Optimization (co96). London, March 1996.
11. Tanaka, K., and Vlach, M., (1996) Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates. Lecture Notes in Operations Research, Proceedings of the Second International Symposium on Operations Research and Its Applications, Du, D., Zhang, X.S., Cheng, K. (eds), World Publishing Corporation, Beijing, Shanghai, Xian, Guangzhou, pp. 250–259.
12. Wong, S.C., Yan, M., and Young, G., (1995) A note on a single machine generalized due date scheduling problems. Journal of Combinatorial Mathematics and Combinatorial Computing (in press).
13. Young, G., Wong, C.S., Yiu, V.S., and Yan, M., (1996) Scheduling tasks with generalized due dates and ready times. Lecture Notes in Operations Research, Proceedings of the Second International Symposium on Operations Research and its Applications, Du, D., Zhang, X.S., Cheng, K. (eds), World Publishing Corporation, Beijing, Shanghai, Xian, Guangzhou, pp. 209–214.
14. Hall, N.G., Lesaoana, M., and Potts, C.N., (1997) Scheduling with fixed delivery dates. Working paper, Faculty of Mathematical Studies, University of Southampton, Southampton, UK.
15. Garey, M.R., and Johnson, D.S., (1979) Computers and Intractability A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA.
16. Du, J., and Leung, J.Y. T., (1990) Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483–495.
17. Lawler, E.L., (1976) Combinatorial Optimization Networks and Matroids, Holt, Rinehart and Winston, New York.