On minimizing the weighted number of late jobs in unit execution time open-shops |
| |
| Institution: | 1. Technical University of Denmark, The Danish Hydrocarbon Research and Technology Centre, Elektrovej, Building 375, 2800 Kgs. Lyngby, Denmark;2. Aarhus University, Dept. of Civil Engineering, Inge Lehmanns Gade 10, 8000 Aarhus C, Denmark;3. Technical University of Denmark, Dept. of Civil Engineering, Brovej, Building 118, 2800 Kgs. Lyngby, Denmark;1. Department of Biological Sciences, CW 405 Biological Sciences Building, University of Alberta, Edmonton, AB T6G 2E9, Canada;2. Department of Earth and Atmospheric Sciences, 1-26 Earth Sciences Building, University of Alberta, Edmonton, AB T6G 2E3, Canada;3. Institute of Paleontology and Geology, Mongolian Academy of Sciences, Box-46/650, Ulaanbaatar 15160, Mongolia;1. Systems Research Institute, Polish Academy of Sciences, Newelska 6, Warsaw 01-447, Poland;2. The International University of Logistics and Transport in Wrocław, Sołtysowicka St. 19B, Wrocław 51-168, Poland;1. Marketing Department, School of Business Administration, The University of Mississippi, University, MS, 38677, USA;2. Department of Logistics and Operations Management, The University of Missouri, St. Louis, MO, 63121, USA;3. Sanchez School of Business, Texas A&M International University, Laredo, TX, 78041, USA;4. Professor of Management Science, The University of Missouri, St. Louis, MO, 63121, USA |
| |
| Abstract: | We study unit execution time open-shops with integer release dates. This paper shows that, in this environment, the minimum weighted number of late jobs can be computed in polynomial time by dynamic programming. The complexity status of the corresponding problem Om|pij=1,ri|∑wiUi was unknown before. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
