zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A survey of priority rule-based scheduling. (English) Zbl 0658.90047
We survey the literature on heuristic priority rule-based job shop scheduling. Priority rules have been intensively investigated over the last 30 years by means of simulation experiments. They are also used in Shop Floor Control software systems. We present a classification, a characterization, and an evaluation of elementary priority rules. Some priority rule-related model extensions are discussed.
90B35Scheduling theory, deterministic
90-02Research monographs (optimization)
[1]Adam D (1987) Ansätze zu einem integrierten Konzept der Fertigungssteuerung bei Werkstattfertigung. In: Adam D (Hrsg) Neuere Entwicklungen in der Produktions- und Investitionspolitik. Festschrift zum 60. Geburtstag von Herbert Jacob. Gabler, Wiesbaden, pp 17–52
[2]Adam D (1988) Die Eignung der belastungsorientierten Auftragsfreigabe fur die Steuerung von Fertigungsprozessen mit diskontinuierlichem Materialfluß. Z Betriebsw 58:98–115
[3]Adam N, Bertrand JWM, Surkis J (1984) Effective priority rules related to due date performance in multi-level assembly jobs. Paper presented at the TIMS XXVI meeting, Copenhagen, TB 11.1
[4]Adam N, Surkis J (1980) Priority update intervals and anomalies in dynamic ratio type job shop scheduling rules. Manag Sci 26:1227–1237 · Zbl 0447.90042 · doi:10.1287/mnsc.26.12.1227
[5]Aggarwal SC, McCarl BA (1974) The development and evaluation of a cost-based composite scheduling rule. Nav Res Log Q 21:155–169 · Zbl 0277.90043 · doi:10.1002/nav.3800210111
[6]Aggarwal SC, Wyman FP, McCarl BA (1973) An investigation of a cost-based rule for job-shop scheduling. Int J Prod Res 11:247–261 · doi:10.1080/00207547308929969
[7]Arumugam V, Ramani S (1980) Evaluation of value time sequencing rules in a real world job shop. J Op Res Soc 31: 895–904
[8]Baker CT, Dzielinsky BP (1960) Simulation of a simplified job shop. Manag Sci 6:311–323 · doi:10.1287/mnsc.6.3.311
[9]Baker KR (1968) Priority dispatching in the single channel queue with sequence-dependent setups. J Ind Eng:203–206
[10]Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
[11]Baker KR (1984) Sequencing rules and due-date assignments in a job shop. Manag Sci 30:1093–1104 · doi:10.1287/mnsc.30.9.1093
[12]Baker KR, Bertrand JWM (1981) An investigation of duedate assignment rules with constrained tightness. J Op Manag 1:109–120 · doi:10.1016/0272-6963(81)90014-0
[13]Baker KR, Bertrand JWM (1982) A dynamic priority rule for sequencing against due dates. J Op Manag 3:37–42 · doi:10.1016/0272-6963(82)90020-1
[14]Baker KR, Kanet JJ (1983) Job shop scheduling with modified due dates. J Op Manag 4:11–22 · doi:10.1016/0272-6963(83)90022-0
[15]Baker KR, Kanet JJ (1984) Improved decision rules in a combined system for minimizing job tardiness. Int J Prod Res 22:917–921 · doi:10.1080/00207548408942511
[16]Berg CC (1979) Prioritätsregeln in der Reihenfolgeplanung. In: Kern W (Hrsg) HWProd, Poeschel, Stuttgart, pp 1425–1433
[17]Berr U, Tangermann HP (1976) Einfluß von Prioritätsregeln auf die Kapazitätsterminierung der Werkstattfertigung. Wt-Z Ind Fertig 66:7–12
[18]Berry WL, Finley RA (1976) Critical ratio scheduling with queue waiting information: an experimental analysis. AIIE-Transact 8:161–168 · doi:10.1080/05695557608975063
[19]Berry WL, Rao V (1975) Critical ratio scheduling: an experimental analysis. Manag Sci 22:192–201 · doi:10.1287/mnsc.22.2.192
[20]Bertrand JWM (1983) The effect of workload dependent due-dates on job shop performance. Manag Sci 29:799–816 · doi:10.1287/mnsc.29.7.799
[21]Biendl P (1984) Ablaufsteuerung von Montagefertigungen. Haupt, Bern Stuttgart
[22]Biggs JR (1979) Heuristic lot-sizing and sequencing rules in a multistage production-inventory system. Dec Sci 10: 96–115 · doi:10.1111/j.1540-5915.1979.tb00010.x
[23]Biggs JR (1985) Priority rules for shop floor control in a material requirements planning system under various levels of capacity. Int J Prod Res 23:33–46 · doi:10.1080/00207548508904689
[24]Blackstone JH Jr, Phillips DT, Hogg GL (1982) A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int J Prod Res 20:27–45 · doi:10.1080/00207548208947745
[25]Brown RG (1968) Simulations to explore alternative sequencing rules. Nav Res Log Q 15:281–286
[26]Browne J, Davies BJ (1984) The design and validation of a digital simulation model for job shop control decision making. Int J Prod Res 22:335–357 · doi:10.1080/00207548408942458
[27]Bulkin MH, Colley JL, Steinhoff HW (1967) Load forecasting, priority sequencing, and simulation in a job shop control system. Manag Sci 13:B29-B51
[28]Bunnag P, Smith SB (1985) A multifactor priority rule for jobshop scheduling using computer search. IIE-Transact 17:141–146 · doi:10.1080/07408178508975284
[29]Buzi K (1971) Die Simulation optimaler Prioritätsregeln für die Ablaufplanung in der Werkstattfertigung. Westdeutscher Verlag, Köln Opladen
[30]Caroll DC (1965) Heuristic sequencing of single and multiple component jobs. PhD thesis, MIT, Cambridge/Mass
[31]Cheng TCE (1986) Optimal due-date assignment in a job shop. Int J Prod Res 24:503–515 · Zbl 0585.90048 · doi:10.1080/00207548608919746
[32]Colley JL Jr (1968) Principles for scheduling job shops. Syst Proced J 19, No 4
[33]Conway RW (1965) Priority dispatching and work-in-process inventory in a job shop. J Ind Eng 16:123–130
[34]Conway RW (1965) Priority dispatching and job lateness in a job shop. J Ind Eng 16:228–237
[35]Conway RW, Maxwell WL (1962) Network dispatching by the shortest operation discipline. Oper Res 10:51–73 · doi:10.1287/opre.10.1.51
[36]Conway RW, Maxwell WL, Miller LW (1967) Theory of scheduling. Addison-Wesley, Reading/Mass
[37]Conway RW, Maxwell WL, Oldziey JW (1966) Sequencing against due-dates. In: Hertz DB, Melèse J (eds) Proceedings of the Fourth International Conference on Operational Research. Wiley, New York, pp 599–617
[38]Day JE, Hottenstein MP (1970) Review of sequencing research. Nav Res Log Q 17:11–39 · Zbl 0202.18501 · doi:10.1002/nav.3800170103
[39]Deane RH, Moodie CL (1972) A dispatching methodology for balancing workload assignments in a job shop production facility. AIIE-Transact 4:277–283 · doi:10.1080/05695557208974863
[40]Dörken W (1973) Simulationsmodelle und ihre Anwendung bei der Analyse von Prioritätsregeln zur Maschinenbelegungsplanung. Arbeitsvorb 10:89–95, 115–122
[41]Dornia M (1976) Aufbau- und ablauforientierte Untersuchungen an einem Simulationsmodell der Mehrstellenbedienung. Dissertation, Köln
[42]Eilon S (1973) Research note: The job shop simulation programme. Int J Prod Res 11:299–300 · doi:10.1080/00207547308929973
[43]Eilon S (1979) Production scheduling. In: Haley KB (ed) OR ’78. North-Holland, Amsterdam, pp 237–266
[44]Eilon S, Chowdhury IG (1976) Due dates in job shop scheduling. Int J Prod Res 14:223–237 · doi:10.1080/00207547608956596
[45]Eilon S, Chowdhury IG, Serghiou SS (1975) Experiments with the SI rules in job-shop scheduling. Simulation 24: 45–48 · doi:10.1177/003754977502400202
[46]Eilon S, Cotterill DJ (1968) A modified SI rule in job shop scheduling. Int J Prod Res 7:135–145 · doi:10.1080/00207546808929803
[47]Eilon S, Hodgson RM (1967) Job shops scheduling with due dates. Int J Prod Res 6:1–13 · doi:10.1080/00207546708929764
[48]Ellinger T (1976) Reihenfolgeplanung. In: Grochla E, Wittmann W (eds) HWB 4. Aufl, Poeschel, Stuttgart, pp 3412–3420
[49]Ellinger T, Schmitz P, Goldbecker H, Haupt R, Oellers B (1978) Simulationssystem für Reihenfolgeprobleme der industriellen Fertigung. Rationalisierung 29:17–21, 43–45
[50]Elmaghraby SE (ed) (1973) Symposium on the theory of scheduling and its applications. Springer, Berlin Heidelberg New York
[51]Elvers DA (1973) Job shop dispatching using various due date setting criteria. Prod Inv Manag 14:62–69
[52]Elvers DA (1974) The sensitivity of the relative effectiveness ob job shop dispatching rules with respect to various arrival distributions. AIIE-Transact 6:41–49 · doi:10.1080/05695557408974931
[53]Elvers DA, Taube LR (1983) Deterministic/stochastic assumptions in job shops. Eu J Oper Res 14:89–94 · doi:10.1016/0377-2217(83)90293-X
[54]Elvers DA, Taube LR (1983) Time completion for various dispatching rules in job shops. Omega 11:81–89 · doi:10.1016/0305-0483(83)90087-7
[55]Fabrycky WJ, Shamblin JE (1966) A probability based sequencing algorithm. J Ind Eng 17:308–312
[56]Farn CK, Muhlemann AP (1979) The dynamic aspects of a production scheduling problem. Int J Prod Res 17:15–21 · doi:10.1080/00207547908919591
[57]Fischer H, Thompson GL (1963) Probabilistic learning combinations of local job shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial scheduling, Prentice-Hall, Englewood Cliffs, chap 15
[58]Fleischmann B (1987) Operations-Research-Modelle und -Verfahren in der Produktionsplanung (Übersichtsvortrag). In: Isermann H et al. (eds) Operations Research Proceedings 1986. Springer, Berlin Heidelberg New York, pp 278–285
[59]French S (1982) Sequencing and scheduling. An introduction to the mathematics of the job-shop. Horwood, Chichester
[60]Gere WS (1966) Heuristics in job shop scheduling. Manag Sci 13:167–190 · doi:10.1287/mnsc.13.3.167
[61]Goodwin JS, Goodwin JC Jr (1982) Operating policies for scheduling assembled products. Dec Sci 13:585–603
[62]Goodwin JS, Weeks JK (1986) Evaluating scheduling policies in a multi-level assembly system. Int J Prod Res 24:247–257 · doi:10.1080/00207548608919725
[63]O’Grady PJ, Harrison C (1985) A general search sequencing rule for job shop sequencing. Int J Prod Res 23:961–973 · Zbl 0569.90046 · doi:10.1080/00207548508904759
[64]Gräßler D (1968) Der Einfluß von Auftragsdaten und Entscheidungsregeln auf die Ablaufplanung von Fertigungsstraßen. Dissertation, TH Aachen
[65]Graves SC (1977) A note on ”Critical ratio scheduling: an experimental analysis” (Note). Manag Sci 23:1358–1359 · Zbl 0374.90030 · doi:10.1287/mnsc.23.12.1358
[66]Graves SC (1981) A review of production scheduling. Oper Res 29:646–675 · Zbl 0464.90034 · doi:10.1287/opre.29.4.646
[67]Green GI, Appel LB (1981) An empirical analysis of job shop dispatch rule selection. J Oper Manag 1:197–203 · doi:10.1016/0272-6963(81)90025-5
[68]Hauk W (1972) Beitrag zur Lösung des Reihenfolgeproblems bei der Auftragsplanung. Z Wirtsch Fert 67:45–49
[69]Hauk W (1973) Einplanung von Produktionsaufträgen nach Prioritätsregeln. Eine Untersuchung von Prioritätsregeln mit Hilfe der Simulation. Beuth, Berlin Köln Frankfurt
[70]Haupt R (1977) Reihenfolgeplanung im Sondermaschinenbau. Gabler, Wiesbaden
[71]Haupt R (1978) Simulationsuntersuchungen zur Reihenfolgeplanung unter dem Einfluß von Vereinheitlichungs-Elementen in der Produktion. In: Brockhoff K et al. (eds) Proceedings in Operations Research 7. Physica, Würzburg Wien, pp 247–256
[72]Haupt R (1987) Produktionstheorie und Ablaufmanagement. Zeitvariable Faktoreinsätze und ablaufbezogene Dispositionen in Produktionstheorie- und -planungs-Modellen. Poeschel, Stuttgart
[73]Hershauer JC, Ebert RJ (1975) Search and simulation selection of a job shop sequencing rule. Manag Sci 21:833–843 · Zbl 0304.90062 · doi:10.1287/mnsc.21.7.833
[74]Hoffmann TR, Scudder GD (1983) Priority scheduling with cost considerations. Int J Prod Res 21:881–889 · doi:10.1080/00207548308942420
[75]Hollier RH (1986) A simulation study of sequencing in batch production. Oper Res Q 19:389–407 · doi:10.1057/jors.1968.98
[76]Huang PY (1984) A comparative study of priority dispatching rules in a hybrid assembly job shop. Int J Prod Res 22:375–387 · doi:10.1080/00207548408942460
[77]Jackson JR (1957) Simulation research on job shop production. Nav Res Log Q 4:287–295 · doi:10.1002/nav.3800040404
[78]Jones CH (1973) An economic evaluation of job shop dispatching rules. Manag Sci 20:293–307 · doi:10.1287/mnsc.20.3.293
[79]Kanet JJ (1982) On anomalies in dynamic ratio type scheduling rules: a clarifying analysis. Manag Sci 28: 1337–1341 · Zbl 0503.90052 · doi:10.1287/mnsc.28.11.1337
[80]Kanet JJ, Hayya JC (1982) Priority dispatching with operation due-dates in a job shop. J Oper Manag 2:155–163 · doi:10.1016/0272-6963(82)90004-3
[81]Kettner H, Bechte W (1981) Neue Wege der Fertigungssteuerung durch belastungsorientierte Auftragsfreigabe. VDI-Z 123:459–465
[82]Knolmayer G, Holdhof J (1986) BORA versus DORA: Ein Vergleich zweier Terminplanungsverfahren. Arbeitsvorbereitung 23:163–165
[83]Le Grande E (1963) The development of a factory simulation system using actual operating data. Manag Tech 3: 1–19
[84]Maxwell WL (1969) Priority dispatching and assembly operations in a job shop. The RAND Corp Memorandum RM-5370-PR, Santa Monica/Cal
[85]Maxwell WL, Mehra M (1968) Multiple-factor rules for sequencing with assembly constraints. Nav Res Log Q 15:241–254
[86]Mellor P (1966) A review of job shop scheduling. Oper Res Q 17:161–171 · doi:10.1057/jors.1966.24
[87]Miller LW, Ginsberg AS, Maxwell WL (1975) An experimental investigation of priority dispatching in a simple assembly shop. In: Geisler MA (ed) Logistics, TIMS Studies in the Management Sciences, vol 1. North-Holland, Amsterdam, pp 125–142
[88]Miyazaki S (1981) Combined scheduling system for reducing job tardiness in a job shop. Int J Prod Res 19:201–211 · doi:10.1080/00207548108956642
[89]Moodie CL, Novotny DJ (1968) Computer scheduling and control systems for discrete part production. J Ind Eng 19:336–341
[90]Moodie CL, Roberts SD (1968) Experiments with priority dispatching rules in a parallel processor shop. Int J Prod Res 6:303–312 · doi:10.1080/00207546708929789
[91]Moore JM, Wilson RC (1967) A review of simulation research in job shop scheduling. Prod Inv Manag 8:1–10
[92]Mosier CT, Elvers DA, Kelly D (1984) Analysis of group technology scheduling heuristics. Int J Prod Red 22:857–875 · doi:10.1080/00207548408942505
[93]Müller A (1987) Produktionsplanung und Pufferbildung bei Werkstattfertigung. Gabler, Wiesbaden
[94]Müller G (1978) Job-Shop-Simulation auf dem Minicomputer: Ein Instrument zur Reihenfolge- und Terminplanung in der Textillohnveredelungsindustrie. Dissertation, Universität Zürich
[95]Müller-Merbach H (1979) Ablaufplanung, Optimierungsmodelle zur. In: Kern W (Hrsg) HWProd, Poeschel, Stuttgart, pp 38–52
[96]Muhlemann AP, Lockett AG, Farn CI (1982) Job shop scheduling heuristics and frequency of scheduling. Int J Prod Res 20:227–241 · doi:10.1080/00207548208947763
[97]Nanot YR (1963) An experimental investigation and comparative evaluation of priority disciplines in job shoplike queuing networks. Manag Sci Res Proj, UCLA, Report No 87-1963
[98]Nelson RT (1967) Labor and machine limited production systems. Manag Sci 13:648–671 · doi:10.1287/mnsc.13.9.648
[99]New CC (1975) Job shop scheduling: is manual application of dispatching rules feasible? Oper Res Q 21:35–43 · doi:10.1057/jors.1975.5
[100]Oral M, Malouin JL (1973) Evaluation of the shortest processing time scheduling rule with truncation process. AIIE-Transact 5:357–365 · doi:10.1080/05695557308974923
[101]Ow PS (1985) Focused scheduling in proportionate flowshops. Manag Sci 31:852–869 · Zbl 0609.90067 · doi:10.1287/mnsc.31.7.852
[102]Pabst HJ (1985) Analyse der betriebswirtschaftlichen Effizienz einer computergestützten Fertigungssteuerung mit CAPOSS-E in einem Maschinenbauunternehmen mit Einzel- und Kleinserienfertigung. Lang, Frankfurt Bern New York
[103]Pai AR, McRoberts KL (1971) Simulation research in interchangeable part manufacturing. Manag Sci 17:B732-B743 · doi:10.1287/mnsc.17.12.B732
[104]Panwalkar SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25:45–61 · Zbl 0369.90054 · doi:10.1287/opre.25.1.45
[105]Papendieck AJ (1971) Reihenfolgen und Losgroen in der Serienfertigung, untersucht an einem praxisbezogenen Simulationsmodell. Dissertation TH Braunschweig
[106]Paulik R (1984) Kostenorientierte Reihenfolgeplanung in der Werkstattfertigung. Haupt, Bern Stuttgart
[107]Pinto PA, Khumawala BM, Susko JA (1983) Application of a heuristic scheduling rule for a tyre testing department. J Opl Res Soc 34:243–248, 910
[108]Putnam AO, Everdell R, Dormann GH, Cronan RR, Lindgren LH (1971) Updating critical ratio and slack time priority scheduling rules. Prod Inv Manag 12:51–73
[109]Ragatz GL, Mabert VA (1984) A framework for the study of due date management in job shops. Int J Prod Res 22: 685–695 · doi:10.1080/00207548408942488
[110]Reiter S (1966) A system for managing job shop production. J Business 39:371–393 · doi:10.1086/294867
[111]Rinnooy Kan AHG (1976) Machine scheduling problems. Classification, complexity and computations. Nijhoff, Den Haag
[112]Rochette R, Sadowski RP (1976) A statistical comparison of the performance of simple dispatching rules for a particular set of job shop. Int J Prod Res 14:63–75 · doi:10.1080/00207547608956580
[113]Rowe AJ (1960) Toward a theory of scheduling. J Ind Eng 11:125–136
[114]Russell RS, Taylor BW (1985) An evaluation of scheduling policies in a dual resource constrained assembly shop. IIE-Transact 17:219–232 · doi:10.1080/07408178508975297
[115]Sägesser R (1976) Analytische und heuristische Methoden zur Lösung des Reihenfolgeproblems mit besonderer Berücksichtigung der Werkstattfertigung. Dissertation, Sankt Gallen
[116]Sammler A (1970) Diskussion von Vorrangregeln (Prioritäten) zur Lösung des Reihenfolgeproblems in der Planung und Lenkung der Einzelteilefertigung. Fertigungstechnik Betrieb 20:408–411
[117]Scudder GD (1984) Priority scheduling and spares stocking policies for a repair shop: the multiple failure case. Manag Sci 30:739–749 · doi:10.1287/mnsc.30.6.739
[118]Scudder GD (1986) Scheduling and labor-assignment policies for a dual-constrained repair shop. Int J Prod Res 24:623–634 · doi:10.1080/00207548608919755
[119]Scudder GD, Hoffmann TR (1985) An evaluation of value based dispatching rules in a flow shop. E J Oper Res 22: 310–318 · Zbl 0573.90049 · doi:10.1016/0377-2217(85)90250-4
[120]Scudder GD, Hoffmann TR (1985) Composite cost-based rules for priority scheduling in a randomly routed job shop. Int J Prod Res 23:1185–1195 · doi:10.1080/00207548508904775
[121]Sculli D (1980) Priority dispatching rules in job shops with assembly operations and random delays. Omega 8: 227–234 · doi:10.1016/0305-0483(80)90027-4
[122]Sen T, Gupta SK (1984) A state-of-art survey of static scheduling research involving due dates. Omega 12:63–76 · doi:10.1016/0305-0483(84)90011-2
[123]Siegel GB (1971) An investigation of job shop scheduling for jobs with assembly constraints. PhD Thesis, Cornell University, Ithaca/NY
[124]Sprotte HG (1970) Simultane Termin- und Reihenfolgeplanung bei Mehrproduktunternehmen mit Auftragsfertigung und stochastischem Auftragseingang. Dissertation, Universität Köln
[125]Stecke KE, Solberg JJ (1981) Loading and control policies for a flexible manufacturing system. Int J Prod Res 19: 481–490 · doi:10.1080/00207548108956679
[126]Subramanyam S, Askin RG (1986) An expert systems approach to scheduling in flexible manufacturing systems. In: Kusiak A (ed) Flexible manufacturing systems: Methods and Studies. North-Holland, Amsterdam, pp 243–256
[127]Tangermann HP (1973) Auftragsreihenfolgen und Losgrößen als Instrument der Fertigungsterminplanung, untersucht an einem praxisbezogenen Simulationsmodell. Dissertation, TH Braunschweig
[128]Trilling DR (1966) Job-shop simulation of orders that are networks. J Ind Eng 17:59–71
[129]Vepsalainen APJ, Morton TE (1987) Priority rules for job shops with weighted tardiness costs. Manag Sci 33:1035–1047 · doi:10.1287/mnsc.33.8.1035
[130]Weeks JK (1979) A simulation study of predictable duedates. Manag Sci 25:363–373 · Zbl 0409.90041 · doi:10.1287/mnsc.25.4.363
[131]Weeks JK, Fryer JS (1976) A simulation study of operating policies in a hypothetical dual-constrained job shop. Manag Sci 22:1362–1371 · Zbl 0328.90040 · doi:10.1287/mnsc.22.12.1362
[132]Weeks JK, Fryer JS (1977) A methodology for assigning minimum cost due-dates. Manag Sci 23:872–881 · doi:10.1287/mnsc.23.8.872
[133]Wegner N (1978) Simulation von Einplanungs- und Abfertigungsstrategien bei Werkstattfertigung. Dissertation, TU Hannover
[134]Wiendahl HP (1987) Die belastungsorientierte Fertigungssteuerung. Oldenbourg, München Wien
[135]Wiendahl HP, Buchmann W (1984) Realisierung alternativer Fertigungssteuerungsstrategien. VDI-Z 126:327–334
[136]Worrall BM, Mert B (1980) Application of dynamic scheduling rules in maintenance planning and scheduling. Int J Prod Res 18:57–74 · doi:10.1080/00207548008919649
[137]Zijm WHM (1988) Flexible Manufacturing Systems: background, examples, and models. In: Schellhaas H et al. (ed) Operations Research Proceedings 1987. Springer, Berlin Heidelberg New York, pp 142–161