A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
From MaRDI portal
(Redirected from Publication:418059)
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
Cites work
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A polyhedral approach to single-machine scheduling problems.
- A technical review of column generation in integer programming
- Design and evaluation of a dynamic capacity apportionment procedure.
- Greedy solutions of selection and ordering problems
- Job selection in a heavily loaded shop
- Multi-period job selection: Planning work loads to maximize profit
- Order acceptance using genetic algorithms
- Order acceptance with weighted tardiness
- Parallel machine scheduling by column generation
- Selecting jobs for heavily loaded shop with lateness penalties
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Workload based order acceptance in job shop environments
Cited in
(12)- A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
- Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times
- A matheuristic for the generalized order acceptance and scheduling problem
- Order acceptance for motorail transportation with uncertain parameters
- The capacity planning problem in make-to-order enterprises
- Available-to-promise modeling for multi-plant manufacturing characterized by lack of homogeneity in the product: an illustration of a ceramic case
- Dynamic job assignment: a column generation approach with an application to surgery allocation
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- Resource loading with time windows
- Increasing the revenue of self-storage warehouses by optimizing order scheduling
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Dynamic order acceptance and capacity planning on a single bottleneck resource
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)
