Skip to main content
Log in

Learning-based algorithms in scheduling

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

Abstract

The aim of the paper is to present a conception of intelligent learning-based algorithms for scheduling. A general knowledge based model of a vast class of discrete deterministic processes is given. The model is a basis for the method of the synthesis of intelligent, learning-based algorithms, that is described in the paper. The designing simulation experiments that use learning is also described. To illustrate the presented ideas, the scheduling algorithm for a special NP-hard problem is given. The significant feature of the problem is that the retooling time depends not only on a pair of jobs to be processed directly one after the other, but also on the subset of jobs already performed. The proof of the NP-hardness of the problem is also given in the paper.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Bolc, L. and Cytowski, J. (1989) Methods of Heuristic Search, PWN Warszawa (in Polish).

    Google Scholar 

  • Dudek-Dyduch, E. (1987) Simulation of some class of discrete manufacturing processes. Proc. of Europ. Congress on Simulation, Praha.

  • Dudek-Dyduch, E. and Dyduch, T. (1988) Scheduling some class of discrete processes. Proc. of 12th IMACS World Congress, Paris.

  • Dudek-Dyduch, E. and Fuchs-Seliger, S. (1993) Approximate algorithms for some tasks in management and economy, System, Modeling, Control, 1(7).

  • Dudek-Dyduch, E. and Dyduch, T. (1993) Formal approach to optimization of discrete manufacturing processes. In: Hamza M.H. (ed) Proc. of the Twelfth IASTED Int. Conference Modeling, Identification and Control, Acta Press, Zurich.

    Google Scholar 

  • Kolish, R. and Drexel, A. (1995) Adaptive search for solving hard project scheduling problems. Naval Research Logistics, 42.

  • Pearl, J. (1988) Heuristics: Intelligent search strategies for computer problem solving, Addison-Wesley Comp., Menlo Park.

    Google Scholar 

  • Rajedran, C. (1994) A no wait flow shop scheduling heuristic to minimize makespan. Journal of Operational Research Society, 45, 472–478.

    Google Scholar 

  • Sprecher, A., Kolish, R. and Drexl, A. (1995) Semiactive, active and not delay schedules for the resource constrained project scheduling problem, European Journal of Operational Research, 80, 94–102.

    Google Scholar 

  • Vincke, P. (1992) Multicriteria decision-aid, John Wiley & Sons, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dudek-Dyduch, E. Learning-based algorithms in scheduling. Journal of Intelligent Manufacturing 11, 135–143 (2000). https://doi.org/10.1023/A:1008934615349

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008934615349

Navigation