A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
DOI10.1016/J.EJOR.2011.01.002zbMATH Open1237.90045OpenAlexW1978452612MaRDI QIDQ418059FDOQ418059
Chin-Sheng Chen, Siddharth Mestry, Purushothaman Damodaran
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.fiu.edu/cgi/viewcontent.cgi?article=1200&context=etd
Recommendations
- The capacity planning problem in make-to-order enterprises
- A matheuristic for the generalized order acceptance and scheduling problem
- Dynamic bid-price policies for make-to-order revenue management
- Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning
- Dynamic order acceptance and capacity planning on a single bottleneck resource
Linear programming (90C05) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A technical review of column generation in integer programming
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Title not available (Why is that?)
- Order acceptance using genetic algorithms
- Multi-period job selection: Planning work loads to maximize profit
- Workload based order acceptance in job shop environments
- Selecting jobs for heavily loaded shop with lateness penalties
- Order acceptance with weighted tardiness
- Job selection in a heavily loaded shop
- A polyhedral approach to single-machine scheduling problems.
- Parallel machine scheduling by column generation
- Design and evaluation of a dynamic capacity apportionment procedure.
- Greedy solutions of selection and ordering problems
Cited In (11)
- Order acceptance for motorail transportation with uncertain parameters
- Dynamic order acceptance and capacity planning on a single bottleneck resource
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times
- Dynamic job assignment: a column generation approach with an application to surgery allocation
- Available-to-promise modeling for multi-plant manufacturing characterized by lack of homogeneity in the product: an illustration of a ceramic case
- Resource loading with time windows
- Increasing the revenue of self-storage warehouses by optimizing order scheduling
- A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
- A matheuristic for the generalized order acceptance and scheduling problem
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
This page was built for publication: A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418059)
