Joseph Y. Leung
Affiliations: | New Jersey Institute of Technology, Newark, NJ, United States |
Area:
Computer ScienceGoogle:
"Joseph Leung"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Li K, Zhang X, Leung JY, et al. (2017) Integrated production and delivery withmultiple factories and multiple customers International Journal of Systems Science: Operations & Logistics. 4: 219-228 |
Chen R, Liang C, Gu D, et al. (2017) A multi-objective model for multi-project scheduling and multi-skilled staff assignment for IT product development considering competency evolution International Journal of Production Research. 55: 6207-6234 |
Wu Q, Leung JY, Yuan X, et al. (2015) Biological risk, source and pollution history of organochlorine pesticides (OCPs) in the sediment in Nansha mangrove, South China. Marine Pollution Bulletin. 96: 57-64 |
Wu Q, Leung JY, Geng X, et al. (2015) Heavy metal contamination of soil and water in the vicinity of an abandoned e-waste recycling site: implications for dissemination of heavy metals. The Science of the Total Environment. 506: 217-25 |
Lee K, Choi B, Leung JY, et al. (2012) Minimizing the total weighted delivery time in container transportation scheduling Naval Research Logistics. 59: 266-277 |
Briskorn D, Leung J, Pinedo M. (2011) Robust scheduling on a single machine using time buffers Iie Transactions. 43: 383-398 |
Krasik V, Leung J, Pinedo M, et al. (2008) Scheduling multiple products on parallel machines with setup costs Naval Research Logistics. 55: 654-669 |
Lee C, Leung JY, Yu G. (2006) Two Machine Scheduling under Disruptions with Transportation Considerations Journal of Scheduling. 9: 35-48 |
Leung JY, Li H, Pinedo M. (2006) Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel Naval Research Logistics. 53: 243-260 |
Leung JY, Zhao H. (2005) Minimizing mean flowtime and makespan on master--slave systems Journal of Parallel and Distributed Computing. 65: 843-856 |