A matheuristic for the generalized order acceptance and scheduling problem
From MaRDI portal
Publication:2077965
DOI10.1016/J.EJOR.2021.08.024zbMATH Open1495.90082OpenAlexW3194857510MaRDI QIDQ2077965FDOQ2077965
Authors: İstenç Tarhan, Ceyda Oğuz 
Publication date: 23 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.024
Recommendations
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Scheduling and order acceptance for the customised stochastic lot scheduling problem
- An integrated optimization approach for order assignment and scheduling problems
- Order acceptance and scheduling with machine availability constraints
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- Order acceptance and scheduling on parallel machines with setup time and machine-eligibility constraints
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling with batching: A review
- Single machine scheduling with release dates and rejection
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- Order acceptance using genetic algorithms
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Selecting jobs for heavily loaded shop with lateness penalties
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- Order acceptance strategies in a production-to-order environment with setup times and due-dates
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Order acceptance with weighted tardiness
- Job selection in a heavily loaded shop
- Order acceptance and scheduling with machine availability constraints
- An advanced tabu search algorithm for the job shop problem
- The granular tabu search and its application to the vehicle-routing problem
- Rolling horizon scheduling in a rolling-mill
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Path relinking for the vehicle routing problem
- Greedy solutions of selection and ordering problems
- A hybrid exact algorithm for the TSPTW
- A hybrid genetic algorithm for the open shop scheduling problem
- An improved heuristic for parallel machine scheduling with rejection
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
Cited In (8)
- Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- An artificial bee colony based hyper-heuristic for the single machine order acceptance and scheduling problem
- Order acceptance/rejection policies in determining the sequence in mixed model assembly lines
- Scheduling and order acceptance for the customised stochastic lot scheduling problem
- Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints
Uses Software
This page was built for publication: A matheuristic for the generalized order acceptance and scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2077965)
