A new approach to two-machine flow shop problem with uncertain processing times

Author： Petrovic Sanja   Song Xueyan  

Publisher： Springer Publishing Company

ISSN： 1389-4420

Source： Optimization and Engineering, Vol.7, Iss.3, 2006-09, pp. : 329-342

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times

By Shabtay Dvir  

IIE Transactions, Vol. 39, Iss. 5, 2007-05 ,pp. : 539-557

Taylor & Francis Ltd

Access to resources Recommend Favorite

A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem

By Liou Cheng-Dar   Hsieh Yi-Chih   Chen Yin-Yann  

International Journal of Systems Science, Vol. 44, Iss. 1, 2013-01 ,pp. : 77-93

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling problem in a two-machine flow line with the N-step prior-job-dependent set-up times

By Sun Ji Ung   Hwang Hark  

International Journal of Systems Science, Vol. 32, Iss. 3, 2001-03 ,pp. : 375-385

Taylor & Francis Ltd

Access to resources Recommend Favorite

Minimizing the total flow time and the tardiness in a two-machine flow shop

By Lee Wen-Chiung   Wu Chin-Chia  

International Journal of Systems Science, Vol. 32, Iss. 3, 2001-03 ,pp. : 365-373

Taylor & Francis Ltd

Access to resources Recommend Favorite

Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling

By Chen J.-S.   Pan J. C.-H.  

International Journal of Systems Science, Vol. 36, Iss. 12, 2005-10 ,pp. : 757-766

Taylor & Francis Ltd

Access to resources Recommend Favorite