Refine my results

A Neighborhood for Complex Job Shop Scheduling Problems with Regular Objectives

Bürgy, Reinhard

In: Journal of Scheduling, 2017, vol. 20, p. 391-422

Due to the limited applicability in practice of the classical job shop scheduling problem, many researchers have addressed more complex versions of this problem by including additional process features, such as time lags, setup times, and buffer limitations, and have pursued objectives that are more practically relevant than the makespan, such as total flow time and total weighted tardiness....