default search action
Chung-Yee Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j70]Shuaian Wang
, Dan Zhuge
Liner Shipping Service Planning Under Sulfur Emission Regulations. Transp. Sci. 55(2): 491-509 (2021) - 2020
- [j69]Tao Lu
Shipping to Heterogeneous Customers with Competing Carriers. Manuf. Serv. Oper. Manag. 22(4): 850-867 (2020) - [j68]Tao Lu
Coordinating Pricing and Empty Container Repositioning in Two-Depot Shipping Systems. Transp. Sci. 54(6): 1697-1713 (2020)
2010 – 2019
- 2019
- [j67]Ruina Yang
A carrier-shipper contract under asymmetric information in the ocean transport industry. Ann. Oper. Res. 273(1-2): 377-408 (2019) - 2018
- [j66]Zhou Xu
New Lower Bound and Exact Method for the Continuous Berth Allocation Problem. Oper. Res. 66(3): 778-798 (2018) - [j65]Zizhen Zhang
The Quay Crane Scheduling Problem With Stability Constraints. IEEE Trans Autom. Sci. Eng. 15(3): 1399-1412 (2018) - 2017
- [j64]Tao Lu
Carrier Portfolio Management for Shipping Seasonal Products. Oper. Res. 65(5): 1250-1266 (2017) - 2016
- [j63]Qingxia Kong
Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal. Eur. J. Oper. Res. 255(3): 809-821 (2016) - [j62]Zizhen Zhang, Chung-Yee Lee:
Multiobjective Approaches for the Ship Stowage Planning Problem Considering Ship Stability and Container Rehandles. IEEE Trans. Syst. Man Cybern. Syst. 46(10): 1374-1389 (2016) - 2015
- [j61]Chen Li, Xiangtong Qi
Disruption Recovery for a Vessel in Liner Shipping. Transp. Sci. 49(4): 900-921 (2015) - [j60]Chung-Yee Lee, Ming Liu, Chengbin Chu:
Optimal Algorithm for the General Quay Crane Double-Cycling Problem. Transp. Sci. 49(4): 957-967 (2015) - 2013
- [j59]Chung-Yee Lee, Ruina Yang:
Compensation plan for competing salespersons under asymmetric information. Eur. J. Oper. Res. 227(3): 570-580 (2013) - [j58]Qingxia Kong
Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones. Oper. Res. 61(3): 711-726 (2013) - [j57]Chung-Yee Lee, Xi Li:
Economic lot sizing: The capacity reservation model. Oper. Res. Lett. 41(6): 670-674 (2013) - 2011
- [j56]Saif Benjaafar, Mohsen ElHafsi, Chung-Yee Lee, Weihua Zhou:
Technical Note - Optimal Control of an Assembly System with Multiple Stages and Multiple Demand Classes. Oper. Res. 59(2): 522-529 (2011) - 2010
- [j55]H.-C. Hwang, Wikrom Jaruphongsa, Sila Çetinkaya, Chung-Yee Lee:
Capacitated dynamic lot-sizing problem with delivery/production time windows. Oper. Res. Lett. 38(5): 408-413 (2010) - [j54]Jinwen Ou, Xiangtong Qi
Parallel machine scheduling with multiple unloading servers. J. Sched. 13(3): 213-226 (2010)
2000 – 2009
- 2009
- [j53]Feng Chen, Chung-Yee Lee:
Minimizing the makespan in a two-machine cross-docking flow shop problem. Eur. J. Oper. Res. 193(1): 59-72 (2009) - [j52]Sean X. Zhou
Optimal transportation policies for production/inventory systems with an unreliable and a reliable carrier. J. Glob. Optim. 44(2): 251-271 (2009) - [j51]Ke Fu, Vernon Ning Hsu, Chung-Yee Lee:
Note - Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem with Expediting. Manuf. Serv. Oper. Manag. 11(2): 229-236 (2009) - [j50]Chung-Yee Lee, Xiangtong Qi
Vehicle scheduling with combinable delivery and pickup operations. Oper. Res. Lett. 37(6): 399-404 (2009) - [j49]Ju-Liang Zhang, Chung-Yee Lee, Jian Chen:
Inventory control problem with freight cost and stochastic demand. Oper. Res. Lett. 37(6): 443-446 (2009) - 2008
- [j48]Bo Chen
Logistics scheduling with batching and transportation. Eur. J. Oper. Res. 189(3): 871-876 (2008) - [j47]Joseph Y.-T. Leung, Chung-Yee Lee, Chung W. Ng, Gilbert H. Young:
Preemptive multiprocessor order scheduling to minimize total weighted flowtime. Eur. J. Oper. Res. 190(1): 40-51 (2008) - [j46]Chung-Yee Lee, Gang Yu:
Parallel-machine scheduling under potential disruption. Optim. Lett. 2(1): 27-37 (2008) - [j45]Wikrom Jaruphongsa, Chung-Yee Lee:
Dynamic lot-sizing problem with demand time windows and container-based transportation cost. Optim. Lett. 2(1): 39-51 (2008) - 2007
- [j44]Chung-Yee Lee, Gang Yu:
Single machine scheduling under potential disruption. Oper. Res. Lett. 35(4): 541-548 (2007) - [j43]Wikrom Jaruphongsa, Sila Çetinkaya, Chung-Yee Lee:
Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions. Oper. Res. Lett. 35(6): 813-822 (2007) - 2006
- [j42]Sila Çetinkaya, Fatih Mutlu, Chung-Yee Lee:
A comparison of outbound dispatch policies for integrated inventory and transportation decisions. Eur. J. Oper. Res. 171(3): 1094-1112 (2006) - [j41]Ke Fu, Vernon Ning Hsu, Chung-Yee Lee:
Inventory and Production Decisions for an Assemble-to-Order System with Uncertain Demand and Limited Assembly Capacity. Oper. Res. 54(6): 1137-1150 (2006) - [j40]Vernon Ning Hsu, Chung-Yee Lee, Kut C. So:
Optimal Component Stocking Policy for Assemble-to-Order Systems with Lead-Time-Dependent Component and Product Pricing. Manag. Sci. 52(3): 337-351 (2006) - [j39]Irina V. Gribkovskaia
Three is easy, two is hard: open shop sum-batch scheduling problem refined. Oper. Res. Lett. 34(4): 459-464 (2006) - [j38]Chung-Yee Lee, Joseph Y.-T. Leung, Gang Yu:
Two Machine Scheduling under Disruptions with Transportation Considerations. J. Sched. 9(1): 35-48 (2006) - 2005
- [j37]Chung-Lun Li
Machine scheduling with deliveries to multiple customer locations. Eur. J. Oper. Res. 164(1): 39-51 (2005) - 2004
- [j36]Yung-Chia Chang
Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158(2): 470-487 (2004) - [j35]Wikrom Jaruphongsa, Sila Çetinkaya, Chung-Yee Lee:
A Two-Echelon Inventory Optimization Model with Demand Time Window Considerations. J. Glob. Optim. 30(4): 347-366 (2004) - [j34]Chung-Yee Lee:
Inventory replenishment model: lot sizing versus just-in-time delivery. Oper. Res. Lett. 32(6): 581-590 (2004) - [r1]Chung-Yee Lee:
Machine Scheduling with Availability Constraints. Handbook of Scheduling 2004 - 2003
- [j33]Chung-Yee Lee, Sila Çetinkaya, Wikrom Jaruphongsa:
A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse. Oper. Res. 51(5): 735-747 (2003) - 2002
- [j32]Zhi-Long Chen, Chung-Yee Lee:
Parallel machine scheduling with a common due window. Eur. J. Oper. Res. 136(3): 512-527 (2002) - [j31]George L. Vairaktarakis, Xiaoqiang Cai, Chung-Yee Lee:
Workforce planning in synchronous production systems. Eur. J. Oper. Res. 136(3): 551-572 (2002) - 2001
- [j30]Chung-Yee Lee, Lei Lei:
Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases. Ann. Oper. Res. 102(1-4): 287-307 (2001) - [j29]Chung-Yee Lee, Chen-Sin Lin:
Single-machine scheduling with maintenance and repair rate-modifying activities. Eur. J. Oper. Res. 135(3): 493-513 (2001) - [j28]Chung-Yee Lee, Sila Çetinkaya, Albert P. M. Wagelmans
A Dynamic Lot-Sizing Model with Demand Time Windows. Manag. Sci. 47(10): 1384-1395 (2001) - 2000
- [j27]Chung-Yee Lee, Yong He, Guochun Tang:
A note on "parallel machine scheduling with non-simultaneous machine available time". Discret. Appl. Math. 100(1-2): 133-135 (2000) - [j26]Xiaoqiang Cai, Chung-Yee Lee, Tin-Lam Wong:
Multiprocessor task scheduling to minimize the maximum tardiness and the total completion time. IEEE Trans. Robotics Autom. 16(6): 824-830 (2000)
1990 – 1999
- 1999
- [j25]Chung-Yee Lee:
Two-machine flowshop scheduling with availability constraints. Eur. J. Oper. Res. 114(2): 420-429 (1999) - 1997
- [j24]Chung-Yee Lee, Lei Lei:
Preface. Ann. Oper. Res. 70: 0 (1997) - [j23]Chung-Yee Lee, Lei Lei, Michael L. Pinedo:
Current trends in deterministic scheduling. Ann. Oper. Res. 70: 1-41 (1997) - [j22]Chung-Yee Lee, Reha Uzsoy, Louis A. Martin-Vega:
Letter to the Editor - Addendum to "Efficient Algorithms for Scheduling Semiconductor Burn-In Operations. Oper. Res. 45(1): 153-154 (1997) - [j21]Chung-Yee Lee, George L. Vairaktarakis:
Workforce Planning in Mixed Model Assembly Systems. Oper. Res. 45(4): 553-567 (1997) - [j20]Chung-Yee Lee:
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Oper. Res. Lett. 20(3): 129-139 (1997) - 1996
- [j19]Chung-Yee Lee, Chung-Lun Li
On the Fixed Interval Due-date Scheduling Problem. Discret. Appl. Math. 68(1-2): 101-117 (1996) - [j18]Chung-Yee Lee:
Machine scheduling with an availability constraint. J. Glob. Optim. 9(3-4): 395-416 (1996) - 1995
- [j17]Jeffrey W. Herrmann, Chung-Yee Lee:
Solving a Class Scheduling Problem with a Genetic Algorithm. INFORMS J. Comput. 7(4): 443-452 (1995) - [j16]Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee:
Minimizing the error bound for the dynamic lot size model. Oper. Res. Lett. 17(2): 57-68 (1995) - 1994
- [j15]Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee:
A new dynamic programming algorithm for the single item capacitated dynamic lot size model. J. Glob. Optim. 4(3): 285-300 (1994) - [j14]Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee:
A dynamic programming algorithm for dynamic lot size models with piecewise linear costs. J. Glob. Optim. 4(4): 397-413 (1994) - [j13]Chung-Yee Lee, George L. Vairaktarakis:
Minimizing makespan in hybrid flowshops. Oper. Res. Lett. 16(3): 149-158 (1994) - 1993
- [j12]Chung-Yee Lee, Surya Danusaputro Liman:
Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times. Discret. Appl. Math. 41(3): 211-222 (1993) - [j11]Surya Danusaputro Liman, Chung-Yee Lee:
Error Bound of a Heuristic for the Common Due Date Scheduling Problem. INFORMS J. Comput. 5(4): 420-425 (1993) - [j10]Vijaya Chandru, Chung-Yee Lee, Reha Uzsoy
Minimizing total completion time on a batch processing machine with job families. Oper. Res. Lett. 13(2): 61-65 (1993) - 1992
- [j9]Chung-Yee Lee, Surya Danusaputro Liman:
Single Machine Flow-Time Scheduling with Scheduled Maintenance. Acta Informatica 29(4): 375-382 (1992) - [j8]Chung-Yee Lee, Reha Uzsoy
Efficient Algorithms for Scheduling Semiconductor Burn-In Operations. Oper. Res. 40(4): 764-775 (1992) - [j7]Chung-Yee Lee, Reha Uzsoy
A new dynamic programming algorithm for the parallel machines total weighted completion time problem. Oper. Res. Lett. 11(2): 73-75 (1992) - 1991
- [j6]Chung-Yee Lee, Surya Danusaputro Liman, Chen-Sin Lin:
Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date. Comput. Oper. Res. 18(4): 379-389 (1991) - [j5]Chung-Yee Lee:
Parallel machines scheduling with nonsimultaneous machine available time. Discret. Appl. Math. 30(1): 53-61 (1991) - [j4]John Z. Luh, Chung-Yee Lee:
Stop Probability and Delay Estimations at Low Volumes for Semi-Actuated Traffic Signals. Transp. Sci. 25(1): 65-82 (1991)
1980 – 1989
- 1989
- [j3]Jing-Jang Hwang, Yuan-Chieh Chow, Frank D. Anger, Chung-Yee Lee:
Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM J. Comput. 18(2): 244-257 (1989) - 1988
- [j2]Chung-Yee Lee, J. David Massey:
Multiprocessor scheduling: combining LPT and MULTIFIT. Discret. Appl. Math. 20(3): 233-242 (1988) - 1986
- [j1]Chung-Yee Lee, Eric V. Denardo:
Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model. Math. Oper. Res. 11(3): 423-432 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: