Abstract
The earliest completion time scheduling problem for n two-stage jobs is considered in a flexible computer-aided manufacturing system with (1 + m) processors (n > m > 1). Each job is assigned to one of m parallel processors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
Yu. I. Degtyarev and D. V. Kovalevskii, "Mathematical models for scheduling robotic production," in: Yu. M. Solomentsev and V. G. Mitrofanov (eds.), Computer-Aided Design and Manufacturing in Machine Building [in Russian], Mashinostroenie, Moscow (1986), pp. 76–83.
Yu. I. Degtyarev, Operations Research [in Russian], Vysshaya Shkola, Moscow (1986).
A. S. Varakin, A. M. Danil'chenko, and A. V. Panishev, "Solution of the job assignment problem for processors in a two-level system," Kibernetika, No. 2, 58–62 (1988).
E. V. Levner, "Network approach to scheduling problems," in: Studies in Discrete Mathematics [in Russian], Nauka, Moscow (1973), pp. 135–150.
M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, San Francisco (1979).
E. G. Koffman (ed.), Scheduling Theory and Computers [in Russian], Nauka, Moscow (1984).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 85–93, March–April, 1992.
Rights and permissions
About this article
Cite this article
Panishev, A.V., Varakin, A.S. Optimal sequencing of two-stage jobs in a flexible computer-aided manufacturing system. Cybern Syst Anal 28, 232–239 (1992). https://doi.org/10.1007/BF01126210
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01126210