An efficient heuristic for a real-life OAS problem
From MaRDI portal
Cites work
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
- A matheuristic for the generalized order acceptance and scheduling problem
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
- Changeover formulations for discrete-time mixed-integer programming scheduling models
- Cluster analysis to minimize sequence dependent changeover times
- Fast Approximation Algorithms for Knapsack Problems
- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- Improved algorithms for single machine scheduling with release dates and rejections
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm
This page was built for publication: An efficient heuristic for a real-life OAS problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854786)
