On the set of solutions of the open shop problem

Author： Bräsel H. Harborth M. Tautenhahn T. Willenius P.

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.92, Iss.1, 1999-01, pp. : 241-263

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 note on the complexity of the concurrent open shop problem

By Roemer Thomas

Journal of Scheduling, Vol. 9, Iss. 4, 2006-08 ,pp. : 389-396

Springer Publishing Company

Access to resources Recommend Favorite

A new lower bound for the open-shop problem

By Guéret C. Prins C.

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 165-183

Springer Publishing Company

Access to resources Recommend Favorite

Solutions and Open Challenges for the Symbol Grounding Problem

International Journal of Signs and Semiotic Systems (IJSSS), Vol. 1, Iss. 1, 2011-01 ,pp. : 49-54

IGI Global_journal

Access to resources Recommend Favorite

Solving the no-wait flow-shop problem with sequence-dependent set-up times

International Journal of Computer Integrated Manufacturing, Vol. 27, Iss. 3, 2014-03 ,pp. : 213-228

Taylor & Francis Ltd

Access to resources Recommend Favorite

Fast parallel bio-molecular solutions: the set-basis problem

By Chang Weng-Long Ho Michael Guo Minyi Liu Chengfei

International Journal of Computational Science and Engineering, Vol. 2, Iss. 1-2, 2006-06 ,pp. : 72-80

Inderscience Publishers

Access to resources Recommend Favorite