Using column generation to solve parallel machine scheduling problems with minmax objective functions
نویسندگان
چکیده
منابع مشابه
Using column generation to solve parallel machine scheduling problems with minmax objective functions
In this paper we consider the parallel machine scheduling problem of minimizing an objective function of the minmax type, like maximum lateness, subject to release dates, deadlines, and/or generalized precedence constraints. We use a destructive strategy to compute a lower bound. Here we test the feasibility of a decision problem by applying column generation to compute a bound on the number of...
متن کاملParallel Machine Scheduling Through Column Generation: Minimax Objective Functions
In this paper we describe a solution framework for a number of scheduling problems in which the goal is to find a feasible schedule that minimizes some objective function of the minimax type on a set of parallel, identical machines, subject to release dates, deadlines, and/or generalized precedence constraints. We determine a lower bound on the objective function in the following way. We first ...
متن کاملSolving Parallel Machine Scheduling Problems by Column Generation
We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The decomposition approach rst formulates these problems as an integer program, and then reformulates the integer program, using Dantzig-Wolfe decomposition, as ...
متن کاملParallel Machine Scheduling by Column Generation
Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the job completion times. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that strong and fast linear programming lower bounds can be computed for an important class of machine scheduling...
متن کاملTime-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but they are good guides for approximation algorithms as well. Unfortunately, time-indexed formulations have one major disadvantage: their size. Even for relatively small instances the number of constraints and the number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2010
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-010-0191-z