Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
From MaRDI portal
Publication:1652516
DOI10.1016/j.cor.2017.09.006zbMath1391.90319OpenAlexW2751180135MaRDI QIDQ1652516
Anand Subramanian, Yuri Laio T. V. Silva, Artur Alves Pessoa
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.09.006
Lagrangian relaxationcolumn generationiterated local searchorder acceptance and schedulingarc-time-indexed formulation
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem ⋮ The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics ⋮ Solving the single crane scheduling problem at rail transshipment yards ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Joint client selection and contract design for a risk-averse commodity broker in a two-echelon supply chain ⋮ A matheuristic for the generalized order acceptance and scheduling problem
Cites Work
- Improved bounds for large scale capacitated arc routing problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- Hybrid metaheuristics for the clustered vehicle routing problem
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Order acceptance with weighted tardiness
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Order acceptance using genetic algorithms
- Multi-period job selection: Planning work loads to maximize profit
- Job selection in a heavily loaded shop
- Variable neighborhood search
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- A simple and effective metaheuristic for the minimum latency problem
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- Order acceptance and scheduling with machine availability constraints
- An exact algorithm for single-machine scheduling without machine idle time
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
- Improved branch-cut-and-price for capacitated vehicle routing
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- Comparison of bundle and classical column generation
- Selecting jobs for heavily loaded shop with lateness penalties
- Order acceptance strategies in a production-to-order environment with setup times and due-dates
- Validation of subgradient optimization
- Greedy solutions of selection and ordering problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
