Open access peer-reviewed chapter

Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs

By H.L. Huang and B.M.T. Lin

Published: December 1st 2007

DOI: 10.5772/5223

Downloaded: 2194

© 2007 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike-3.0 License, which permits use, distribution and reproduction for non-commercial purposes, provided the original is properly cited and derivative works building on this content are distributed under the same license.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

H.L. Huang and B.M.T. Lin (December 1st 2007). Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs, Multiprocessor Scheduling, Theory and Applications, Eugene Levner, IntechOpen, DOI: 10.5772/5223. Available from:

chapter statistics

2194total chapter downloads

1Crossref citations

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Integral Approaches to Integrated Scheduling

By Ghada A. El Khayat

Related Book

Frontiers in Guided Wave Optics and Optoelectronics

Edited by Bishnu Pal

First chapter

Frontiers in Guided Wave Optics and Optoelectronics

By Bishnu Pal

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More About Us