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

References

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