Using composite variable modeling to achieve realism and tractability in production planning: An example from automotive stamping

References

• Appelgren , L. H. 1969 . A column generation algorithm for a ship scheduling problem . Transportation Science , 3 : 53 – 68 .
   Google Scholar
• Armacost , A. , Barnhart , C. and Ware , K. 2002 . Composite variable formulations for express shipment service network design . Transportation Science , 35 : 1 – 20 .
   Web of Science ®Google Scholar
• Baker , K. 1975 . A comparative study of flow-shop algorithms . Operations Research , 23 : 62 – 73 .
   Web of Science ®Google Scholar
• Barnhart , C. , Cohn , A. , Johnson , E. , Klabjan , D. , Nemhauser , G. and Vance , P. 2003 . Airline crew scheduling. Handbook of Transportation Science, , second edition , 517 – 560 . Dordrecht : Kluwer .
   Google Scholar
• Barnhart , C. , Farahat , A. and Lohatepanont , M. 2009 . Airline fleet assignment: an alternative model and solution approach based on composite variables . To appear in Operations Research ,
   Google Scholar
• Barnhart , C. , Johnson , E. , Nemhauser , G. , Savelsbergh , M. and Vance , P. 1998 . Branch-and-price: column generation for solving huge integer programs . Operations Research , 46 : 316 – 329 .
   Web of Science ®Google Scholar
• Barnhart , C. , Kniker , T. and Lohatepanont , M. 2002 . Itinerary-based fleet assignment . Transportation Science , 36 : 199 – 217 .
   Web of Science ®Google Scholar
• Blau , R. 1973 . N-job, one machine sequencing problems under uncertainty . Management Science , 20 : 101 – 109 .
   Web of Science ®Google Scholar
• Blocher , J. , Chand , S. and Sengupta , K. 1999 . The changeover scheduling problem with time and cost considerations: analytical results and a forward algorithm . Operations Research , 47 : 559 – 569 .
   Web of Science ®Google Scholar
• Brucker , P. , Hilbig , T. and Hurink , J. 1999 . A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags . Discrete Applied Mathematics , 94 : 77 – 99 .
   Web of Science ®Google Scholar
• Caraffa , V. , Ianes , S. , Bagchi , T. and Sriskandarajah , C. 2001 . Minimizing makespan in an blocking flowshop using genetic algorithms . International Journal of Production Economics , 70 : 101 – 115 .
   Web of Science ®Google Scholar
• Cohn , A. and Barnhart , C. 2003 . Improving crew scheduling by incorporating key maintenance routing decisions . Operations Research , 51 : 387 – 396 .
   Web of Science ®Google Scholar
• Cohn , A. and Barnhart , C. 2007 . Composite-variable modeling for service parts logistics . Annals of Operations Research , 144 ( 1 ) : 17 – 32 .
   Web of Science ®Google Scholar
• Cohn , A. , Root , S. , Wang , A. and Mohr , D. 2007 . Integration of the load matching and routing problem with equipment balancing for small package carriers . Transportation Science , 41 ( 2 ) : 238 – 252 .
   Web of Science ®Google Scholar
• Coffman , E. , Yannakakis , M. , Magazine , M. and Santos , C. 1990 . Batch sizing and job sequencing on a single machine . Annals of Operations Research , 26 : 135 – 147 .
   Google Scholar
• Conway , R. , Maxwell , W. and Miller , L. 1967 . Theory of Scheduling , Reading , MA : Addison-Wesley .
   Google Scholar
• Crainic , T. 2002 . A survey of optimization models for long-haul freight transportation available at http://www.crt.umontreal.ca/~theo/mba8L91/longhaul.pdfTechnical Report CRT-2002-05
   Google Scholar
• Crainic , T. and Rousseau , K. 1987 . The column generation principle and the airline crew scheduling problem . INFOR , 25 : 136 – 151 .
   Web of Science ®Google Scholar
• Crauwels , H. , Potts , C. and Van Wassenhove , L. 1997 . Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time . Annals of Operations Research , 70 : 261 – 279 .
   Web of Science ®Google Scholar
• Dantzig , G. and Wolfe , P. 1960 . The decomposition principle for linear programs . Operations Research , 8 : 101 – 111 .
   Web of Science ®Google Scholar
• Delporte , C. and Thomas , L. 1977 . Lot sizing and sequencing for N products on one facility . Management Science , 23 : 1070 – 1079 .
   Web of Science ®Google Scholar
• Desaulniers , G. , Desrosiers , J. , Dumas , Y. , Solomon , M. and Soumis , F. 1997 . Daily aircraft routing and scheduling . Management Science , 43 : 841 – 855 .
   Web of Science ®Google Scholar
• Dietrich , B. , Lee , J. and Lee , Y. 1993 . Order selection on a single machine with high set-up costs . Annals of Operations Research , 43 : 379 – 396 .
   Google Scholar
• Dobson , G. 1992 . The cyclic lot scheduling problem with sequence-dependent setups . Operations Research , 40 : 736 – 649 .
   Web of Science ®Google Scholar
• Dobson , G. , Karmarkar , U. and Rummel , J. 1987 . Batching to minimize flow times on one machine . Management Science , 33 : 784 – 799 .
   Web of Science ®Google Scholar
• Dudek , R. , Panwalkar , S. and Smith , M. 1992 . The lessons of flowshop scheduling research . Operations Research , 40 : 7 – 13 .
   Web of Science ®Google Scholar
• Eom , S. , Lee , S. , Kim , E. and Somarajan , C. 1998 . A survey of decision support system applications (1988–1994) . Journal of the Operational Research Society , 49 : 109 – 120 .
   Web of Science ®Google Scholar
• Fleischmann , B. and Meyr , H. 1997 . The general lotsizing and scheduling problem . OR Spektrum , 19 : 11 – 21 .
   Google Scholar
• Gascon , A. and Leachman , R. 1988 . A dynamic programming solution to the dynamic, multi-item, single-machine scheduling problem . Operations Research , 36 : 50 – 56 .
   Web of Science ®Google Scholar
• Geoffrion , A. 1970 . Elements of large-scale mathematical programming . Management Science , 16 : 652 – 691 .
   Web of Science ®Google Scholar
• Gerodimos , A. , Glass , C. , Potts , C. and Tautenhahn , T. 1999 . Scheduling multi-operation jobs on a single machine . Annals of Operations Research , 92 : 87 – 105 .
   Web of Science ®Google Scholar
• Gilmore , P. and Gomory , R. 1961 . A linear programming approach to the cutting stock problem . Operations Research , 9 : 849 – 859 .
   Web of Science ®Google Scholar
• Glass , C. and Potts , C. 1996 . A comparison of local search methods for flow shop scheduling . Annals of Operations Research , 63 : 489 – 509 .
   Web of Science ®Google Scholar
• Glassey , C. 1968 . Minimum change-over scheduling of several products on one machine . Operations Research , 16 : 342 – 352 .
   Web of Science ®Google Scholar
• Gopalan , R. and Talluri , K. 1998 . Mathematical models in airline schedule planning: a survey . Annals of Operations Research , 76 : 155 – 185 .
   Web of Science ®Google Scholar
• Graves , G. and Lee , C. 1999 . Scheduling maintenance and semiresumable jobs on a single machine . Naval Research Logistics , 46 : 845 – 863 .
   Web of Science ®Google Scholar
• Graves , S. 1981 . A review of production scheduling . Operations Research , 29 : 646 – 675 .
   Web of Science ®Google Scholar
• Gusikhin , O. and Rossi , G. 2004 . “ Improving automotive supplier operations through information logistics ” . In The Knowledge Gap in Enterprise Information Flow , Edited by: Sandkuhl , K. , Smirnov , A. and Weber , H. 81 – 94 . Sweden : Jönköping University Press .
   Google Scholar
• Hejazi , S. and Saghafian , S. 2005 . Flowshop-scheduling problems with makespan criterion: a review . International Journal of Production Research , 43 : 2895 – 2929 .
   Web of Science ®Google Scholar
• Ho , J. 1987 . Recent advances in the decomposition approach to linear programming . Mathematical Programming Study , 31 : 119 – 128 .
   Web of Science ®Google Scholar
• Hu , T. , Kuo , Y. and Ruskey , F. 1987 . Some optimum algorithms for scheduling problems with changeover costs . Operations Research , 35 : 94 – 99 .
   Web of Science ®Google Scholar
• Jones , K. , Lustig , I. , Farvolden , J. and Powell , W. 1993 . Multicommodity network flows: the impact of formulation on decomposition . Mathematical Programming , 62 : 95 – 117 .
   Web of Science ®Google Scholar
• Kanet , J. and Sridharan , V. 2000 . Scheduling with inserted idle time: problem taxonomy and literature review . Operations Research , 48 : 99 – 110 .
   Web of Science ®Google Scholar
• Laguna , M. 1999 . A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times . IIE Transactions , 31 : 125 – 134 .
   Web of Science ®Google Scholar
• Leachman , R. and Gascon , A. 1988 . A heuristic scheduling policy for multi-item single-machine production systems with time-varying, stochastic demands . Management Science , 34 : 377 – 390 .
   Web of Science ®Google Scholar
• Levner , E. 1969 . Optimal planning of parts machining on a number of machines . Automation and Remote Control , 12 : 1972 – 1978 .
   Google Scholar
• Magnanti , T. and Vachani , R. 1990 . A strong cutting plane algorithm for production scheduling with changeover costs . Operations Research , 38 : 456 – 473 .
   Web of Science ®Google Scholar
• Martin , R. 1999 . Large Scale Linear and Integer Optimization: A Unified Approach , Norwell , MA : Kluwer .
   Google Scholar
• Maxwell , W. 1970 . On sequencing n jobs on one machine to minimize the number of late jobs . Management Science , 16 : 295 – 297 .
   Web of Science ®Google Scholar
• McCormick , S. , Pinedo , M. , Shenker , S. and Wolf , B. 1989 . Sequencing in an assembly line with blocking to minimize cycle time . Operations Research , 37 : 925 – 935 .
   Web of Science ®Google Scholar
• Monma , C. 1980 . Sequencing to minimize the maximum job cost . Operations Research , 28 : 942 – 951 .
   Web of Science ®Google Scholar
• Nowicki , E. and Zdrzalka , S. 1996 . Single machine scheduling with major and minor setup times: a tabu search approach . The Journal of the Operational Research Society , 47 : 1054 – 1064 .
   Web of Science ®Google Scholar
• Panwalkar , S. and Iskander , W. 1977 . A survey of scheduling rules . Operations Research , 25 : 45 – 61 .
   Web of Science ®Google Scholar
• Portougal , V. and Robb , D. 2000 . Production scheduling theory: just where is it applicable? . Interfaces , 30 : 64 – 76 .
   Web of Science ®Google Scholar
• Potts , C. and van Wassenhove , L. 1992 . Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity . The Journal of the Operational Research Society , 43 : 395 – 406 .
   Web of Science ®Google Scholar
• Reeves , C. 1994 . A genetic algorithm for flowshop sequencing . Computers and Operations Research , 22 : 5 – 13 .
   Web of Science ®Google Scholar
• Salomon , M. , Kroon , L. , Kuik , R. and van Wassenhove , L. 1991 . Some extensions of the discrete lotsizing and scheduling problem . Management Science , 37 : 801 – 812 .
   Web of Science ®Google Scholar
• Schutten , J. , van de Velde , S. and Zijm , W. 1996 . Single-machine scheduling with release dates, due dates and family setup times . Management Science , 42 : 1165 – 1174 .
   Web of Science ®Google Scholar
• Sherali , H. and Adams , W. 1994 . A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems . Discrete Applied Mathematics , 52 : 83 – 106 .
   Web of Science ®Google Scholar
• Sriskandarajah , C. and Hall , N. 1996 . A survey of machine scheduling problems with blocking and no wait in process . Operations Research , 44 : 510 – 525 .
   Web of Science ®Google Scholar
• Vanderbeck , F. and Wolsey , L. 1996 . An exact algorithm for IP column generation . Operations Research Letters , 19 : 151 – 159 .
   Web of Science ®Google Scholar
• Webster , S. and Baker , K. 1995 . Scheduling groups of jobs on a single machine . Operations Research , 43 : 692 – 703 .
   Web of Science ®Google Scholar
• Williams , D. and Wirth , A. 1996 . A new heuristic for a single machine scheduling problem with set-up times . The Journal of the Operational Research Society , 47 : 175 – 180 .
   Web of Science ®Google Scholar
• Yang , W. and Liao , C. 1999 . Survey of scheduling research involving setup times . International Journal of Systems Science , 30 : 143 – 155 .
   Web of Science ®Google Scholar