A note on the complexity of the concurrent open shop problem

ISSN： 1094-6136

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

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

On the set of solutions of the open shop problem

By Bräsel H. Harborth M. Tautenhahn T. Willenius P.

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

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

SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM

By Zobolas G. I. Tarantilis C. D. Ioannou G.

Cybernetics and Systems, Vol. 40, Iss. 4, 2009-05 ,pp. : 259-285

Taylor & Francis Ltd

Access to resources Recommend Favorite

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Brucker Peter

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 81-106

Springer Publishing Company

Access to resources Recommend Favorite

A Note on Permutation Flow Shop Problem: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Sviridenko M.I.

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 247-252

Springer Publishing Company

Access to resources Recommend Favorite