A matheuristic for the generalized order acceptance and scheduling problem

DOI10.1016/j.ejor.2021.08.024zbMath1495.90082OpenAlexW3194857510MaRDI QIDQ2077965

İstenç Tarhan, Oguz, Ceyda

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

zbMATH Keywords

schedulingmetaheuristicsmatheuristicorder acceptancetime-indexed models

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• TSPTW
• VRP

Cites Work

• A real-time order acceptance and scheduling approach for permutation flow shop 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
• A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Order acceptance with weighted tardiness
• Order acceptance using genetic algorithms
• Single machine scheduling with release dates and rejection
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Rolling horizon scheduling in a rolling-mill
• Job selection in a heavily loaded shop
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• A hybrid genetic algorithm for the open shop scheduling problem
• 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
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
• Scheduling with batching: A review
• Single-machine scheduling with release times, deadlines, setup times, and rejection
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
• Order acceptance and scheduling with machine availability constraints
• An advanced tabu search algorithm for the job shop problem
• Path relinking for the vehicle routing problem
• Selecting jobs for heavily loaded shop with lateness penalties
• An improved heuristic for parallel machine scheduling with rejection
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
• A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
• A Hybrid Exact Algorithm for the TSPTW
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Order acceptance strategies in a production-to-order environment with setup times and due-dates
• A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
• Greedy solutions of selection and ordering problems
• An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem

This page was built for publication: A matheuristic for the generalized order acceptance and scheduling problem