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

Author： Montemanni Roberto

Publisher： Springer Publishing Company

ISSN： 1570-1166

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

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

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

Deleting Outliers in Robust Regression with Mixed Integer Programming

By Zioutas Georgios Avramidis Antonios

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 2, 2005-05 ,pp. : 323-334

Springer Publishing Company

Access to resources Recommend Favorite

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

By Ng C.T. Cheng T.C.E. Yuan J.J. Liu Z.H.

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

Elsevier

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

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