Scheduling and Resource Allocation Problems in Some Flow Type Manufacturing Processes

  • Adam Janiak


Many manufacturing processes characterize by a flow of works (jobs) through successive machines (processors, devices) in a given technological order. The classical multi-machine flow-shop problems have traditionally been considered in many papers (e.g. in [11]) under the assumption that work processing times are-constant parameters, However, in many manufacturing processes work processing times may vary over the ranges of durations bounded by the maximum (normal) and minimum (crash) value of duration. In other words in such situations a scheduler (an algorithm) may have at its disposal certain continuously - divisible limited resources, such as financial outlay, energy, gas, fuel, catalyzer, raw materials, power, which may be applied to reduce effectively the processing times of individual works. Such problems require a more general approach to scheduling, one that determines not only the order in which works should be processed, but also the distribution of limited resources to individual works or to machines on which they are processed.


Completion Time Critical Path Parallel Machine Single Machine Flow Shop 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. |1|.
    J. Grabowski, A. Janiak, Job-shop scheduling with resource-time models of operations, Europ. J. Oper. Res., 28, 58–73, 1987.CrossRefGoogle Scholar
  2. |2|.
    A. Janiak, General flow-shop scheduling with resource constraints, Int. J. Prod. Res. 26, 1089–1103, 1988.CrossRefGoogle Scholar
  3. |3|.
    A. Janiak, Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem, Inf. Proc. Letters, 32, 101–112, 1989.CrossRefGoogle Scholar
  4. |4|.
    A. Janiak, Time-optimal control in a single machine problem with resource constraints, Automatica, 22, 745–747, 1986.CrossRefGoogle Scholar
  5. |5|.
    A. Janiak, One machine scheduling problems with resource constraints, in: Proc. of the 12th IFIP Conference System Modelling and Control, Budapest, Springer-Verlag, 84, 358–364, 1986.Google Scholar
  6. |6|.
    A. Janiak, Job-shop problem with parallel machines subject to resource constraints, Scientific bulletins of the University of Mining and Metallurgy, 928, 339–350, 1982 (in Polish).Google Scholar
  7. |7|.
    A. Janiak, Single machine scheduling problem with a common deadline and resource dependent release dates, Europ. J. Oper. Res. (to appear).Google Scholar
  8. |8|.
    A. Janiak, Resource-optimum control in a single machine problem with completion time constraint Report No 63/89 Inst. Eng. Cyber., Wroclaw Techn. Univ.Google Scholar
  9. |9|.
    A. Janiak, Minimization of the blooming mill standstills - Mathematical model - Suboptimal algorithms, Scientific bulletins of the University of Mining and Metallurgy 8 /2, 37–49, 1989.Google Scholar
  10. |10|.
    A. Janiak, Optimum and approximation algorithms of sequencing jobs and resources allocation in discrete and discrete-continuous manufacturing processes. Monograph of Technical University of Wroclaw 1990/91 (to appear, in Polish).Google Scholar
  11. |11|.
    B.J. Lageweg, J.K. Lenstra, A.H.G. Rinnooy Kan, A general bounding scheme for the permutation flow-shop problem. Oper. Res. 28, 53–67, 1978.CrossRefGoogle Scholar
  12. |12|.
    J.F. Muth, G.L. Thompson (eds), Industrial Scheduling. Prentice Hall, Engelwood Cliffs, 1963.Google Scholar
  13. |13|.
    T.J. Williams(ed), Analysis and design of hierarchical control systems: with special reference to steel plant operations, North-Holland, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1991

Authors and Affiliations

  • Adam Janiak

There are no affiliations available

Personalised recommendations