A local search using solution fragments for the 2-machine bicriteria scheduling problem

Author： Huang Gaofeng Lim Andrew Rodrigues Brian

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.37, Iss.2, 2007-06, pp. : 219-229

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

A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

By Khan B. Shahul Hamid Prabhaharan G. Asokan P.

International Journal of Computer Mathematics, Vol. 84, Iss. 12, 2007-12 ,pp. : 1731-1741

Taylor & Francis Ltd

Access to resources Recommend Favorite

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

Naval Research Logistics: An International Journal, Vol. 61, Iss. 4, 2014-06 ,pp. : 269-285

John Wiley & Sons Inc

Access to resources Recommend Favorite

Phased local search for the maximum clique problem

By Pullan Wayne

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 303-323

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

A GRASP based on DE to solve single machine scheduling problem with SDST

By Akrout Hanen

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 411-435

Springer Publishing Company

Access to resources Recommend Favorite