Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.108, Iss.1-4, 2001-11, pp. : 55-74

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

Optimal Compile-Time Multiprocessor Scheduling Based on the O-1 Linear Programming Algorithm with the Branch and Bound Technique

By Piriyakumar D.A.L. Murthy C.S.R.

Journal of Parallel and Distributed Computing, Vol. 35, Iss. 2, 1996-06 ,pp. : 199-204

Academic Press

Access to resources Recommend Favorite

A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

By Xu Kailiang

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 303-324

Springer Publishing Company

Access to resources Recommend Favorite

A scatter search algorithm for project scheduling under partially renewable resources

By Alvarez-Valdes R. Crespo E. Tamarit J. Villa F.

Journal of Heuristics, Vol. 12, Iss. 1-2, 2006-03 ,pp. : 95-113

Springer Publishing Company

Access to resources Recommend Favorite

Fuzzy branch-and-bound algorithm for flow shop scheduling: Intelligent Manufacturing Systems: Vision for the Future (Guest Editors: Ercan Öztemel, Cemalettin Kubat and Harun Taşkin)

By Temİz İzzettİn Erol Serpİl

Journal of Intelligent Manufacturing, Vol. 15, Iss. 4, 2004-08 ,pp. : 449-454

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila Hadjiconstantinou Eleni Christofides Nicos

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite