ScholarGate
Asistents

Salīdzināt metodes

Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.

Izkārtojuma plānošana (SLP)×Darbu grafiku plānošana ražošanas uzņēmumos×
NozareOperāciju vadībaOperāciju vadība
SaimeMachine learningMachine learning
Izcelsmes gads19732016
AutorsMuther, R.Pinedo, M. L.
TipsLayout design methodologyCombinatorial scheduling problem
PirmavotsMuther, R. (1973). Systematic layout planning (2nd ed.). Boston: Cahners Books. link ↗Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems (5th ed.). Cham: Springer. DOI ↗
Citi nosaukumiSLP, plant layoutjob scheduling, machine scheduling
Saistītās55
KopsavilkumsSystematic Layout Planning (SLP) is a structured methodology developed by Richard Muther in the 1960s–1970s for designing optimal plant and facility layouts. The approach systematizes the consideration of material flow, personnel movement, equipment relationships, and space constraints to minimize material handling costs, improve safety, and enhance flexibility. SLP has become the foundational framework for facility design in manufacturing, warehousing, and service environments.Job shop scheduling is the problem of assigning a set of jobs (tasks) to a set of machines (resources) over time, subject to precedence and capacity constraints, with the goal of optimizing performance metrics such as makespan (total completion time), lateness, or cost. The job shop problem is a classic combinatorial optimization problem in operations research, addressed through heuristics (greedy dispatching rules, simulated annealing, genetic algorithms) and exact algorithms (branch-and-bound, constraint programming). It is fundamental to manufacturing, project management, and computational scheduling.
ScholarGateDatu kopa
  1. v1
  2. 2 Avoti
  3. PUBLISHED
  1. v1
  2. 2 Avoti
  3. PUBLISHED

Doties uz meklēšanu Lejupielādēt slaidus

ScholarGateSalīdzināt metodes: Facility Layout (SLP) · Job Shop Scheduling. Izgūts 2026-06-18 no https://scholargate.app/lv/compare