References
- AllahverdiANgCTChengTCEKovalyovMYA survey of scheduling problems with setup times or costsEur J Opl Res2008187985103210.1016/j.ejor.2006.06.060
- AverbakhIBermanOChernykhIA 6/5 approximation algorithm for the two machine routing open-shop problem on a two-node networkEur J Opl Res200516632410.1016/j.ejor.2003.06.050
- BlazewiczJKovalyovMYThe complexity of two group scheduling problemsJ Sched2002547748510.1002/jos.118
- BukchinJTzurMJaffeMLot splitting to minimize average flow-time in a two-machine flow-shopIIE Trans200234953970
- ChenJSteinerGLot streaming with detached setups in three-machine flow shopsEur J Opl Res19969659161110.1016/S0377-2217(96)00091-4
- ChenJSteinerGApproximation methods for discrete lot streaming in flow shopsOpns Res Lett19982113914510.1016/S0167-6377(97)00039-4
- GlassCAShafranskyYMStrusevichVAScheduling for parallel dedicated machines with single serverNav Res Log20004730410.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1
- GlassCAPottsCNStrusevichVAScheduling batches with sequential job processing for two-machine flow and open-shopsINFORMS J Comput20011312013710.1287/ijoc.13.2.120.10521
- KleinauUTwo-machine shop scheduling problems with batch processingMath Comput Model199317556610.1016/0895-7177(93)90196-6
- MosheiovGOronDOpen shop batch scheduling with identical jobsEur J Opl Res20081871282129210.1016/j.ejor.2006.03.068
- PottsCNKovalyovMYScheduling with batching: A reviewEur J Opl Res200012022824910.1016/S0377-2217(99)00153-8
- StrusevichVAGroup technology approach to the open shop scheduling problem with batch setup timesOpns Res Lett20002618119210.1016/S0167-6377(00)00021-3