השוואת שיטות

	איזון פס ייצור	תזמון מפעל ייצור
תחום	ניהול תפעול	ניהול תפעול
משפחה	Machine learning	Machine learning
שנת המקור	2010	2016
הוגה השיטה	Scholl, A.	Pinedo, M. L.
סוג	Optimization problem	Combinatorial scheduling problem
מקור מכונן	Scholl, A. (2010). Balancing and sequencing of assembly lines. Physica-Verlag.	Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems (5th ed.). Cham: Springer.
כינויים	line balancing, workload balancing	job scheduling, machine scheduling
קשורות	5	5
תקציר	Assembly Line Balancing is the problem of distributing a sequence of assembly tasks across a series of workstations on a production line such that work is evenly distributed, idle time is minimized, and throughput constraints are satisfied. The goal is to assign tasks to stations such that the total work time at each station is as equal as possible, optimizing for production rate (cycle time) and resource utilization. This is a classic optimization problem in manufacturing, solved through heuristic and exact algorithms, essential to the efficiency of mass production systems.	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.