计算机科学
调度(生产过程)
运筹学
数学优化
数学
作者
Stanisław Gawiejnowicz
标识
DOI:10.1016/j.ejor.2025.05.024
摘要
Solution and proof methods are the basic tools in theory and methodology of scheduling. In this paper, we analyze which of these tools are used in time-dependent scheduling research, and compare them with their counterparts in classical scheduling. Based on this analysis, we show various relations between the considered problems, and indicate possible directions of future development of time-dependent scheduling and research methods applied in this domain.
科研通智能强力驱动
Strongly Powered by AbleSci AI