Chung-Yee Lee

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Surya Danusaputro Liman

> Home > Persons > Chung-Yee Lee

Publications

1993
[j12]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/LeeL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/LeeL93
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]
- view
  authority control:
- export record
  dblp key:
  - journals/informs/LimanL93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/LimanL93
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)
1992
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/acta/LeeL92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/LeeL92
Chung-Yee Lee, Surya Danusaputro Liman:
Single Machine Flow-Time Scheduling with Scheduled Maintenance. Acta Informatica 29(4): 375-382 (1992)
1991
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/LeeDL91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/LeeDL91
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)

a service of

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.