An Improved Algorithm for a Bicriteria Batching Scheduling Problem∗

Author： He Cheng   Wang Xiumei   Lin Yixun   Mu Yundong  

Publisher： Edp Sciences

E-ISSN： 1290-3868|47|1|1-8

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.47, Iss.1, 2013-02, pp. : 1-8

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

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem∗

By Wuliang Peng   Min Huang   Yongping Hao  

RAIRO - Operations Research, Vol. 48, Iss. 4, 2014-07 ,pp. : 595-614

Edp Sciences

Access to resources Recommend Favorite

A branch-and-cut algorithm for a resource-constrained scheduling problem

By Sirdey Renaud   Kerivin Hervé L. M.  

RAIRO - Operations Research, Vol. 41, Iss. 3, 2007-08 ,pp. : 235-251

Edp Sciences

Access to resources Recommend Favorite

On Minimizing Total Tardiness in a Serial Batching Problem

By Baptiste Philippe   Jouglet Antoine  

RAIRO - Operations Research, Vol. 35, Iss. 1, 2010-03 ,pp. : 107-115

Edp Sciences

Access to resources Recommend Favorite

An improved binary search algorithm for the Multiple-Choice Knapsack Problem∗

By He Cheng   Leung Joseph Y-T.   Lee Kangbok   Pinedo Michael L.  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 995-1001

Edp Sciences

Access to resources Recommend Favorite

Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm

By  

MATEC Web of conference, Vol. 22, Iss. issue, 2015-07 ,pp. : 03022-03022

Edp Sciences

Access to resources Recommend Favorite