The real-time dynamic heuristic scheduling for complex production planning

As product development grow in complexity and size finding realizable schedules which efficiently exploit scarce resources is a challenging task in complex production planning. In this paper, a heuristic method for the real-time dynamic resource-constrained scheduling problem was proposed, in which the task priority was calculated by the users´ identity, reputation, urgency and dependency of activity in the process. The scheduler dynamically adjusts the priorities of concurrent activities. Finally, a case proves that such a kind of scheduling method is feasible and effective.