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

Author： Khan B. Shahul Hamid Prabhaharan G. Asokan P.

ISSN： 0020-7160

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

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 local search using solution fragments for the 2-machine bicriteria scheduling problem

By Huang Gaofeng Lim Andrew Rodrigues Brian

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

Springer Publishing Company

Access to resources Recommend Favorite

Two-dedicated-machine scheduling problem with precedence relations to minimize makespan

By Gafarov Evgeny Dolgui Alexandre

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1443-1451

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

Bicriteria scheduling on parallel machines: total tardiness and weighted flowtime in fuzzy environment

By Sharma Sameer

International Journal of Mathematics in Operational Research, Vol. 5, Iss. 4, 2013-06 ,pp. : 492-507

Inderscience Publishers

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