The SCEAS System
| |||||||

## Search the dblp DataBase
T. C. Edwin Cheng:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Migar M. C. Tam, Doris H. L. Choi, Walter W. C. Chung, T. C. Edwin Cheng, P. P. K. Chiu
**A Predictive and Reactive Scheduling Tool Kit for Repetitive Manufacturing.**[Citation Graph (0, 0)][DBLP] Knowledge-Based Reactive Scheduling, 1993, pp:147-162 [Conf] - Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao
**Scheduling to Minimize Makespan with Time-Dependent Processing Times.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:925-933 [Conf] - T. C. Edwin Cheng, Qing Ding
**Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times.**[Citation Graph (0, 0)][DBLP] Acta Inf., 2000, v:36, n:9/10, pp:673-692 [Journal] - Yaojun Chen, T. C. Edwin Cheng, C. T. Ng, Erfang Shan
**A note on domination and minus domination numbers in cubic graphs.**[Citation Graph (0, 0)][DBLP] Appl. Math. Lett., 2005, v:18, n:9, pp:1062-1067 [Journal] - Nitin Singh, Kee-hung Lai, T. C. Edwin Cheng
**Intra-organizational perspectives on IT-enabled supply chains.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 2007, v:50, n:1, pp:59-65 [Journal] - T. C. Edwin Cheng, Mikhail Y. Kovalyov
**Scheduling a Single Server in a Two-machine Flow Shop.**[Citation Graph (0, 0)][DBLP] Computing, 2003, v:70, n:2, pp:167-180 [Journal] - Dirk Biskup, T. C. Edwin Cheng
**Multiple-machine scheduling with earliness, tardiness and completion time penalties.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1999, v:26, n:1, pp:45-57 [Journal] - T. C. Edwin Cheng
**EOQ with limited backorder delays.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1986, v:13, n:4, pp:477-480 [Journal] - T. C. Edwin Cheng
**An algorithm for the con due-date determination and sequencing problem.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1987, v:14, n:6, pp:537-542 [Journal] - T. C. Edwin Cheng
**Optimal common due-date with limited completion time deviation.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1988, v:15, n:2, pp:91-96 [Journal] - T. C. Edwin Cheng
**A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1990, v:17, n:3, pp:321-324 [Journal] - T. C. Edwin Cheng
**A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1990, v:17, n:4, pp:425-426 [Journal] - T. C. Edwin Cheng, Zhi-Long Chen, Ceyda Oguz
**One-machine batching and sequencing of multiple-type items.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1994, v:21, n:7, pp:717-721 [Journal] - T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich
**Common due date assignment and scheduling with ready times.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2002, v:29, n:14, pp:1957-1967 [Journal] - T. C. Edwin Cheng, Qing Ding
**Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2003, v:30, n:1, pp:51-62 [Journal] - T. C. Edwin Cheng, Qing Ding
**The time dependent machine makespan problem is strongly NP-complete.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1999, v:26, n:8, pp:749-754 [Journal] - T. C. Edwin Cheng, Mikhail Y. Kovalyov
**An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2002, v:29, n:14, pp:2087-2091 [Journal] - T. C. Edwin Cheng, Guoqing Wang, Chelliah Sriskandarajah
**One-operator-two-machine flowshop scheduling with setup and dismounting times.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1999, v:26, n:7, pp:715-730 [Journal] - T. C. Edwin Cheng, J. J. Yuan, A. F. Yang
**Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2005, v:32, n:, pp:849-859 [Journal] - Chung-Lun Li, T. C. Edwin Cheng, Zhi-Long Chen
**Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1995, v:22, n:2, pp:205-219 [Journal] - C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov, S. S. Lam
**Single machine scheduling with a variable common due date and resource-dependent processing times.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2003, v:30, n:8, pp:1173-1185 [Journal] - Bertrand M. T. Lin, T. C. Edwin Cheng
**Batch scheduling in the no-wait two-machine flowshop to minimize the makespan.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2001, v:28, n:7, pp:613-624 [Journal] - Ceyda Oguz, Bertrand M. T. Lin, T. C. Edwin Cheng
**Two-stage flowshop scheduling with a common second-stage machine.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1997, v:24, n:12, pp:1169-1174 [Journal] - Xiuli Wang, T. C. Edwin Cheng
**Two-machine flowshop scheduling with job class setups to minimize total flowtime.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2005, v:32, n:, pp:2751-2770 [Journal] - Xiuli Wang, T. C. Edwin Cheng
**A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2006, v:33, n:, pp:1326-1344 [Journal] - Hong Yan, Zhenxin Yu, T. C. Edwin Cheng
**A strategic model for supply chain design with logical constraints: formulation and solution.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2003, v:30, n:14, pp:2135-2155 [Journal] - W. K. Yeung, Ceyda Oguz, T. C. Edwin Cheng
**Single-machine scheduling with a common due window.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2001, v:28, n:2, pp:157-175 [Journal] - Xiuli Wang, T. C. Edwin Cheng
**Heuristics for two-machine flowshop scheduling with setup times and an availability constraint.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2007, v:34, n:1, pp:152-162 [Journal] - Min Ji, Yong He, T. C. Edwin Cheng
**Single-machine scheduling with periodic maintenance to minimize makespan.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2007, v:34, n:6, pp:1764-1770 [Journal] - Xiaoqiang Cai, T. C. Edwin Cheng
**Multi-machine Scheduling with Variance Minimization.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:55-70 [Journal] - T. C. Edwin Cheng, Yaojun Chen, C. T. Ng
**A note on acyclic domination number in graphs of diameter two.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:6, pp:1019-1022 [Journal] - T. C. Edwin Cheng, Mikhail Y. Kovalyov
**Batch Scheduling and Common Due-date Assignment on a Single Machine.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:70, n:3, pp:231-245 [Journal] - Hermann G. Kahlbacher, T. C. Edwin Cheng
**Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:47, n:2, pp:139-164 [Journal] - T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. T. Ng
**The Ramsey numbers for a cycle of length six or seven versus a clique of order seven.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:9-10, pp:1047-1053 [Journal] - T. C. Edwin Cheng, David Y. C. Lam, Andy C. L. Yeung
**Adoption of internet banking: An empirical study in Hong Kong.**[Citation Graph (0, 0)][DBLP] Decision Support Systems, 2006, v:42, n:3, pp:1558-1572 [Journal] - Eric W. T. Ngai, T. C. Edwin Cheng, S. Au, Kee-hung Lai
**Mobile commerce integrated with RFID technology in a container depot.**[Citation Graph (0, 0)][DBLP] Decision Support Systems, 2007, v:43, n:1, pp:62-76 [Journal] - Zhenxin Yu, Hong Yan, T. C. Edwin Cheng
**Benefits of information sharing with supply chain partnerships.**[Citation Graph (0, 0)][DBLP] Industrial Management and Data Systems, 2001, v:101, n:3, pp:114-121 [Journal] - T. C. Edwin Cheng, Qing Ding
**The Complexity of Scheduling Starting Time Dependent Tasks with Release Times.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:65, n:2, pp:75-79 [Journal] - T. C. Edwin Cheng, Zhaohui Liu
**3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:161-165 [Journal] - T. C. Edwin Cheng, Guoqing Wang
**Two-Machine Flowshop Scheduling with Consecutive Availability Constraints.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:71, n:2, pp:49-54 [Journal] - Zhaohui Liu, T. C. Edwin Cheng
**Scheduling with job release dates, delivery times and preemption penalties.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:82, n:2, pp:107-111 [Journal] - Zhaohui Liu, Wenci Yu, T. C. Edwin Cheng
**Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:69, n:6, pp:275-281 [Journal] - C. T. Ng, T. C. Edwin Cheng, Aleksander Bachman, Adam Janiak
**Three scheduling problems with deteriorating jobs to minimize the total completion time.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:6, pp:327-333 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
**Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:82, n:4, pp:187-191 [Journal] - T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov
**A new algorithm for online uniform-machine scheduling to minimize the makespan.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:99, n:3, pp:102-105 [Journal] - Min Ji, T. C. Edwin Cheng
**An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:2-3, pp:41-47 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
**A note on the complexity of the problem of two-agent scheduling on a single machine.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:12, n:4, pp:387-394 [Journal] - T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger
**Scheduling with step-improving processing times.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:1, pp:37-40 [Journal] - T. C. Edwin Cheng, Zhaohui Liu
**Approximability of two-machine no-wait flowshop scheduling with availability constraints.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:319-322 [Journal] - T. C. Edwin Cheng, Guoqing Wang
**An improved heuristic for two-machine flowshop scheduling with an availability constraint.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2000, v:26, n:5, pp:223-229 [Journal] - Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng
**On scheduling an unbounded batch machine.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:1, pp:42-48 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
**A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2002, v:30, n:1, pp:66-68 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan, Zhaohui Liu
**On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:323-326 [Journal] - Zhaohui Liu, T. C. Edwin Cheng
**Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:4, pp:313-327 [Journal] - C. T. Ng, T. C. Edwin Cheng, J. J. Yuan
**Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:4, pp:405-412 [Journal] - T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
**The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:5, pp:483-490 [Journal] - T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
**A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:6, pp:551-555 [Journal] - Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
**An O(n**[Citation Graph (0, 0)][DBLP]^{2}) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. J. Scheduling, 2006, v:9, n:4, pp:343-364 [Journal] - J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
**Single machine batch scheduling problem with family setup times and release dates to minimize makespan.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2006, v:9, n:6, pp:499-513 [Journal] - T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
**Semi-on-line multiprocessor scheduling with given total processing time.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:337, n:1-3, pp:134-146 [Journal] - T. C. Edwin Cheng, C. T. Ng, J. J. Yuan
**Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:362, n:1-3, pp:273-281 [Journal] - Min Ji, Yong He, T. C. Edwin Cheng
**Scheduling linear deteriorating jobs with an availability constraint on a single machine.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:362, n:1-3, pp:115-126 [Journal] - Liying Kang, Moo Young Sohn, T. C. Edwin Cheng
**Paired-domination in inflated graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:320, n:2-3, pp:485-494 [Journal] - Zhaohui Liu, T. C. Edwin Cheng
**Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:347, n:1-2, pp:288-298 [Journal] - J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
**The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:320, n:2-3, pp:199-212 [Journal] - L. L. Liu, C. T. Ng, T. C. Edwin Cheng
**Scheduling jobs with agreeable processing times and due dates on a single batch processing machine.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:374, n:1-3, pp:159-169 [Journal] - Eric W. T. Ngai, T. C. Edwin Cheng
**MSS4TQM-a management support system for total quality management.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Systems, Man, and Cybernetics, Part C, 1999, v:29, n:3, pp:371-386 [Journal] - Ji-Bo Wang, C. T. Daniel Ng, T. C. Edwin Cheng, Li-Li Liu
**Minimizing total completion time in a two-machine flow shop with deteriorating jobs.**[Citation Graph (0, 0)][DBLP] Applied Mathematics and Computation, 2006, v:180, n:1, pp:185-193 [Journal] - T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich
**Scheduling with controllable release dates and processing times: Makespan minimization.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:175, n:2, pp:751-768 [Journal] - T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich
**Scheduling with controllable release dates and processing times: Total completion time minimization.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:175, n:2, pp:769-781 [Journal] - Min Ji, Yong He, T. C. Edwin Cheng
**Batch delivery scheduling with batch delivery cost on a single machine.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:176, n:2, pp:745-755 [Journal] - Xiuli Wang, T. C. Edwin Cheng
**Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:1, pp:57-70 [Journal] - Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng
**Fixed interval scheduling: Models, applications, computational complexity and algorithms.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:2, pp:331-342 [Journal] - J. J. Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng
**Approximability of single machine scheduling with fixed jobs to minimize total completion time.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:1, pp:46-56 [Journal] - J. J. Yuan, T. C. Edwin Cheng, C. T. Ng
**NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:178, n:2, pp:631-633 [Journal] - Chin-Shan Lu, Kee-hung Lai, T. C. Edwin Cheng
**Application of structural equation modeling to evaluate the intention of shippers to use Internet services in liner shipping.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:180, n:2, pp:845-867 [Journal] - Xiuli Wang, T. C. Edwin Cheng
**Single machine scheduling with resource dependent release times and processing times.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:3, pp:727-739 [Journal] - Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng
**On the single machine total tardiness problem.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:165, n:3, pp:843-846 [Journal] - T. C. Edwin Cheng, C. T. Ng, J. J. Yuan, Z. H. Liu
**Single machine scheduling to minimize total weighted tardiness.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:165, n:2, pp:423-443 [Journal] - T. C. Edwin Cheng, Natalia V. Shakhlevich
**Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:165, n:2, pp:444-456 [Journal] - J. J. Yuan, A. F. Yang, T. C. Edwin Cheng
**A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:158, n:2, pp:525-528 [Journal] - C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov
**Single machine batch scheduling with jointly compressible setup and processing times.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:153, n:1, pp:211-219 [Journal] - T. C. Edwin Cheng, Qing Ding, B. M. T. Lin
**A concise survey of scheduling with time-dependent processing times.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:152, n:1, pp:1-13 [Journal] - Ceyda Oguz, Muhammet Fikret Ercan, T. C. Edwin Cheng, Y. F. Fung
**Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:149, n:2, pp:390-403 [Journal] - Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
**Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums.**[Citation Graph (0, 0)][DBLP] International Conference on Computational Science (3), 2007, pp:338-346 [Conf] - Shuying Peng, Meili Li, Shenggui Zhang, T. C. Edwin Cheng
**Some New Structural Properties of Shortest 2-Connected Steiner Networks.**[Citation Graph (0, 0)][DBLP] FAW, 2007, pp:317-324 [Conf] - Zuosong Liang, Erfang Shan, T. C. Edwin Cheng
**Clique-Transversal Sets in Cubic Graphs.**[Citation Graph (0, 0)][DBLP] ESCAPE, 2007, pp:107-115 [Conf] - Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
**An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs.**[Citation Graph (0, 0)][DBLP] CJCDGCGT, 2005, pp:21-29 [Conf] - T. C. Edwin Cheng, L. Y. Kang, C. T. Ng
**Paired domination on interval and circular-arc graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:16, pp:2077-2086 [Journal] **The Ramsey numbers for cycles versus wheels of odd order.**[Citation Graph (, )][DBLP]**An improved algorithm for the p-center problem on interval graphs with unit lengths.**[Citation Graph (, )][DBLP]**A simple linear time algorithm for scheduling with step-improving processing times.**[Citation Graph (, )][DBLP]**An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint.**[Citation Graph (, )][DBLP]**Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint.**[Citation Graph (, )][DBLP]**Bicriterion scheduling with equal processing times on a batch processing machine.**[Citation Graph (, )][DBLP]**A hybrid algorithm for the single-machine total tardiness problem.**[Citation Graph (, )][DBLP]**Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times.**[Citation Graph (, )][DBLP]**Bounded single-machine parallel-batch scheduling with release dates and rejection.**[Citation Graph (, )][DBLP]**A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs.**[Citation Graph (, )][DBLP]**Machine scheduling with job class setup and delivery considerations.**[Citation Graph (, )][DBLP]**Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance.**[Citation Graph (, )][DBLP]**An application of the Turán theorem to domination in graphs.**[Citation Graph (, )][DBLP]**The Ramsey number for a cycle of length six versus a clique of order eight.**[Citation Graph (, )][DBLP]**A polynomial-time algorithm for the paired-domination problem on permutation graphs.**[Citation Graph (, )][DBLP]**The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.**[Citation Graph (, )][DBLP]**Scheduling jobs with release dates on parallel batch processing machines.**[Citation Graph (, )][DBLP]**Upper bounds on the upper signed total domination number of graphs.**[Citation Graph (, )][DBLP]**Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5.**[Citation Graph (, )][DBLP]**Heavy cycles in k-connected weighted graphs with large weighted degree sums.**[Citation Graph (, )][DBLP]**Remarks on the minus (signed) total domination in graphs.**[Citation Graph (, )][DBLP]**Codiameters of 3-domination critical graphs with toughness more than one.**[Citation Graph (, )][DBLP]**Extreme values of the sum of squares of degrees of bipartite graphs.**[Citation Graph (, )][DBLP]**Clique-transversal Number in Cubic Graphs.**[Citation Graph (, )][DBLP]**The Ramsey numbers R(C**[Citation Graph (, )][DBLP]_{m}, K_{7}) and R(C_{7}, K_{8}).**The Ramsey numbers for cycles versus wheels of even order.**[Citation Graph (, )][DBLP]
Search in 0.106secs, Finished in 0.111secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |