Makespan minimization in online scheduling with machine eligibility

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.204, Iss.1, 2013-04, pp. : 189-222

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

Minimizing Makespan in Batch Machine Scheduling

By Poon Chung Keung Zhang Pixing

Algorithmica, Vol. 39, Iss. 2, 2004-02 ,pp. : 155-174

Springer Publishing Company

Access to resources Recommend Favorite

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

By Dereniowski Dariusz Kubiak Wiesław

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 479-492

Springer Publishing Company

Access to resources Recommend Favorite

A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization

By Chakravarthy K. Rajendran C.

Production Planning and Control, Vol. 10, Iss. 7, 1999-10 ,pp. : 707-714

Taylor & Francis Ltd

Access to resources Recommend Favorite

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

By Yuan Jinjiang

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 361-369

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling jobs with equal processing times subject to machine eligibility constraints

By Lee Kangbok

Journal of Scheduling, Vol. 14, Iss. 1, 2011-02 ,pp. : 27-38

Springer Publishing Company

Access to resources Recommend Favorite