ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    On the complexity of two machine job-shop scheduling with regular objective functions (1997)
    Springer
    OR spectrum 19 (1997), S. 5-10 
    Details
    ISSN: 1436-6304
    Keywords: Job-shop ; polynomial algorithm ; Job-Shop ; polynomialer Algorithmus
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Für das Zweimaschinen-Job-Shop-Problem ohne Arbeitsunterbrechnungen und den Zielfunktionen Σf i bzw. maxf i , wobei dief i monotone Funktionen der Fertigstellungszeiten der Jobsi sind, werden für den Fall fester Jobanzahlen polynomiale Algorithmen angegeben. Dies beantwortet insbesondere die bislang offene Frage nach dem Komplexitätsstatus des obigen Problems für die ZielfunktionenL max, Σw i U i , und Σw i U. Schließlich zeigen wir, daß das Problem mit beliebiger regulärer Zielfunktion ebenfalls polynomial lösbar ist.
    Notes: Abstract For the nonpreemptive two machine job-shop scheduling problem with a fixed number of jobs and objective functions Σf i and maxf i , wheref i are nondecreasing functions of the finish times of jobsi, polynomial algorithms are presented. This answers previous open questions about the complexity status of the corresponding problems with objective functionsL max, Σw i U i , and Σw i U. We generalize these results by showing that the problem with any regular criterion can be solved in polynomial time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01539799
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Heuristics for permutation flow shop scheduling with batch setup times (1996)
    Springer
    OR spectrum 18 (1996), S. 67-80 
    Details
    ISSN: 1436-6304
    Keywords: Flow shop scheduling ; batch setup times ; group technology ; manufactoring cells ; heuristics ; Flow Shop Probleme ; Setup Zeiten ; Gruppentechnologie ; Heuristiken
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung In dieser Arbeit werden Permutationsflußprobleme mit Batch Setup Zeiten betrachtet. Jeder Job hat die gleiche technologische Reihenfolge. Die Jobs sind in Gruppen eingeteilt. Gegeben sind Bearbeitungszeient ij für Jobi auf Maschinej sowie Setup Zeitens rj auf Maschinej, wenn ein Job derr-ten Gruppe nach einem Job einer anderen Gruppe bearbeitet wird. Es wird vorausgesetzt, daß auf allen Maschinen die gleiche Reihenfolge der Jobs gewählt wird. In der Arbeit werden sowohl das Problem der Minimierung der Gesamtbearbeitungszeit als auch das Problem der Minimierung der Summe der Bearbeitungsendtermine mit Item oder Batch Verfügbarkeit betrachtet. Für diese Probleme werden konstruktive und iterative Algorithmen entwickelt. Die konstruktiven Algorithmen basieren auf Einfügungstechniken mit Beamsuche. Es werden geeignete Nachbarschaftsstrukturen eingeführt und auf lokaler Suche und Wiedereinfügungstechniken basierende iterative Algorithmen entwickelt. Die Algorithmen wurden an Beispielen mit bis zu 80 Jobs getestet.
    Notes: Abstract In this paper we consider permutation flow shop scheduling problems with batch setup times. Each job has to be processed on each machine once and the technological routes are identical for all jobs. The set of jobs is divided into groups. There are given processing timest ij of jobi on machinej and setup timess rj on machinej when a job of ther-th group is processed after a job of another group. It is assumed that the same job order has to be chosen on each machine. We consider both the problems of minimizing the makespan and of minimizing the sum of completion times, where batch or item availability of the jobs is assumed. For these problems we give various constructive and iterative algorithms. The constructive algorithms are based on insertion techniques combined with beam search. We introduce suitable neighbourhood structures for such problems with batch setup times and describe iterative algorithms that are based on local search and reinsertion techniques. The developed algorithms have been tested on a large collection of problems with up to 80 jobs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01539731
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    On the complexity of two machine job-shop scheduling with regular objective functions (1997)
    Springer
    OR spectrum 19 (1997), S. 5-10 
    Details
    ISSN: 1436-6304
    Keywords: Key words: Job-shop ; polynomial algorithm ; Schlüsselwörter: Job-Shop ; polynomialer Algorithmus
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung. Für das Zweimaschinen-Job-Shop-Problem ohne Arbeitsunterbrechnungen und den Zielfunktionen Σf i bzw. max f i , wobei die f i monotone Funktionen der Fertigstellungszeiten der Jobs i sind, werden für den Fall fester Jobanzahlen polynomiale Algorithmen angegeben. Dies beantwortet insbesondere die bislang offene Frage nach dem Komplexitätsstatus des obigen Problems für die Zielfunktionen L max, Σw i U i , und Σw i T i . Schließlich zeigen wir, daß das Problem mit beliebiger regulärer Zielfunktion ebenfalls polynomial lösbar ist.
    Notes: Abstract. For the nonpreemptive two machine job-shop scheduling problem with a fixed number of jobs and objective functions Σf i and max f i , where f i are nondecreasing functions of the finish times of jobs i, polynomial algorithms are presented. This answers previous open questions about the complexity status of the corresponding problems with objective functions L max, Σw i U i , and Σw i T i . We generalize these results by showing that the problem with any regular criterion can be solved in polynomial time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01539799
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    On the calculation of the stability radiusof an optimal or an approximate schedule (1998)
    Springer
    Annals of operations research 83 (1998), S. 213-252 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The main objective of this paper is to stimulate interest in stability analysis for scheduling problems. In spite of impressive theoretical results in sequencing and scheduling, up to now the implementation of scheduling algorithms with a rather deep mathematical back-ground in production planning, scheduling and control, and in other real-life problems with sequencing aspects is limited. In classical scheduling theory, mainly deterministic systems are considered and the processing times of all operations are supposed to be given in advance. Such problems do not often arise in practice: Even if the processing times are known before applying a scheduling procedure, OR workers are forced to take into account the precision of equipment, which is used to calculate the processing times, round-off errors in the calculation of a schedule, errors within the practical realization of a schedule, machine breakdowns, additional jobs, and so on. This paper is devoted to the calculation of the stability radius of an optimal or an approximate schedule. We survey some recent results in this field and derive new results in order to make this approach more suitable for practical use. Computational results on the calculation of the stability radius for randomly generated job shop scheduling problems are presented. The extreme values of the stability radius are considered in more detail. The new results are amply illustrated with examples.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018960030420
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Optimal makespan schedule for three jobs on two machines (1996)
    Springer
    Mathematical methods of operations research 43 (1996), S. 233-238 
    Details
    ISSN: 1432-5217
    Keywords: Optimal schedule ; makespan criterion ; job-shop problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper deals with the problem of scheduling three jobs on two machines in order to minimize the makespan, when operation preemptions are forbidden and routes are fixed and may vary per job. It is shown that this problem can be solved by anO(r 4) algorithm, wherer is the maximal number of operations per job.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01680374
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Preemptive job-shop scheduling problems with a fixed number of jobs (1999)
    Springer
    Mathematical methods of operations research 49 (1999), S. 41-76 
    Details
    ISSN: 1432-5217
    Keywords: Key words: Job-shop problem ; scheduling ; NP-hard
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. It is shown that the two machine preemptive job-shop problem with mean flow-time or makespan objective function and three jobs is NP-hard. This contrasts the fact that the nonpreemptive versions of these problems are polynomially solvable if the number of jobs is arbitrary but fixed. It is also shown that the preemptive problems can be solved pseudopolynomially if both the number of machines and the number of jobs is fixed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s001860050012
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    facet.materialart.
    Unknown
    Measures of problem uncertainty for scheduling with interval processing times (2012)
    Springer
    Details
    Publication Date: 2012-09-19
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 8
    facet.materialart.
    Unknown
    On the complexity of two machine job-shop scheduling with regular objective functions (1997)
    Springer
    Details
    Publication Date: 1997-03-01
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 9
    facet.materialart.
    Unknown
    Heuristics for permutation flow shop scheduling with batch setup times (1996)
    Springer
    Details
    Publication Date: 1996-06-01
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems (2013)
    Springer
    Details
    Publication Date: 2013-09-18
    Print ISSN: 0268-3768
    Electronic ISSN: 1433-3015
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...