BibTeX records: Wenci Yu

download as .bib file

@article{DBLP:journals/anor/PoonY05,
  author       = {Chung Keung Poon and
                  Wenci Yu},
  title        = {A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite
                  Capacity},
  journal      = {Ann. Oper. Res.},
  volume       = {133},
  number       = {1-4},
  pages        = {175--181},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10479-004-5031-0},
  doi          = {10.1007/S10479-004-5031-0},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/PoonY05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PoonY05,
  author       = {Chung Keung Poon and
                  Wenci Yu},
  title        = {On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity},
  journal      = {J. Comb. Optim.},
  volume       = {9},
  number       = {2},
  pages        = {167--186},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10878-005-6855-5},
  doi          = {10.1007/S10878-005-6855-5},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jco/PoonY05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/PoonY04,
  author       = {Chung Keung Poon and
                  Wenci Yu},
  title        = {On Minimizing Total Completion Time In Batch Machine Scheduling},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {15},
  number       = {4},
  pages        = {593--607},
  year         = {2004},
  url          = {https://doi.org/10.1142/S0129054104002637},
  doi          = {10.1142/S0129054104002637},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ijfcs/PoonY04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/YuHL04,
  author       = {Wenci Yu and
                  Han Hoogeveen and
                  Jan Karel Lenstra},
  title        = {Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time
                  Operations is NP-Hard},
  journal      = {J. Sched.},
  volume       = {7},
  number       = {5},
  pages        = {333--348},
  year         = {2004},
  url          = {https://doi.org/10.1023/B:JOSH.0000036858.59787.c2},
  doi          = {10.1023/B:JOSH.0000036858.59787.C2},
  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/scheduling/YuHL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiuY00,
  author       = {Zhaohui Liu and
                  Wenci Yu},
  title        = {Scheduling one batch processor subject to job release dates},
  journal      = {Discret. Appl. Math.},
  volume       = {105},
  number       = {1-3},
  pages        = {129--136},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0166-218X(00)00181-5},
  doi          = {10.1016/S0166-218X(00)00181-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/LiuY00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuYC99,
  author       = {Zhaohui Liu and
                  Wenci Yu and
                  T. C. Edwin Cheng},
  title        = {Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines},
  journal      = {Inf. Process. Lett.},
  volume       = {69},
  number       = {6},
  pages        = {275--281},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0020-0190(99)00026-5},
  doi          = {10.1016/S0020-0190(99)00026-5},
  timestamp    = {Sun, 27 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/LiuYC99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuY99,
  author       = {Zhaohui Liu and
                  Wenci Yu},
  title        = {Minimizing the Number of Late Jobs under the Group Technology Assumption},
  journal      = {J. Comb. Optim.},
  volume       = {3},
  number       = {1},
  pages        = {5--15},
  year         = {1999},
  url          = {https://doi.org/10.1023/A:1009841719644},
  doi          = {10.1023/A:1009841719644},
  timestamp    = {Sun, 27 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jco/LiuY99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Yu96,
  author       = {Wenci Yu},
  title        = {Augmentations of Consistent Partial orders for the one-machine Total
                  Tardiness Problem},
  journal      = {Discret. Appl. Math.},
  volume       = {68},
  number       = {1-2},
  pages        = {189--202},
  year         = {1996},
  url          = {https://doi.org/10.1016/0166-218X(95)00051-R},
  doi          = {10.1016/0166-218X(95)00051-R},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Yu96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics