On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

Author： Ng C.T.   Cheng T.C.E.   Yuan J.J.   Liu Z.H.  

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.31, Iss.4, 2003-07, pp. : 323-326

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

Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan

By Li Shisheng   Yuan Jinjiang  

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 84-93

Springer Publishing Company

Access to resources Recommend Favorite

An optimal online algorithm for single machine scheduling to minimize total general completion time

By Liu Ming  

Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. : 189-195

Springer Publishing Company

Access to resources Recommend Favorite

The single machine ready time scheduling problem with fuzzy processing times

By Wang  

Fuzzy Sets and Systems, Vol. 127, Iss. 2, 2002-04 ,pp. : 117-129

Elsevier

Access to resources Recommend Favorite

Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine

By Hoogeveen H.   van de Velde S.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 273-289

Elsevier

Access to resources Recommend Favorite

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

By Batsyn Mikhail   Goldengorin Boris   Pardalos Panos M.   Sukhov Pavel  

Optimization Methods and Software, Vol. 29, Iss. 5, 2014-09 ,pp. : 955-963

Taylor & Francis Ltd

Access to resources Recommend Favorite