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

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

On-line and semi-online scheduling for flow shop problems on two machines

By Yang Ming   Lu Xiwen  

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 499-507

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximability of flow shop scheduling

By Hall L.A.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 175-190

Elsevier

Access to resources Recommend Favorite

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

By Ng C.T.   Cheng T.C.E.   Yuan J.J.   Liu Z.H.  

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 323-326

Elsevier

Access to resources Recommend Favorite