A branch and price solution approach for order acceptance and capacity planning in make-to-order operations

DOI10.1016/J.EJOR.2011.01.002zbMath1237.90045OpenAlexW1978452612MaRDI QIDQ418059

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

zbMATH Keywords

large-scale optimizationbranch-and-priceorder acceptancecapacity planningmake-to-order operations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06)

Related Items (10)

Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times ⋮ Resource loading with time windows ⋮ Increasing the revenue of self-storage warehouses by optimizing order scheduling ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ Dynamic job assignment: a column generation approach with an application to surgery allocation ⋮ Order acceptance for motorail transportation with uncertain parameters ⋮ Available-to-promise modeling for multi-plant manufacturing characterized by lack of homogeneity in the product: an illustration of a ceramic case ⋮ A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime ⋮ A matheuristic for the generalized order acceptance and scheduling problem

Cites Work

• Unnamed Item
• Order acceptance with weighted tardiness
• Order acceptance using genetic algorithms
• Multi-period job selection: Planning work loads to maximize profit
• Job selection in a heavily loaded shop
• Design and evaluation of a dynamic capacity apportionment procedure.
• A polyhedral approach to single-machine scheduling problems.
• Workload based order acceptance in job shop environments
• A technical review of column generation in integer programming
• Selecting jobs for heavily loaded shop with lateness penalties
• Parallel Machine Scheduling by Column Generation
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Greedy solutions of selection and ordering problems

This page was built for publication: A branch and price solution approach for order acceptance and capacity planning in make-to-order operations