The complexity of makespan minimization for pipeline transportation

Author： Milidiu R.L. Pessoa A.A. Laber E.S.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 339-351

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

A sequencing algorithm for makespan minimization in FMS

By Choi Shiu-Hong Lee James Siu-Lung

Journal of Manufacturing Technology Management, Vol. 15, Iss. 3, 2004-03 ,pp. : 291-297

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Makespan minimization in online scheduling with machine eligibility

By Lee Kangbok

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

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 GRASP approach for makespan minimization on parallel batch processing machines

By Damodaran Purushothaman

Journal of Intelligent Manufacturing, Vol. 22, Iss. 5, 2011-10 ,pp. : 767-777

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