Skip to main content
SpringerLink
Log in

More Advanced General Purpose Procedures

  • Chapter
  • First Online:
Scheduling

  • 10k Accesses

Abstract

The previous chapter covered the more established and the more widely used generic procedures. This chapter focuses on techniques that are more specialized and not as widely used.

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

  • Ph. Baptiste, C. Le Pape, and W. Nuijten (1995) “Constraint-Based Optimization and Approximation for Job-Shop Scheduling”, in Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems IJCAI-95, Montreal, Canada.

    Google Scholar 

  • Ph. Baptiste, C. Le Pape, and W. Nuijten (2001) Constraint-Based Scheduling, Kluwer Academic Publishers, Boston.

    Book  MATH  Google Scholar 

  • S. Chand, R. Traub and R. Uzsoy (1996) “Single Machine Scheduling with Dynamic Arrivals: Decomposition Results and an Improved Algorithm”, Naval Research Logistics, Vol. 31, pp. 709–719.

    Article  MathSciNet  Google Scholar 

  • S. Chand, R. Traub and R. Uzsoy (1997) “Rolling Horizon Procedures for the Single Machine Deterministic Total Completion Time Scheduling Problem with Release Dates”, Annals of Operations Research, Vol. 70, C.-Y. Lee and L. Lei (eds.), pp. 115–125.

    Google Scholar 

  • C.-C. Cheng and S.F. Smith (1997) “Applying Constraint Satisfaction Techniques to Job Shop Scheduling”, Annals of Operations Research, Vol. 70, C.-Y. Lee and L. Lei (eds.), pp. 327–357.

    Google Scholar 

  • K. Deb (2001) Multi-objective Optimization Using Evolutionary Algorithms, John Wiley, Chichester, England.

    MATH  Google Scholar 

  • B. Eck and M. Pinedo (1993) “On the Minimization of the Makespan Subject to Flow Time Optimality”, Operations Research, Vol. 41, pp. 797–800.

    Article  MATH  Google Scholar 

  • A. Elkamel and A. Mohindra (1999) “A Rolling Horizon Heuristic for Reactive Scheduling of Batch Process Operations”, Engineering Optimization, Vol. 31, pp. 763–792.

    Article  Google Scholar 

  • M.S. Fox (1987) Constraint Directed Search: A Case Study of Job-Shop Scheduling, Morgan Kaufmann Publishers, San Francisco, California.

    MATH  Google Scholar 

  • M.S. Fox and S.F. Smith (1984) “ISIS – A Knowledge-Based System for Factory Scheduling”, Expert Systems, Vol. 1, pp. 25–49.

    Article  Google Scholar 

  • D.J. Hoitomt, P.B. Luh and K.R. Pattipati (1993) “A Practical Approach to Job Shop Scheduling Problems”, IEEE Transactions on Robotics and Automation, Vol. 9, pp. 1–13.

    Article  Google Scholar 

  • E. Kutanoglu and S.D. Wu (1999) “On Combinatorial Auction and Lagrangean Relaxation for Distributed Resource Scheduling”, IIE Transactions, Vol. 31, pp. 813–826.

    Google Scholar 

  • P.B. Luh and D.J. Hoitomt (1993) “Scheduling of Manufacturing Systems Using the Lagrangean Relaxation Technique”, IEEE Transactions on Automatic Control, Special Issue: Meeting the Challenge of Computer Science in the Industrial Applications of Control, Vol. 38, pp. 1066–1080.

    Article  MathSciNet  Google Scholar 

  • P.B. Luh, D.J. Hoitomt, E. Max and K.R. Pattipati (1990) “Schedule Generation and Reconfiguration for Parallel Machines”, IEEE Transactions on Robotics and Automation, Vol. 6, pp. 687–696.

    Article  Google Scholar 

  • S.T. McCormick and M. Pinedo (1995) “Scheduling n Independent Jobs on m Uniform Machines with both Flow Time and Makespan Objectives: a Parametric Analysis,” ORSA Journal of Computing, Vol. 7, pp. 63–77.

    Article  MATH  Google Scholar 

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

    Google Scholar 

  • W.P.M. Nuijten (1994) Time and Resource Constrained Scheduling; A Constraint Satisfaction Approach, Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, the Netherlands.

    Google Scholar 

  • W.P.M. Nuijten and E.H.L. Aarts (1996) “A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling”, European Journal of Operational Research, Vol. 90, pp. 269–284.

    Article  MATH  Google Scholar 

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

    Book  Google Scholar 

  • P.S. Ow and T.E. Morton (1988) “Filtered Beam Search in Scheduling”, International Journal of Production Research, Vol. 26, pp. 297–307.

    Article  Google Scholar 

  • P.S. Ow, S.F. Smith and R. Howie (1988) “A Cooperative Scheduling System”, in Expert Systems and Intelligent Manufacturing, M. D. Oliff, (ed.), Elsevier, Amsterdam, pp. 43–56.

    Google Scholar 

  • R. Roundy, W. Maxwell, Y. Herer, S. Tayur and A. Getzler (1991) “A Price-Directed Approach to Real-Time Scheduling of Production Operations”, IIE Transactions, Vol. 23, pp. 449–462.

    Article  Google Scholar 

  • I. Sabuncuoglu and A. Toptal (1999a) “Distributed Scheduling I: A Review of Concepts and Applications”, Technical Paper No: IEOR 9910, Department of Industrial Engineering, Bilkent University, Ankara, Turkey.

    Google Scholar 

  • I. Sabuncuoglu and A. Toptal (1999b) “Distributed Scheduling II: Bidding Algorithms and Performance Evaluations”, Technical Paper No: IEOR 9911, Department of Industrial Engineering, Bilkent University, Ankara, Turkey.

    Google Scholar 

  • T. Sandholm (1993) “An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations”, in Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-93), pp. 256–262.

    Google Scholar 

  • M.J. Shaw (1987) “A Distributed Scheduling Method for Computing Integrated Manufacturing: the Use of Local Area Networks in Cellular Systems,” International Journal of Production Research, Vol. 25, pp. 1285–1303.

    Article  Google Scholar 

  • M.J. Shaw (1988a) “Dynamic Scheduling in Cellular Manufacturing Systems; A Framework for Networked Decision Making”, Journal of Manufacturing Systems, Vol. 7, pp. 83–94.

    Article  Google Scholar 

  • M.J. Shaw (1989) “FMS Scheduling as Cooperative Problem Solving”, Annals of Operations Research, Vol. 17, pp. 323–346.

    Article  Google Scholar 

  • W. Szwarc (1998) “Decomposition in Single-Machine Scheduling”, Annals of Operations Research, Vol. 83, pp. 271–287.

    Article  MathSciNet  MATH  Google Scholar 

  • M.P. Wellman, W.E. Walsh, P. Wurman and J.K. MacKie-Mason (2001) “Auction Protocols for Decentralized Scheduling”, Games and Economic Behavior, Vol. 35, pp. 271–303.

    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). More Advanced General Purpose Procedures. In: Scheduling. Springer, Cham. https://doi.org/10.1007/978-3-319-26580-3_15

Download citation

Publish with us

Policies and ethics

Search

Navigation