Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.21, Iss.2, 1996-09, pp. : 415-433

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

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

On equivalence between the proportionate flow shop and single‐machine scheduling problems

Naval Research Logistics: An International Journal, Vol. 62, Iss. 7, 2015-10 ,pp. : 595-603

John Wiley & Sons Inc

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

Scheduling with machine cost and rejection

By Dósa György He Yong

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 337-350

Springer Publishing Company

Access to resources Recommend Favorite

A note on the complexity of the problem of two-agent scheduling on a single machine

By Ng C. Cheng T. Yuan J.

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 387-394

Springer Publishing Company

Access to resources Recommend Favorite