Asymptotic optimality of shortest processing time-based algorithms for flow shop and open shop problems with nonlinear objective functions

Author： Bai Danyu   Zhang Zhihai  

Publisher： Taylor & Francis Ltd

ISSN： 0305-215X

Source： Engineering Optimization, Vol.46, Iss.12, 2014-12, pp. : 1709-1728

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

Related content

Efficiency of reductions of job-shop to flow-shop problems

By Guinet A.  

European Journal of Operational Research, Vol. 125, Iss. 3, 2000-09 ,pp. : 469-485

Elsevier

Access to resources Recommend Favorite

Reduction of job-shop problems to flow-shop problems with precedence constraints

By Guinet A.   Legrand M.  

European Journal of Operational Research, Vol. 109, Iss. 1, 1998-08 ,pp. : 96-110

Elsevier

Access to resources Recommend Favorite

Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms

By Sakawa M.   Kubota R.  

European Journal of Operational Research, Vol. 120, Iss. 2, 2000-01 ,pp. : 393-407

Elsevier

Access to resources Recommend Favorite

Minimizing functions of infeasibilities in a two-machine flow shop

By Lushchakova I.N.  

European Journal of Operational Research, Vol. 121, Iss. 2, 2000-03 ,pp. : 380-393

Elsevier

Access to resources Recommend Favorite

Study on Multi-Objective Optimization of Hybrid Flow Shop Scheduling Problem

By  

Advanced Materials Research, Vol. 2014, Iss. 1082, 2015-02 ,pp. : 529-534

Trans Tech Publications

Access to resources Recommend Favorite