Approximation algorithms for two-machine flow shop scheduling with batch setup times

By Chen B.   Potts C.N.   Strusevich V.A.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 255-271

Elsevier

Access to resources Recommend Favorite

Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints

By Gladky A.A.   Shafransky Y.M.   Strusevich V.A.  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 13-28

Springer Publishing Company

Access to resources Recommend Favorite

On equivalence between the proportionate flow shop and single‐machine scheduling problems

By  

Naval Research Logistics: An International Journal, Vol. 62, Iss. 7, 2015-10 ,pp. : 595-603

John Wiley & Sons Inc

Access to resources Recommend Favorite

A dynamic edge covering and scheduling problem: complexity results and approximation algorithms

By Qiu Jiaming   Sharkey Thomas  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1201-1212

Springer Publishing Company

Access to resources Recommend Favorite

A note on the complexity of the problem of two-agent scheduling on a single machine

By Ng C.   Cheng T.   Yuan J.  

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 387-394

Springer Publishing Company

Access to resources Recommend Favorite