release dates, deadlines, and/or generalized precedence constraints Marjan...  Home/Search
Context
Related
| cs.uu.nl/research/techre...2005027.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uu.nl/research/techreps/...jvl (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 turn the minimization problem into a decision problem by putting an upper bound on the outcome... (Update)
Active bibliography (related documents): More All
0.3: Combining Column Generation and Lagrangean Relaxation: An.. - van den Akker, al. (2000) (Correct)
0.3: Flexible Release Composition using Integer - Linear Programming Marjan (2004) (Correct)
0.2: A Review of Exact Solution Methods for the Non-Preemptive.. - Kis, Pesch (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ deadlines-generation,
author = "Release Dates Deadlines",
title = "Generation: Minimax Objective Functions,",
url = "citeseer.ist.psu.edu/755714.html" }
Citations (may not include all citations):212 Optimization and approximation in deterministic sequencing a.. (context) - Graham, Lawler et al. - 1979
75 Linear Programming and Network Flows (context) - Bazaraa, Jarvis et al. - 1990
44 Scheduling a production line to minimize maximum tardiness (context) - Jackson - 1955
28 A functional equation and its application to resource alloca.. (context) - Lawler, Moore - 1969
21 A time-indexed formulation of nonpreemptive single-machine s.. (context) - de Sousa, Wolsey - 1992
10 One-processor scheduling with symmetric earliness and tardin.. (context) - Garey, Tarjan et al. - 1988
9 A linear programming and constraint propagation-based lower .. - Brucker, Knust - 2000
8 Constraint-based scheduling: Applying constraint programming.. (context) - Baptiste, Le Pape et al. - 2001
8 Solving parallel machine scheduling problems by column gener.. - Chen, Powell - 1999
5 LP-based solution methods for single-machine scheduling prob.. (context) - van den Akker - 1994
4 Scheduling jobs with release dates and tails on identical ma.. (context) - Carlier - 1987
3 Parallel machine scheduling by column generation - van den Akker, Hoogeveen et al. - 1999
1 Applying column generation to machine scheduling (context) - van den Akker, Hoogeveen et al. - 2005
1 Lower bounds for scheduling a single robot in a job-shop env.. (context) - Brucker, Knust - 2002
1 Lower bounds for resource-constrained project scheduling pro.. (context) - Brucker, Knust - 2003
Documents on the same site (http://www.cs.uu.nl/research/techreps/grp/jvl.html): More
Comparing Loop Cutsets and Clique Trees in Probabilistic.. - van der Gaag, Bodlaender (1997) (Correct)
Convex Recoloring of Leaf-Colored Trees - Bachoore, Bodlaender (2006) (Correct)
Linear Election for Oriented Hypercubes - Gerard Tel Department (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC