In: Journal of Combinatorial Optimization, 2013, vol. 26, no. 2, p. 345-371
|
In: Journal of Combinatorial Optimization, 2011, vol. 22, no. 2, p. 121-144
|
(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...
|
