Université de Fribourg

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....

Consortium of Swiss Academic Libraries

The flexible blocking job shop with transfer and set-up times

Gröflin, Heinz ; Pham, Dinh ; Bürgy, Reinhard

In: Journal of Combinatorial Optimization, 2011, vol. 22, no. 2, p. 121-144

Consortium of Swiss Academic Libraries

Optimal job insertion in the no-wait job shop

Bürgy, Reinhard ; Gröflin, Heinz

In: Journal of Combinatorial Optimization, 2013, vol. 26, no. 2, p. 345-371

Université de Fribourg

The no-wait job shop with regular objective : a method based on optimal job insertion

Gröflin, Heinz ; Bürgy, Reinhard

(Internal working papers DIUF ; 15-02)

The no-wait job shop problem (NWJS-R) considered here is a version of the job shop scheduling problem where, for any two operations of a job, a fixed time lag between their starting times is prescribed. Also, sequence-dependent set-up times between consecutive operations on a machine can be present. The problem consists in finding a schedule that minimizes a general regular objective function. We...