Minimizing completion time for a class of scheduling problems

Faigle, Ulrich and Schrader, Rainer (1984) Minimizing completion time for a class of scheduling problems.
Published in: Information Processing Letters Vol. 19 (1). pp. 27-29.


Actions:
Full text not available from this repository.
Export as:
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: No citation data.
Uncontrolled Keywords: Linear extension completion time scheduling
Subjects:
  • 06-XX Order, lattices, ordered algebraic structures > 06-06 Proceedings, conferences, collections, etc.

  • 68-XX Computer science > 68Mxx Computer system organization > 68M20 Performance evaluation; queueing; scheduling

  • 90-XX Operations research, mathematical programming > 90Bxx Operations research and management science > 90B35 Scheduling theory, deterministic

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
    Mathematical Institute > Prof. Dr. Faigle
    Related URLs:
    Deposit Information:
    ZAIK Number: UNSPECIFIED
    Depositing User: Archive Admin
    Date Deposited: 30 Jun 2014 12:35
    Last Modified: 30 Jun 2014 12:35
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/724