This paper examines the problem of scheduling jobs on a single machine with set-up times. The jobs are divided into mutually exclusive classes and a set-up task is required when processing switches ...
The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the ...
Heuser, Patricia; Letmathe, Peter; Vossen, Thomas. European Journal of Operational Research. Mar2025, Vol. 321 Issue 3, p697-716. Skill development in the field of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback