A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order acceptance with weighted tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale mixed integer programming: Benders-type heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions to Uncertain Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in robust optimization: an overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming with interval right hand sides / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job selection in a heavily loaded shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-period job selection: Planning work loads to maximize profit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unrelated parallel machines to minimize total weighted tardiness. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and price solution approach for order acceptance and capacity planning in make-to-order operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition by Local Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order acceptance using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed-up Benders decomposition using maximum density cut (MDC) generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders method using covering cut bundle generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting jobs for heavily loaded shop with lateness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Cuts in Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order acceptance and scheduling with machine availability constraints / rank
 
Normal rank

Latest revision as of 05:55, 15 July 2024

scientific article
Language Label Description Also known as
English
A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
scientific article

    Statements

    A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    order acceptance and scheduling
    0 references
    non-identical parallel machines
    0 references
    robust optimization
    0 references
    Benders decomposition algorithm
    0 references
    0 references
    0 references
    0 references
    0 references