Journal ArticleDOI
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
Reads0
Chats0
TLDR
A new branch-and-price optimization algorithm, termed “ primal box ”, and a specific branching variable selection rule that significantly reduces the number of explored nodes are proposed, which solve problems of large size to optimality within reasonable computational time.About:
This article is published in European Journal of Operational Research.The article was published on 2007-02-01. It has received 89 citations till now. The article focuses on the topics: Column generation & Parallel algorithm.read more
Citations
More filters
Journal ArticleDOI
The third comprehensive survey on scheduling problems with setup times/costs
TL;DR: This paper is the third comprehensive survey paper which provides an extensive review of about 500 papers that have appeared since the mid-2006 to the end of 2014, including static, dynamic, deterministic, and stochastic environments, based on shop environments as single machine, parallel machine, flowshop, job shop, or open shop.
Journal ArticleDOI
Parallel Machine Scheduling Under Time-of-Use Electricity Prices: New Models and Optimization Approaches
TL;DR: This paper studies the unrelated parallel machine scheduling problem under a TOU pricing scheme and reformulates the problem using Dantzig-Wolfe decomposition and proposes a column generation heuristic to solve it.
Journal ArticleDOI
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
TL;DR: A branch-and-bound algorithm (B&B) is developed and a solution provided by the metaheuristic GRASP is used as an upper bound and a set of instances is proposed for this type of problem.
Journal ArticleDOI
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties
Javad Behnamian,Mostafa Zandieh +1 more
TL;DR: A discrete version of colonial competitive algorithm is proposed to determine a schedule that minimizes sum of the linear earliness and quadratic tardiness in the hybrid flowshops scheduling problem with simultaneously considering effects of sequence-dependent setup times and limited waiting time.
Journal ArticleDOI
Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach
M. Duran Toksarı,Ertan Güner +1 more
TL;DR: In this paper, a mixed nonlinear integer programming formulation for parallel machine earliness/tardiness (ET) scheduling with simultaneous effects of learning and linear deterioration, sequence-dependent setups, and a common due-date for all jobs is introduced.
References
More filters
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Journal ArticleDOI
Decomposition Principle for Linear Programs
George B. Dantzig,Philip Wolfe +1 more
TL;DR: A technique is presented for the decomposition of a linear program that permits the problem to be solved by alternate solutions of linear sub-programs representing its several parts and a coordinating program that is obtained from the parts by linear transformations.
Journal ArticleDOI
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Cynthia Barnhart,Ellis L. Johnson,George L. Nemhauser,Martin W. P. Savelsbergh,Pamela H. Vance +4 more
TL;DR: In this paper, column generation methods for integer programs with a huge number of variables are discussed, including implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound tree.
Book ChapterDOI
Complexity of machine scheduling problems
TL;DR: In this paper, the authors survey and extend the results on the complexity of machine scheduling problems and give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity.
Journal ArticleDOI
A new optimization algorithm for the vehicle routing problem with time windows
TL;DR: This paper presents a new optimization algorithm capable of optimally solving 100-customer problems of the vehicle routing problem with time windows VRPTW and indicates that this algorithm proved to be successful on a variety of practical sized benchmark VRPTw test problems.
Related Papers (5)
A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times
Eva Vallada,Rubén Ruiz +1 more