SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND EARLINESS, TARDINESS AND COMPLETION TIME PENALTIES

References

• Alidaee , B. and Ahmadian , A. ( 1993 ). Two parallel machine sequencing problems involving controllable job processing times . European Journal of Operational Research , 70 , 335 – 341 .
   Web of Science ®Google Scholar
• Baker , K.. R. and Scudder , G. D. ( 1990 ). Sequencing with earliness and tardiness penalties a review . Operations Research , 38 , 22 – 36 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. , Chen , Z. L. and Li , C.-L. ( 1996 ). Parallel-machine scheduling with controllable processing times . IIE Transactions , 28 , 177 – 180 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. , Oguz , C. and Qi , X. D. ( 1996 ). Due-date assignment and single machine scheduling with compressible processing times . International Journal of Production Economics , 43 , 29 – 35 .
   Web of Science ®Google Scholar
• Hall , N. G. , Kubiak , W. and Sethi , S. P. ( 1991 ). Earliness-tardincss scheduling problems II Deviation of completion times about a restrictive common due date . Operations Research , 39 , 847 – 856 .
   Web of Science ®Google Scholar
• Hardy , G. H. , Littlewood , J. E. and Polya , G. ( 1967 ). Inequalities . Cambridge University Press , Cambridge , UK .
   Google Scholar
• Nowicki , E. and Zdrzalka , S. ( 1990 ). A survey of results for sequencing problems with controllable processing times . Discrete Applied Mathematics , 26 , 271 – 287 .
   Web of Science ®Google Scholar
• Panwalkar , S. S. , Smith , M. L. and Seidman , A. ( 1982 ). Common due date assignment to minimize total penalty for the one machine scheduling problem . Operations Research , 30 , 391 – 399 .
   Web of Science ®Google Scholar
• Panwalkar , S. S. and Rajagopalan , R. ( 1992 ). Single-machine sequencing with controllable processing times . European Journal of Operational Research , 59 , 298 – 302 .
   Web of Science ®Google Scholar
• Papadimitriou , C. H. and Steiglitz , K. ( 1982 ). Combinatorial OptimizationAlgorithms and Complexity . Prentice-Hall , Englewood Cliffs , NJ .
   Google Scholar
• Schmenner , R. W. ( 1988 ). The merit of making things fast . Sloan Management Review , 30 , 11 – 17 .
   Google Scholar
• Smith , W. E. ( 1956 ). Various optimizers for single-stage production . Naval Research Logistics Quarterly , 3 , 59 – 66 .
   Google Scholar
• Vickson , R. G. ( 1980 ). Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine . Operations Research , 28 , p1155 –1167 p.
   Google Scholar
• Vickson, R. G. ( 1980 ). Two single machine sequencing problems involving controllable job processing times . AIIE Transactions , 12 , 258 – 262 .
   Web of Science ®Google Scholar