« Forschungslandschaft: Projekte

In traditional scheduling research, machines are supposed to be only able to process one job at a time. However, in several real-world situations, machines can process several jobs in parallel up to a given capacity. One example is the growing of crops in greenhouses. The arising capacitated scheduling problems form a generalization of well-studied scheduling problems and have rarely been studied in the literature. We analyze the characteristics of these problems in various settings, such as flow shop or job shop. Tailored algorithms are developed to solve realistic problem instances considering multiple objectives.