Skip to main content
SpringerLink
Log in

What Lies Ahead?

  • Chapter
  • First Online:
Scheduling

  • 10k Accesses

Abstract

This chapter describes various research and development topics that are likely to receive attention in the near future. A distinction is made between theoretical research, applied research, and developments in system design.

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 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  • E.H.L. Aarts and J.K. Lenstra (eds.) (1997) Local Search and Combinatorial Optimization, J. Wiley, New York.

    Google Scholar 

  • A. Agnetis, P. B. Mirchandani, D. Pacciarelli and A. Pacifici (2004) “Scheduling Problems with Two Competing Agents”, Operations Research, Vol. 52, pp. 229–242.

    Article  MathSciNet  MATH  Google Scholar 

  • K.R. Baker and J. C. Smith (2003) “A Multiple-Criterion Model for Machine Scheduling”. Journal of Scheduling, Vol. 6, pp. 7–16.

    Article  MathSciNet  MATH  Google Scholar 

  • B. Chen, C.N. Potts and G.J. Woeginger (1998) “A Review of Machine Scheduling: Complexity, Algorithms, and Approximability”, in Handbook of Combinatorial Optimization, D.-Z. Du and P. Pardalos (eds.), pp. 21–169, Kluwer Academic Press, Boston.

    Google Scholar 

  • Z.-L. Chen and G. Pundoor (2006) “Order Assignment and Scheduling in a Supply Chain”, Operations Research, Vol. 54, pp. 555–572.

    Article  MathSciNet  MATH  Google Scholar 

  • Z.-L. Chen and G. Vairaktarakis (2005) “Integrated Scheduling of Production and Distribution Operations”, Management Science, Vol. 51, pp. 614–628.

    Article  MATH  Google Scholar 

  • T.C.E. Cheng, C.T. Ng and J.J. Yuan (2006) “Multi-Agent Scheduling on a Single Machine to Minimize Total Weighted Number of Tardy Jobs”, Theoretical Computer Science, Vol. 362, pp. 273–281.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Chimani, N. Lesh, M. Mitzenmacher, C. Sidner, and H. Tanaka (2005) “A Case Study in Large-Scale Interactive Optimization”, in Proceedings of the International Conference on Artificial Intelligence and Applications 2005 (AIA05), IASTED-Proc, pp. 24–29, Acta Press, Anaheim, CA.

    Google Scholar 

  • R.K. Congram, C.N. Potts, and S.L. van de Velde (2002) “An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem”, INFORMS Journal on Computing, Vol. 14, pp. 52–67.

    Article  MathSciNet  MATH  Google Scholar 

  • I. Curiel, H. Hamers and F. Klijn (2002) “Sequencing Games: A Survey”, in Chapters in Game Theory (Theory and Decision Library, 31), P.E.M. Borm and H.J.M. Peeters (eds.), Kluwer Academic Publishers, Dordrecht, the Netherlands.

    Google Scholar 

  • H. Deng, L. Chen, C. Wang and Q. Deng (2006) “A Grid-Based Scheduling System of Manufacturing Resources for a Virtual Enterprise”, International Journal of Advanced Manufacturing Technology, Vol. 28, pp. 137–141.

    Article  Google Scholar 

  • M. Derthick and S.F. Smith (2005), “An Interactive 3D Visualization for Requirements Analysis and Scheduling”, Robotics Institute Technical Report CMU-RI-TR-05-62, Carnegie Mellon University, May 2005.

    Google Scholar 

  • N.G. Hall and C.N. Potts (2003) “Supply Chain Scheduling: Batching and Delivery”, Operations Research, Vol. 51, pp. 566–584.

    Article  MathSciNet  MATH  Google Scholar 

  • N.G. Hall and C. N. Potts (2004) “Rescheduling for New Orders”, Operations Research, Vol. 52, pp. 440–453.

    Article  MathSciNet  MATH  Google Scholar 

  • H. Hoos and T. Stützle (2005) Stochastic Local Search - Foundations and Applications, Morgan Kaufmann Publishers, Elsevier, Amsterdam.

    MATH  Google Scholar 

  • S. Kerpedjiev and S.F. Roth (2000) “Mapping Communicative Goals into Conceptual Tasks to Generate Graphics in Discourse”, in Proceedings of Intelligent User Interfaces (IUI ’00), January 2000.

    Google Scholar 

  • K. Kurowski, J. Nabrzyski, A. Oleksiak and J. Weglarz (2006) “Scheduling Jobs on the Grid - Multicriteria Approach”, Computational Methods in Science and Technology, Vol. 12, pp. 123–138.

    Article  Google Scholar 

  • C.-Y. Lee (2004) “Machine Scheduling with Availability Constraints”, Chapter 22 in Handbook of Scheduling, J. Y.-T. Leung (ed.), Chapman and Hall/CRC, Boca Raton, Florida.

    Google Scholar 

  • K. McKay, M. Pinedo and S. Webster (2002) “A Practice-Focused Agenda for Production Scheduling Research”, Production and Operations Management, Vol. 11, p. 249–258.

    Google Scholar 

  • N. Megow, M. Uetz, and T. Vredeveld (2006) “Models and Algorithms for Stochastic Online Scheduling”, Mathematics of Operations Research, Vol. 31, pp. 513–525.

    Article  MathSciNet  MATH  Google Scholar 

  • T.E. Morton and D. Pentico (1993) Heuristic Scheduling Systems, John Wiley, New York.

    Google Scholar 

  • I.M. Ovacik and R. Uzsoy (1997) Decomposition Methods for Complex Factory Scheduling Problems, Kluwer Academic Publishers, Boston.

    Book  Google Scholar 

  • K. Pruhs, J. Sgall, and E. Torng (2004) “Online Scheduling”, Chapter 15 in Handbook of Scheduling, J. Y-T. Leung (ed.), Chapman and Hall/CRC, Boca Raton, Florida.

    Google Scholar 

  • M. Queyranne (1993) “Structure of a Simple Scheduling Polyhedron”, Mathematical Programming, Vol. 58, pp. 263–286.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Queyranne and A.S. Schulz (1994) “Polyhedral Approaches to Machine Scheduling”, Preprint No. 408/1994, Fachbereich 3 Mathematik, Technische Universität Berlin, Berlin.

    Google Scholar 

  • M. Queyranne and Y. Wang (1991) “Single Machine Scheduling Polyhedra with Precedence Constraints”, Mathematics of Operations Research, Vol. 16, pp. 1–20.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Schuurman and G.J. Woeginger (1999) “Polynomial Time Approximation Algorithms for Machine Scheduling: Ten Open Problems”, Journal of Scheduling, Vol. 2, pp. 203–214.

    Article  MathSciNet  MATH  Google Scholar 

  • S.F. Smith and M.A. Becker (1997) “An Ontology for Constructing Scheduling Systems”, in Working Notes from 1997 AAAI Spring Symposium on Ontological Engineering, Stanford University, Stanford, California.

    Google Scholar 

  • P. Van Hentenryck and L. Michel (2005) Constraint-Based Local Search, MIT Press, Cambridge, Massachusetts.

    Google Scholar 

  • G.E. Vieira, J.W. Herrmann, and E. Lin (2003) “Rescheduling Manufacturing Systems: A Framework of Strategies, Policies and Methods”, Journal of Scheduling, Vol. 6, pp. 39–62.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IOMS Dept Rm 8-59 KMC, NYU Stern School of Business, New York, NY, USA

    Michael L. Pinedo

Authors
  1. Michael L. Pinedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Pinedo, M.L. (2016). What Lies Ahead?. In: Scheduling. Springer, Cham. https://doi.org/10.1007/978-3-319-26580-3_20

Download citation

Publish with us

Policies and ethics

Search

Navigation