The Order Selection and Lot Sizing Problem in the Make-to-Order Environment

[1]  T. C. Edwin Cheng,et al.  Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs , 2003, J. Sched..

[2]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[3]  Whm Henk Zijm,et al.  Order acceptance strategies in a production-to-order environment with setup times and due-dates , 1992 .

[4]  Safia Kedad-Sidhoum,et al.  The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs , 2009, Comput. Oper. Res..

[5]  Wieslaw Kubiak,et al.  Scheduling shops to minimize the weighted number of late jobs , 1994, Oper. Res. Lett..

[6]  Susan A. Slotnick,et al.  Order acceptance with weighted tardiness , 2007, Comput. Oper. Res..

[7]  Can Akkan,et al.  Finite-capacity scheduling-based planning for revenue-based capacity management , 1997, Eur. J. Oper. Res..

[8]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[9]  F. Sibel Salman,et al.  Order acceptance and scheduling decisions in make-to-order systems , 2010 .

[10]  Albert P. M. Wagelmans,et al.  An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem , 2006, Comput. Oper. Res..

[11]  Anshu Jalora,et al.  Order acceptance and scheduling at a make-to-order system using revenue management , 2006 .

[12]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[13]  Steven Nahmias,et al.  Production and operations analysis , 1992 .

[14]  Nagraj Balakrishnan,et al.  Rationing Capacity Between Two Product Classes , 1996 .

[15]  Paul M. Griffin,et al.  Order selection and scheduling with leadtime flexibility , 2004 .

[16]  Purushothaman Damodaran,et al.  A branch and price solution approach for order acceptance and capacity planning in make-to-order operations , 2011, Eur. J. Oper. Res..

[17]  Zeger Degraeve,et al.  Modeling industrial lot sizing problems: a review , 2008 .

[18]  Luk N. Van Wassenhove,et al.  Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review , 1988 .

[19]  Mayank Verma,et al.  A New Lagrangian Relaxation Based Approach to Solve Capacitated Lot-Sizing Problem with Backlogging , 2010 .

[20]  Graham K. Rand,et al.  Decision Systems for Inventory Management and Production Planning , 1979 .

[21]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[22]  Wun-Hwa Chen,et al.  Analysis of relaxations for the multi-item capacitated lot-sizing problem , 1991 .

[23]  Bruce L. Miller.  A Queueing Reward System with Several Customer Classes , 1969 .

[24]  Peigen Li,et al.  An effective hybrid genetic algorithm for the job shop scheduling problem , 2008 .

[25]  Aaron K. Tsado,et al.  A review of lot-sizing techniques for deterministic time-varying demand , 1986 .

[26]  Y. Roll,et al.  A Heuristic Algorithm for the Multi-Item Lot-Sizing Problem with Capacity Constraints , 1982 .

[27]  Gary M. Kern,et al.  A conceptual model for demand management in the assemble-to-order environment , 1990 .

[28]  N. Adam,et al.  The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity , 1981 .

[29]  Svetlana A. Kravchenko.  On the complexity of minimizing the number of late jobs in unit time open shop , 2000, Discret. Appl. Math..

[30]  Thomas E. Morton,et al.  Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..

[31]  Heinrich Kuhn,et al.  Capacitated lot-sizing with extensions: a review , 2008, 4OR.

[32]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[33]  Randall Matignon.  Data Mining Using SAS Enterprise Miner (Wiley Series in Computational Statistics) , 2007 .

[34]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[35]  Rakesh Nagi,et al.  Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups , 1997 .

[36]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[37]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[38]  Khalil S. Hindi,et al.  Solving the CLSP by a Tabu Search Heuristic , 1996 .

[39]  Joseph A. Orlicky,et al.  Material Requirements Planning: The New Way of Life in Production and Inventory Management , 1975 .

[40]  M. Lambrecht,et al.  Heuristic Procedures for the Single Operation, Multi-Item Loading Problem , 1979 .

[41]  H. O. Gu¨nther.  Planning lot sizes and capacity requirements in a single stage production system , 1987 .

[42]  Philippe Baptiste,et al.  Lagrangian bounds for just-in-time job-shop scheduling , 2008, Comput. Oper. Res..

[43]  Chandrasekharan Rajendran,et al.  Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs , 2005, Comput. Ind. Eng..

[44]  John M. Wilson,et al.  A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over , 2006, J. Oper. Res. Soc..

[45]  Ömer Kirca,et al.  A new heuristic approach for the multi-item dynamic lot sizing problem , 1994 .

[46]  Elias Willem Hans,et al.  Resource Loading by Branch-and-Price Techniques , 2001 .

[47]  R. L. Bulfin,et al.  Minimizing the weighted number of tardy jobs on parallel processors , 2005, Eur. J. Oper. Res..

[48]  Stéphane Dauzère-Pérès,et al.  Integration of lotsizing and scheduling decisions in a job-shop , 1994 .

[49]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[50]  Chin Sheng Chen,et al.  Concurrent engineer-to-order operation in the manufacturing engineering contracting industries , 2006 .

[51]  Peter Brucker,et al.  Open shop problems with unit time operations , 1993, ZOR Methods Model. Oper. Res..

[52]  Chao Wang,et al.  The capacity planning problem in make-to-order enterprises , 2009, Math. Comput. Model..

[53]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

[54]  Joseph Geunes,et al.  Models for Integrated Production Planning and Order Selection , 2002 .

[55]  J. Christopher Beck,et al.  A Hybrid Approach to Scheduling with Earliness and Tardiness Costs , 2003, Ann. Oper. Res..

[56]  Ludo Gelders,et al.  Production planning: a review , 1981 .

[57]  Ronald L. Rardin,et al.  Optimization in operations research , 1997 .

[58]  Joseph D. Blackburn,et al.  HEURISTIC LOT‐SIZING PERFORMANCE IN A ROLLING‐SCHEDULE ENVIRONMENT* , 1980 .

[59]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[60]  Chih-Ming Hsu,et al.  Benefits of lot splitting in job-shop scheduling , 2004 .

[61]  Jinwoo Park,et al.  A batch splitting method for a job shop scheduling problem in an MRP environment , 1999 .

[62]  E. Silver,et al.  A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .

[63]  Gerhard J. Woeginger,et al.  Minimizing the weighted number of late jobs in UET open shops , 1995, Math. Methods Oper. Res..

[64]  Chung-Yee Lee,et al.  Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date , 1991, Comput. Oper. Res..

[65]  Jay B. Ghosh,et al.  Job selection in a heavily loaded shop , 1997, Comput. Oper. Res..

[66]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[67]  Erwin W. Hans,et al.  Workload based order acceptance in job shop environments , 2005, OR Spectr..

[68]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

[69]  Luk N. Van Wassenhove,et al.  A simple heuristic for the multi item single level capacitated lotsizing problem , 1986 .

[70]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[71]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[72]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[73]  Robin O. Roundy,et al.  Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms , 2005 .

[74]  Ford W. Harris,et al.  How Many Parts to Make at Once , 1990, Oper. Res..

[75]  Ronald E Giachetti,et al.  A queueing network model to analyze the impact of parallelization of care on patient cycle time , 2008, Health care management science.

[76]  Walter O. Rom,et al.  Order acceptance using genetic algorithms , 2009, Comput. Oper. Res..

[77]  Herbert F. Lewis,et al.  Multi-period job selection: planning work loads to maximize profit , 2002, Comput. Oper. Res..

[78]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[79]  Philippe Baptiste.  On minimizing the weighted number of late jobs in unit execution time open-shops , 2003, Eur. J. Oper. Res..

[80]  Randall Matignon,et al.  Data Mining Using SAS Enterprise Miner , 2007 .