Jan Weglarz

Solving Discrete-Continuous Scheduling Problems (2002)

Joanna Jozefowska, Rafal Rozycki, Grzegorz Waligora, Jan Weglarz

this paper we consider discrete-continuous scheduling problems defined in [7], where general results and methodology have been presented as well. These problems are characterized by the fact that...

Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems (1990)

Patterson, James H., Brian Talbot, F., Slowinski, Roman, Weglarz, Jan

In this paper computational results are presented with a very general, yet powerful backtracking procedure for solving the duration minimization and net present value maximization problems in a...