Skip to main content
SpringerLink
Log in

Applying Column Generation to Machine Scheduling

  • Chapter
Column Generation

Abstract

The goal of a scheduling problem is to find out when each task must be performed and by which machine such that an optimal solution is obtained. Especially when the main problem is to divide the jobs over the machines, column generation turns out to be very successful. Next to a number of these ‘partitioning’ problems, we shall discuss a number of other problems that have successfully been tackled by a column generation approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Van den Akker, J.M., Hoogeveen, J.A., and Van de Velde, S.L. (1999). Parallel machine scheduling by column generation. Operations Research, 47:862–872.

    MathSciNet  Google Scholar 

  • Van den Akker, J.M., Hoogeveen, J.A., and Van de Velde, S.L. (2002). Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem. INFORMS Journal on Computing, 14:37–51.

    Article  MathSciNet  Google Scholar 

  • Van den Akker, J.M., and Hoogeveen, J.A. (2004). Minimizing the number of tardy jobs. In: Handbook of Scheduling (J.Y.-T. Leung, ed.), Algorithms, Models, and Performance Analysis, pp. 227–243, CRC Press, Inc. Boca Raton, Fl, USA.

    Google Scholar 

  • Van den Akker, J.M., Hurkens, C.A.J., and Savelsbergh, M.W.P. (2000). Time-indexed formulations for single-machine scheduling problems: column generation. INFORMS Journal on Computing, 12:111–124.

    Article  MathSciNet  Google Scholar 

  • Baar, T., Brucker, P., and Knust S. (1998). Tabu-search algorithms and Lower bounds for the resource-constrained project scheduling problem, In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, (S. Voss, S. Martello, I. Osman, and C. Roucairol, eds.), pp. 1–18, Kluwer, Dordrecht.

    Google Scholar 

  • Baptiste, P., Le Pape, C, and Nuijten, W. (2001). Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Dordrecht, The Netherlands.

    Google Scholar 

  • Brucker, P., Knust, S., Schoo, A., and Thiele, O. (1998). A branch-and-bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 107:272–288.

    Article  Google Scholar 

  • Brucker, P. and Knust, S. (2000). A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research, 127:355–362.

    Article  Google Scholar 

  • Brucker, P. and Knust, S. (2002). Lower bounds for scheduling a single robot in a job-shop environment. Annals of Operations Research, 115:147–172.

    Article  MathSciNet  Google Scholar 

  • Brucker, P. and Knust, S. (2003). Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research, 149:302–313.

    Article  MathSciNet  Google Scholar 

  • Bülbül, K., Kaminsky, P, and Yano, C. (2001). Preemption in single-machine earliness/tardiness scheduling. Submitted to: Naval Research Logistics for publication. Department of IEOR, University of California at Berkeley.

    Google Scholar 

  • Bülbül, K., Kaminsky, P, and Yano, C. (2004). Flow Shop Scheduling with Earliness, Tardiness and Intermediate Inventory Holding Costs. Naval Research Logistics, 51:1–39.

    Article  MathSciNet  Google Scholar 

  • Carlier, J. (1987). Scheduling jobs with release dates and tails on identical machines to minimize makespan. European Journal of Operational Research, 29:298–306.

    Article  MATH  MathSciNet  Google Scholar 

  • Chen, Z.L. and Lee, C.-Y. (2002). Parallel machine scheduling with a common due window. European Journal of Operational Research, 136:512–527.

    Article  MathSciNet  Google Scholar 

  • Chen, Z.L. and Powell, W.B. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11:78–94.

    MathSciNet  Google Scholar 

  • Chen, Z.L. and Powell, W.B. (1999). A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. European Journal of Operational Research, 116:220–232.

    Article  Google Scholar 

  • Chen, Z.L. and Powell, W.B. (2003). Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Research Logistics, 50:823–840.

    Article  MathSciNet  Google Scholar 

  • Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5:287–326.

    Article  MathSciNet  Google Scholar 

  • Hall, L.A., Schulz, A.S., Shmoys, D.B., and Wein, J. (1997). Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research, 22:513–544.

    MathSciNet  Google Scholar 

  • Klein, R. and Scholl, A. (1999). Conmputing lower bounds by destructive improvement—an application to resource-constrained project scheduling. European Journal of Operational Research, 112:322–346.

    Article  Google Scholar 

  • Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys D.B. (1993). Sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory (S.C. Graves, P.H. Zipkin, and A.H.G. Rinnooy Kan, eds.), Handbooks in Operations Research and Management Science, Volume 4, pp. 445–522, North-Holland, Amsterdam.

    Google Scholar 

  • Lawler, E.L. and Moore, J.M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16:77–84.

    Google Scholar 

  • Lee, C.-Y. and Chen, Z.L. (2000). Scheduling jobs and maintenance activities on parallel machines. Naval Research Logistics, 47:145–165.

    Article  MathSciNet  Google Scholar 

  • Potts, C.N. and Van Wassenhove, L.N. (1992). Single machine scheduling to minimize total late work. Operations Research, 40:586–595.

    Article  MathSciNet  Google Scholar 

  • Smith, W.E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:325–333.

    Google Scholar 

  • Vandevelde, A.M.G., Hoogeveen, J.A., Hurkens, C.A.J., and Lenstra, J.K. (2004). Lower bounds for the head-body-tail problem on parallel machines: A computational study of the multiprocessor flow shop. Forthcoming in: INFORMS Journal on Computing.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Utrecht University, The Netherlands

    Marjan van den Akker & Han Hoogeveen

  2. Erasmus University, The Netherlands

    Steef van de Velde

Authors
  1. Marjan van den Akker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Han Hoogeveen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steef van de Velde
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. GERAD and École Polytechnique de Montréal, Canada

    Guy Desaulniers

  2. GERAD and HEC Montréal, Canada

    Jacques Desrosiers

  3. GERAD and Northeastern University, Boston

    Marius M. Solomon

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

van den Akker, M., Hoogeveen, H., van de Velde, S. (2005). Applying Column Generation to Machine Scheduling. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation. Springer, Boston, MA. https://doi.org/10.1007/0-387-25486-2_11

Download citation

Publish with us

Policies and ethics

Search

Navigation