Single CNC machine scheduling with controllable processing times and multiple due dates

International Journal of Production Research

Volumn 46, Issue 21, 2008, Pages 6087-6111

  Atan, Mehmet Oguz ^a   Selim Akturk, M ^b  

^a Lehigh University   (United States)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Controllable processing times; Heuristics; Multiple due dates; Order rejection; Scheduling; Total weighted tardiness and earliness

Indexed keywords

COMPUTER CONTROL SYSTEMS; COORDINATE MEASURING MACHINES; HEURISTIC ALGORITHMS; SCHEDULING;

CONTROLLABLE PROCESSING TIMES; HEURISTICS; MULTIPLE DUE DATES; ORDER REJECTION; TOTAL WEIGHTED TARDINESS AND EARLINESS;

MACHINERY;

EID: 53349144582     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701262913     Document Type: Article

References (25)

1. Akturk, M.S. and Ozdemir, D., An exact approach to minimizing total weighted tardiness with release dates. IIE Trans., 2000, 32, 1091-1101.
2. Avci, S., Akturk, M.S. and Storer, R.H., A problem space algorithm for single machine weighted tardiness problems. IIE Trans., 2003, 35, 479-486.
3. Azizoglu, M., Kondakci, S. and Kirca, O., Bicriteria scheduling problem involving total tardiness and total earliness penalties. Int. J. Prod. Econ., 1991, 23, 17-24.
4. Chand, S. and Chhajed, D., A single machine model for determination of optimal due dates and sequence. Oper. Res., 1992, 40, 596-602.
5. Charnsirisakskul, K., Griffin, P.M. and Keskinocak, P., Order selection and scheduling with leadtime flexibility. IIE Trans., 2004, 36, 697-707.
6. Cheng, T.C.E., Chen, Z.L. and Li, C.-L., Parallel-machine scheduling with controllable processing times. IIE Trans., 1996, 28, 177-180.
7. Cheng, T.C.E., Chen, Z.L., Li, C.-L. and Lin, B.M.T., Scheduling to minimize the total compression and late costs. Nav. Res. Logist., 1998, 45, 67-82.
8. Daniels, R.L. and Sarin, R.K., Single machine scheduling with controllable processing times and number of jobs tardy. Oper. Res., 1989, 37, 981-984.
9. Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N. and Wein, J., Techniques for scheduling with rejection. J. Algor., 2003, 49, 175-191.
10. Fry, T.D., Armstrong, R.D. and Blackstone, J.H., Minimizing weighted absolute deviation in single machine scheduling. IIE Trans., 1984, 19, 445-450.
11. Geunes, J., Romeijn, H.E. and Taaffe, K., Requirements planning with pricing and order selection flexibility. Oper. Res., 2006, 54, 394-401.
12. Gurel, S. and Akturk, M.S., Considering manufacturing cost and scheduling performance on a CNC turning machine. Eur. J. Oper. Res., 2007, 177, 325-343.
13. Hassin, R. and Shani, M., Machine scheduling with earliness, tardiness and non-execution penalties. Comput. Oper. Res., 2005, 32, 683-705.
14. Kaminsky, P. and Lee, Z., Analysis of on-line algorithms for due date quotation. Working Paper, Department of Industrial Engineering, University of California, Berkeley, 2001.
15. Kayan, R.K. and Akturk, M.S., A new bounding mechanism for the CNC machine scheduling problems with controllable processing times. Eur. J. Oper. Res., 2005, 167, 624-643.
16. Keskinocak, P., Ravi, R. and Tayur, S., Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues. Mgmt. Sci., 2001, 47, 264-279.
17. Ng, C.T.D., Cheng, T.C.E., Kovalyov, M.Y. and Lam, S.S., Single machine scheduling with a variable common due date and resource-dependent processing times. Comput. Oper. Res., 2003, 30, 1173-1185.
18. Ow, P.S. and Morton, T.E., The single machine early/tardy problem. Mgmt. Sci., 1989, 35, 177-191.
19. Panwalkar, S.S. and Rajagopalan, R., Single-machine sequencing with controllable processing times. Eur. J. Oper. Res., 1992, 59, 298-302.
20. Ray, S. and Jewkes, E.M., Customer lead-time management when both demand and price are lead time sensitive. Eur. J. Oper. Res., 2004, 153, 769-781.
21. Slotnick, S.A. and Morton, T.E., Order acceptance with weighted tardiness. Comput. Oper. Res., 2007, 34, 3029-3042.
22. So, K.C., Price and time competition for service delivery. Mfg. Serv. Oper. Mgmt., 2000, 2, 392-409.
23. Vickson, R.G., Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Oper. Res., 1980, 28, 1155-1167.
24. Wester, F.A.W., Wijngaard, J. and Zijm, W.H.M., Order acceptance strategies in a production-to-order environment with setup times and due-dates. Int. J. Prod. Res., 1992, 30, 1313-1326.
25. Yang, B. and Geunes, J., A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times. Comput. Ind. Engng., 2007, in press.