444
Views
70
CrossRef citations to date
0
Altmetric
Original Articles

Order selection and scheduling with leadtime flexibility

, &
Pages 697-707 | Received 01 Aug 2001, Accepted 01 Aug 2003, Published online: 17 Aug 2010

References

  • Abdul-Razaq , T. S. , Potts , C. N. and Van Wassenhove , L. N. 1990 . A survey of algorithms for the single machine total weighted tardiness scheduling problem. . Discrete Applied Mathematics , 26 : 235 – 253 .
  • Akturk , M. S. and Ozdemir , D. 2000 . An exact approach to minimizing total weighted tardiness with release dates. . IIE Transactions , 32 : 1091 – 1101 .
  • Arkin , E. M. and Silverberg , E. B. 1987 . Scheduling jobs with fixed start and end times. . Discrete Applied Mathematics , 18 : 1 – 8 .
  • Baker , K. R. and Bertrand , J. W. M. 1981 . A comparison of due-date selection rules. . AIIE Transactions , 13 : 123 – 131 .
  • Baker , K. R. and Bertrand , J. W. M. 1982 . A dynamic priority rule for scheduling against due-dates. . Journal of Operations Management , 3 ( 1 ) : 37 – 42 .
  • Bertrand , J. W. M. 1983 . The effect of workload dependent due-dates on job shop performance. . Management Science , 29 : 799 – 816 .
  • Bish , E. K. and Wang , Q. 2002 . Optimal investment strategies for flexible resources, considering pricing and correlated demands. Working paper, Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA 24001, USA
  • Bookbinder , J. H. and Noor , A. I. 1985 . Setting job-shop due-dates with service level constraints. . Journal of the Operational Research Society , 36 : 1017 – 1026 .
  • Charnsirisakskul , K. 2003 . Demand fulfillment flexibility in capacitated production planning. Ph.D. thesis. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA
  • Charnsirisakskul , K. , Griffin , P. and Keskinocak , P. 2003 . Price quotation and scheduling with lead-time flexibility. Working paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA
  • Cheng , T. C. E. 1984 . Optimal due-date determination and sequencing of n jobs on a single machine . Journal of the Operational Research Society , 35 ( 5 ) : 433 – 437 .
  • Cheng , T. C. E. and Gupta , M. C. 1989 . Survey of scheduling research involving due date determination decisions. . European Journal of Operational Research , 38 : 156 – 166 .
  • Chu , C. 1992 . A branch-and-bound algorithm to minimize total tardiness with different release dates. . Naval Research Logistics , 39 : 265 – 283 .
  • Chuzhoy , J. and Ostrovsky , R. 2002 . Approximation algorithms for the job interval selection problem and related scheduling problems , Haifa, , Israel : Working paper, Computer Science Department, Technion, IIT .
  • Conway , R. W. 1981 . Priority dispatching and job lateness in a job shop. . The Journal of Industrial Engineering , 16 ( 4 ) : 228 – 237 .
  • Crauwels , H. A. J. , Potts , C. N. and Van Wassenhove , L. N. 1998 . Local search heuristics for the single machine total weighted tardiness scheduling problem . INFORMS, Journal on Computing , 10 ( 3 ) : 341 – 350 .
  • Duclos , L. K. , Lummus , R. R. and Vokurka , R. J. 2002 . “ A conceptual model of supply chain flexibility ” . In Industrial Management and Data Systems, to appear
  • Duenyas , I. 1995 . Single facility due date setting with multiple customer classes. . Management Science , 41 ( 4 ) : 608 – 619 .
  • Duenyas , I. and Hopp , W. J. 1995 . Quoting customer lead times. . Management Science , 41 ( 1 ) : 43 – 57 .
  • Eilon , S. and Chowdhury , I. G. 1976 . Due dates in job shop scheduling. . International Journal of Production Research , 14 : 223 – 237 .
  • Fine , C. H. and Freund , R. M. 1990 . Optimal investment in product-flexible manufacturing capacity. . Management Science , 36 : 449 – 466 .
  • Goetschalckx , M. , Ahmed , S. , Shapiro , A. and Santoso , T. 2001 . Designing flexible and robust supply chains. Proc. of the IEPM Conference, Aug. 20–23, 2001, Quebec City, Canada, 539–552
  • Hall , N. G. and Magazine , M. J. 1994 . Maximizing the value of a space mission. . European Journal of Operational Research , 78 : 224 – 241 .
  • Hariri , A. M. A. and Potts , C. N. 1983 . An algorithm for single machine sequencing with release dates to minimize total weighted completion time. . Discrete Applied Mathematics , 5 : 99 – 109 .
  • Holsenback , J. E. and Russell , R. M. 1992 . A heuristic algorithm for sequencing on one machine to minimize total tardiness. . Journal of the Operational Research Society , 43 ( 1 ) : 53 – 62 .
  • Keskinocak , P. , Ravi , R. and Tayur , S. 2001 . Scheduling and reliable lead time quotation for orders with availability intervals and lead time sensitive revenues. . Management Science , 47 ( 2 ) : 264 – 279 .
  • Keskinocak , P. and Tayur , S. 2003 . “ Due-date management policies ” . In Quantitative Supply Chain Analysis: Modeling in the eBusiness Era , Edited by: Simchi-Levi , D. , Wu , D. and Shen , M. Kluwer . (to appear)
  • Koulamas , C. 1994 . The total tardiness problem: review and extensions. . Operations Research , 42 ( 6 ) : 1025 – 1041 .
  • Liao , C. 1992 . Optimal control of jobs for production systems, . Computers and Industrial Engineering , 22 ( 2 ) : 163 – 169 .
  • Potts , C. N. and Van Wassenhove , L. N. 1985 . A branch and bound algorithm for the total weighted tardiness problem. . Operations Research , 33 ( 2 ) : 363 – 377 .
  • Potts , C. N. and Van Wassenhove , L. N. 1991 . Single machine tardiness sequencing heuristics. . IIE Transactions , 23 ( 4 ) : 346 – 354 .
  • Rinnooy Kan , A. H. G. 1976 . Machine Scheduling Problems: Classification, Complexity and Computation , The Netherlands : Nijhoff, The Hague .
  • Rodin , R. 2001 . Payback Time For Supply Chains, Optimize, Dec. 2001, Issue 2 Accessed April 5, 2004
  • Russell , R. M. and Holsenback , J. E. 1997 . Evaluation of leading heuristics for the single machine tardiness problem. . European Journal of Operational Research , 96 : 538 – 545 .
  • Sabri , E. and Beamon , B. 2000 . A multi-objective approach to simultaneous strategic and operational planning in supply chain design. . Omega , 28 ( 5 ) : 581 – 598 .
  • Seidmann , A. and Smith , M. L. 1981 . Due dates assignment for production systems. . Management Science , 27 : 571 – 581 .
  • Sheridan , J. H. 1999 . Managing the value chain Accessed on April 5, 2004
  • Slotnick , S. A. and Sobel , M. J. 2001 . Manufacturing Lead-Time Rules: Customer Retention vs. Tardiness Costs . European Journal of Operational Research , to appear
  • Snoek , M. 2002 . Neuro-genetic order acceptance in a job shop setting, Working Paper , Enschede, , The Netherlands : Department of Computer Science, University of Twente .
  • Spearman , M. L. and Zhang , R. Q. 1999 . Optimal lead time policies. . Management Science , 45 ( 2 ) : 290 – 295 .
  • Teresko , J. 2000 . The dawn of e-manufacturing Available at
  • Van Mieghem , J. A. 1998 . Investment strategies for flexible resources. . Management Science , 44 : 1071 – 1078 .
  • Voudouris , V. T. 1996 . Mathematical programming techniques to debottleneck the supply chain of fine chemical industries. . Computers and Chemical Engineering , 20 : 1269 – 1274 .
  • Weeks , J. K. 1979 . A simulation study of predictable due-dates. . Management Science , 25 ( 4 ) : 363 – 373 .
  • Wein , L. M. 1991 . Due-date setting and priority sequencing in a multi class M/G/1 queue . Management Science , 37 ( 7 ) : 834 – 850 .
  • Wester , F. A. W. , Wijngaard , J. and Zijm , W. H. M. 1992 . Order acceptance strategies in a production-to-order environment with setup times and due-dates, . International Journal of Production Research , 30 ( 6 ) : 1313 – 1326 .
  • Woeginger , G. J. 1994 . On-line scheduling of jobs with fixed start and end times, . Theoretical Computer Science , 130 : 5 – 16 .

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.