Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Use of silica for adsorptive stripping voltammetry in the presence of organic surfactants
    Amsterdam : Elsevier
    Journal of Electroanalytical Chemistry 258 (1989), S. 41-48 
    Details
    ISSN: 0022-0728
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    URL: http://linkinghub.elsevier.com/retrieve/pii/0022-0728(89)85160-5
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Tissue- and microbe-based electrochemical detectors for liquid chromatography
    Amsterdam : Elsevier
    Analytica Chimica Acta 229 (1990), S. 139-143 
    Details
    ISSN: 0003-2670
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    URL: http://linkinghub.elsevier.com/retrieve/pii/S0003-2670(00)85119-3
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Linear-sweep voltammetry at a dropping mercury electrode in continuous flow systems
    Amsterdam : Elsevier
    Analytica Chimica Acta 159 (1984), S. 129-137 
    Details
    ISSN: 0003-2670
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    URL: http://linkinghub.elsevier.com/retrieve/pii/S0003-2670(00)84289-0
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Potentiometric titration of hydroxide, aluminate and carbonate in sodium aluminate solutions
    Amsterdam : Elsevier
    Analytica Chimica Acta 140 (1982), S. 115-121 
    Details
    ISSN: 0003-2670
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    URL: http://linkinghub.elsevier.com/retrieve/pii/S0003-2670(01)95457-1
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Scheduling parallel tasks withsequential heads and tails (1999)
    Springer
    Annals of operations research 90 (1999), S. 221-246 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper considers scheduling of parallel tasks in a multiprogrammed, multiprocessorsystem. The problem of preemptive scheduling of n tasks on m processors to minimizemakespan is studied. Task j starts and finishes with sequential parts head j and tail j , respectively.Between these two, j runs its parallel part parallel j . The sequential parts have to beexecuted by one processor at a time. The parallel part can be executed by more than oneprocessor at a time. It is shown that this problem is NP‐hard in the strong sense even if thereare fewer tasks than processors. A linear program is presented to find an optimal schedulefor a given sequence of completion times of heads and start times of tails. If the optimalschedule for tasks longer than the mth longest task is given, an efficient, polynomial‐timemerging algorithm is proposed to obtain an optimal schedule for all n tasks. The algorithmbuilds an optimal schedule with at most m ‐ 1 tasks running their parallel parts on morethan one processor at a time, the remaining tasks run their parallel parts as if they weresequential. Therefore, there always exist optimal schedules with only a few tasks exploitingthe parallel processing capability of a parallel system. Finally, polynomially solvable casesare discussed, and the worst‐case performance of three heuristics for the problem is analyzed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018964732122
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Sequencing of parts and robot moves in a robotic cell (1992)
    Springer
    International journal of flexible manufacturing systems 4 (1992), S. 331-358 
    Details
    ISSN: 1572-9370
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this paper, we deal with the problem of sequencing parts and robot moves in a robotic cell where the robot is used to feed machines in the cell. The robotic cell, which produces a set of parts of the same or different types, is a flow-line manufacturing system. Our objective is to maximize the long-run average throughput of the system subject to the constraint that the parts are to be produced in proportion of their demand. The cycle time formulas are developed and analyzed for this purpose for cells producing a single part type using two or three machines. A state space approach is used to address the problem. Both necessary and sufficient conditions are obtained for various cycles to be optimal. Finally, in the case of many part types, the problem of scheduling parts for a specific sequence of robot moves in a two machine cell is formulated as a solvable case of the traveling salesman problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01324886
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Scheduling unit — time tasks on flow — shops under resource constraints (1988)
    Springer
    Annals of operations research 16 (1988), S. 255-266 
    Details
    ISSN: 1572-9338
    Keywords: Scheduling ; flow shops ; resource constraints ; message transmission
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We consider the problem of scheduling tasks on flow shops when each task may also require the use of additional resources. It is assumed that all operations have unit lengths, the resource requirements are of 0–1 type and there is one type of the additional resource in the system. It is proved that when the number of machines is arbitrary, the problem of minimizing schedule length is NP-hard, even when only one unit of the additional resource is available in the system. On the other hand, when the number of machines is fixed, then the problem is solvable in polynomial time, even for an arbitrary number of resource units available. For the two machine case anO(n log 2 2 n) algorithm minimizing maximum lateness is also given. The presented results are also of importance in some message transmission systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283747
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (1989)
    Springer
    Mathematical methods of operations research 33 (1989), S. 423-437 
    Details
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Es wird ein Algorithmus der Ordnung O(n 3/(b+1)) zur Ermittlung der frühesten Fertigstellungszeit für Schedulingprobleme mit 2 Prozessoren und baumartigen Präzendenzbeziehungen angegeben. Dabei wird angenommen, daßt die Durchführung jeder einzlnen Aufgabe gleich lange dauert, der langsamere Prozessor jedochb Zeiteinheiten (b ganzzahlig) zur Durchführung einer Aufgabe benötigt. Ferner wird gezeigt, dafß eine leichte Modifikation der Lösung eine Reihenfolge mit minimaler mittlerer Durchlaufzeit ergibt.
    Notes: Abstract An O(n 3/(b+1)) time algorithm to obtain a minimum finish time schedule subject to tree-like precedence constraints for unit-time tasks on two uniform processors is obtained. It is assumed that the slower processor takesb time units for each one taken by the speedier one, for some integerb. It is also noted that a slight modification of this schedule yields a minimum mean flow time schedule.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01415940
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Minimizing mean flow-time with parallel processors and resource constraints (1987)
    Springer
    Acta informatica 24 (1987), S. 513-524 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary The problem to be considered is one of scheduling nonpreemptable tasks in multiprocessor systems when tasks need for their processing processors and other limited resources, and when mean flow time is the system performance measure. For each task the time required for its processing and the amount of each resource which it requires, are given. Special attention is paid to the computational complexity of algorithms for determining the optimal schedules for different assumptions concerning the environment. For the case of scheduling independent, arbitrary length tasks when each task may require a unit of an additional resource of one type, an O(n 3) algorithm is given. For more complicated resource requirements, however, it is proved that the problem under consideration is NP-hard in the strong sense, even for the case of two processors.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00263292
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...