[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A search heuristic for just-in-time scheduling in parallel machines

  • Papers
  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

In recent years the Just-in-Time (JIT) production philosophy as been adopted by many companies around the world. This has motivated the study of scheduling models that embrace the essential components of JIT systems. In this paper, we present a search heurustic for the weighted earliness penalty problem with deadlines in parallel identical machines. Our approach combines elements of the solution methods known as greedy randomized adaptive search procedure (GRASP) and tabu search. It also uses a branch-and-bound post-processor to optimize individually the sequence of the jobs assigned to each machine.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ahmadi, R. and Bagchi, U. (1986) Just-in-Time scheduling in single machine systemsWorking Paper 85/86-4-21, The University of Texas at Austin, USA.

    Google Scholar 

  • Baker, K. R. and Scudder, G. D. (1990) Sequencing with earliness and tardiness penalties: a review.Operations Research,38, 22–36

    Google Scholar 

  • Chand, S. and Schneeberger, H. (1988) Single machine scheduling to minimize weighted earliness subject to no tardy jobs.European Journal of Operational Research,34, 221–30.

    Google Scholar 

  • de Werra, D. and Hertz, A. (1989) Tabu search techniques: a tutorial and an application to neural networks.OR Spectrum,11, 131–41.

    Google Scholar 

  • Feo T. A. and Resende, M. G. C. (1989) A probabilistic heuristic for a computationally difficult set covering problem.Operations Research Letters,8, 67–71.

    Google Scholar 

  • Glover, F. (1989) Tabu search—Part I.ORSA Journal on Computing,1, 190–206.

    Google Scholar 

  • Glover, F. (1990) Tabu search—Part II.ORSA Journal on Computing,1, 4–32.

    Google Scholar 

  • Glover, F. and Greenberg, H. J. (1989) New approaches for heuristic search: a bilateral linkage with artificial intelligence.European Journal of Operations Research,39, 119–30.

    Google Scholar 

  • Laguna, M., Barnes, J. W. and Glover, F. (1990) Tabu search methods for a single machine scheduling problem,Journal of Intelligent Manufacturing, in press.

  • Laguna, M. and Glover, F. (1990) On target analysis and diversification in tabu search.Technical Report, University of Colorado at Boulder, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Business and Administration, University of Colorado at Boulder, Campus Box 419, 80309-0419, Boulder, CO, USA

    Manuel Laguna (US West Postdoctoral Fellow)

  2. Centro de Sistemas de Manufactura, División de Graduados e Investigación, ITESM, Sucursal de Correos J, 64849, Monterrey, NL, México

    José Luis González Velarde

Authors
  1. Manuel Laguna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Luis González Velarde
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Laguna, M., Velarde, J.L.G. A search heuristic for just-in-time scheduling in parallel machines. J Intell Manuf 2, 253–260 (1991). https://doi.org/10.1007/BF01471113

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01471113

Keywords

Search

Navigation