The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chris N. Potts: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edward J. Anderson, Chris N. Potts
    On-line scheduling of a single machine to minimize total weighted completion time. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:548-557 [Conf]
  2. Hocine Belouadah, Chris N. Potts
    Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:48, n:3, pp:201-218 [Journal]
  3. Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich
    Preface: International Symposium on Combinatorial Optimisation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:133, n:1-3, pp:1-2 [Journal]
  4. Nicholas G. Hall, Chris N. Potts, Chelliah Sriskandarajah
    Parallel machine scheduling with a common server. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:223-243 [Journal]
  5. K. N. Kashyrskikh, Chris N. Potts, Sergey V. Sevastianov
    A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:255-271 [Journal]
  6. Alex J. Orman, Chris N. Potts
    On the Complexity of Coupled-task Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:141-154 [Journal]
  7. Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich
    Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2001, v:13, n:2, pp:120-137 [Journal]
  8. Richard K. Congram, Chris N. Potts, Steef L. van de Velde
    An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2002, v:14, n:1, pp:52-67 [Journal]
  9. Edward J. Anderson, Chris N. Potts
    Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:3, pp:686-697 [Journal]
  10. Bo Chen, Chris N. Potts, Vitaly A. Strusevich
    Approximation algorithms for two-machine flow shop scheduling with batch setup times. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:255-271 [Journal]
  11. Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger
    On-line scheduling on a single machine: maximizing the number of early jobs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:193-197 [Journal]
  12. Jeffrey B. Sidney, Chris N. Potts, Chelliah Sriskandarajah
    A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:4, pp:165-173 [Journal]
  13. Marco Ghirardi, Chris N. Potts
    Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:2, pp:457-467 [Journal]
  14. Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich
    Batching decisions for assembly production systems. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:157, n:3, pp:620-642 [Journal]

  15. Operator non-availability periods. [Citation Graph (, )][DBLP]


  16. Scheduling of coupled tasks and one-machine no-wait robotic cells. [Citation Graph (, )][DBLP]


  17. Approximation results for flow shop scheduling problems with machine availability constraints. [Citation Graph (, )][DBLP]


  18. Scheduling with release dates on a single machine to minimize total weighted completion time. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002