Minimizing the mean flow time in a two-machine group-scheduling problem with carryover sequence dependency

Author： Logendran R. Gelogullari C.A. Sriskandarajah C.

Publisher： Elsevier

ISSN： 0736-5845

Source： Robotics and Computer-Integrated Manufacturing, Vol.19, Iss.1, 2003-02, pp. : 21-33

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

Approximation algorithms for two-machine flow shop scheduling with batch setup times

By Chen B. Potts C.N. Strusevich V.A.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 255-271

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

A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data

By Montemanni Roberto

Journal of Mathematical Modelling and Algorithms, Vol. 6, Iss. 2, 2007-06 ,pp. : 287-296

Springer Publishing Company

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

Approximability of two-machine no-wait flowshop scheduling with availability constraints

By Cheng T.C.E. Liu Z.

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 319-322

Elsevier

Access to resources Recommend Favorite