Parallel machine scheduling through column generation: Minimax objective functions (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 648-659

  Van Den Akker, J M ^a   Hoogeveen, J A ^a   Van Kempen, J W ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Column generation; Intermediate lower bounds; Linear programming; Maximum lateness; Parallel machine scheduling; Precedence constraints; Release dates; Set covering formulation; Time indexed formulation

Indexed keywords

COMPUTATION THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING; PROJECT MANAGEMENT;

COLUMN GENERATION; INTERMEDIATE LOWER BOUNDS; PARALLEL MACHINE SCHEDULING; PRECEDENCE CONSTRAINTS;

SCHEDULING;

EID: 33750695647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_58     Document Type: Conference Paper

References (12)

1. J.M. VAN DEN AKKER (1994). LP-based solution methods for single-machine scheduling problems, PhD Thesis, Eindhoven University of Technology.
2. J.M. VAN DEN AKKER, J.A. HOOGEVEEN, AND S.L. VAN DE VELDE (1999). Parallel machine scheduling by column generation. Operations Research 47, 862-872.
3. J.M. VAN DEN AKKER, J.A. HOOGEVEEN, AND S.L. VAN DE VELDE (2005). Applying column generation to machine scheduling. G. Desaulniers, J. Desrosiers, and M.M. Solomon (eds.). Column Generation, Springer, 303-330.
4. P. BRUCKER AND S. KNUST (2000). A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research 127, 355-362.
5. P. BRUCKER AND S. KNUST (2002). Lower bounds for scheduling a single robot in a job-shop environment. Annals of Operations Research 115, 147-172.
6. P. BRUCKER AND S. KNUST (2003). Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 149, 302-313.
7. Z.L. CHEN AND W.B. POWELL (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing 11, 78-94.
8. M.R. GAREY, R.E. TARJAN, G.T. WILFONG (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13, 330-348.
9. R.L. GRAHAM, E.L. LAWLER, J.K. LENSTRA, AND A.H.G. RINNOOY KAN (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287-326.
10. J.R. JACKSON (1955). Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Sciences Research Project, UCLA.
11. E.L. LAWLER AND J.M. MOORE (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science 16, 77-84.
12. J.P. DE SOUSA AND L.A. WOLSEY (1992). A time-indexed formulation of nonpreemptive single-machine scheduling problems. Mathematical Programming 54, 353-367.