SchedulingProblemen
SchedulingProblemen is a term used in some German-language sources to denote scheduling problems in operations research. Scheduling problems are optimization problems that determine the start times of a collection of jobs subject to resource constraints, with the aim of improving objectives such as makespan, total completion time, or lateness. The typical data include processing times, machines or servers, release dates, due dates, and sometimes precedence relations among jobs. Constraints may reflect machine capacities, setup times, and maintenance windows.
Common variants include single-machine scheduling, parallel-machine scheduling (identical or uniform machines), flow shop problems (jobs passing
Many scheduling problems are computationally hard. Even simple variants are often NP-hard; nevertheless, some special cases
Solving approaches range from exact methods (integer programming, branch-and-bound) to heuristics (priority rules, greedy constructive methods)