A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
type: Item
instance of: scholarly article
title: A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
zbMATH Open document ID: 1384.90044
author: Saeed Emami
author: G. Moslehi
author: Mohammad S. Sabbagh
published in: Computational and Applied Mathematics
publication date: 2018-02-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6842732
zbMATH Keywords: order acceptance and scheduling
zbMATH Keywords: non-identical parallel machines
zbMATH Keywords: robust optimization
zbMATH Keywords: Benders decomposition algorithm
MaRDI profile type: Publication
full work available at URL: s40314-015-0302-8
OpenAlex ID: W2226422592
cites work: Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
cites work: Q3182207
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: The Price of Robustness
cites work: Order acceptance with weighted tardiness
cites work: Large-scale mixed integer programming: Benders-type heuristics
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Recent advances in robust optimization: an overview
cites work: Linear programming with interval right hand sides
cites work: Job selection in a heavily loaded shop
cites work: Q3374086
cites work: Multi-period job selection: Planning work loads to maximize profit
cites work: Scheduling unrelated parallel machines to minimize total weighted tardiness.
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
cites work: A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
cites work: A comparative analysis of several asymmetric traveling salesman problem formulations
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Accelerating Benders decomposition by local branching
cites work: Order acceptance using genetic algorithms
cites work: Speed-up Benders decomposition using maximum density cut (MDC) generation
cites work: Accelerating Benders method using covering cut bundle generation
cites work: Q5442489
cites work: Selecting jobs for heavily loaded shop with lateness penalties
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
cites work: An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
cites work: Inexact Cuts in Benders Decomposition
cites work: Order acceptance and scheduling with machine availability constraints
DOI: 10.1007/S40314-015-0302-8
description: scientific article; zbMATH DE number 6842732