Publisher
Springer International Publishing
Reference19 articles.
1. I. Adiri, N. Aizikowitz (Hefetz), Open-shop scheduling problems with dominated machines. Naval Res. Logist. 36, 273–281 (1989)
2. E.G. Coffman Jr., J. Csirik, G. Galambos, S. Martello, D. Vigo, Bin Packing Approximation Algorithms: Survey and Classification, in eds. by P. Pardalos, D.Z. Du, R. Graham, Handbook of Combinatorial Optimization (Springer, New York, 2013), pp. 455–531
3. I.G. Drobouchevitch, Three-machine open shop with a bottleneck machine revisited. J. Schedul. 24, 197–208 (2021)
4. I.G. Drobouchevitch, V.A. Strusevich, A polynomial algorithm for the three-machine open shop with bottleneck machine. Ann. Oper. Res. 92, 185–210 (1999)
5. M. Dror, Openshop scheduling with machine dependent processing times. Discrete Appl. Math. 39, 197–205 (1992)