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
    Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems (2000)
    Springer
    Journal of heuristics 6 (2000), S. 481-500 
    Details
    ISSN: 1572-9397
    Keywords: programming ; heuristic ; analysis of algorithms ; suboptimal algorithms ; sequencing ; deterministic ; single machine
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem of estimating the global optimal values of intractable combinatorial optimization problems is of interest to researchers developing and evaluating heuristics for these problems. In this paper we present a method for combining statistical optimum prediction techniques with local search methods such as simulated annealing and tabu search and illustrate the approach on a single machine scheduling problem. Computational experiments show that the approach yields useful estimates of optimal values with very reasonable computational effort.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009669326107
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Decomposition methods for scheduling semiconductor testing facilities (1996)
    Springer
    International journal of flexible manufacturing systems 8 (1996), S. 357-387 
    Details
    ISSN: 1572-9370
    Keywords: heuristic scheduling ; semiconductor manufacturing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract We present decomposition procedures for scheduling semiconductor testing facilities. These facilities are characterized by the presence of different types of work centers, some of which have sequence-dependent setup times and some parallel identical machines. We exploit the structure of the routings in semiconductor testing to develop tailored decomposition procedures that decompose the shop into a number of work centers that are scheduled using specialized procedures. Extensive computational experiments show that these procedures significantly outperform existing methods in reasonable CPU times. These results indicate that decomposition methods can be successfully applied to complex scheduling problems of the type addressed in this paper, as well as the classical job shop problems addressed in previous research.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00170018
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates (1997)
    Springer
    Annals of operations research 70 (1997), S. 115-125 
    Details
    ISSN: 1572-9338
    Keywords: Scheduling ; dynamic arrivals ; heuristics ; rolling horizon procedure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We present a family of rolling horizon procedures for the problem of minimizing total completion time on a single machine with release times. These procedures develop solutions by using information about future job arrivals at each decision point. This approach provides an excellent compromise between the excessive computation time required by exact solution methods and the poor solution quality that myopic dispatching rules may yield. Extensive computational experiments show that these procedures consistently obtain high-quality solutions in very reasonable CPU times.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018961818782
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Rescheduling on a single machine with part-type dependent setup times and deadlines (1997)
    Springer
    Annals of operations research 70 (1997), S. 93-113 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We consider the problem of rescheduling a facility modeled as a single machine in the face of newly arrived jobs with part-type dependent setup times. The facility contains a number of jobs that have been assigned due dates and scheduled so as to meet them. We wish to insert the new jobs into the existing schedule in a manner that will minimize the disruption of the jobs in the system and minimize the total weighted completion time or the maximum completion time of the new jobs. We provide a polynomial-time algorithm for the maximum completion time problem, prove that the total weighted completion time problem is NP-hard in the strong sense and study several of its special cases. In particular, we show that the case with reverse-agreeable weights (of which the unit weight problem is a special case) can be solved in polynomial time when the number of part types is fixed. We also present two heuristics for the problem with arbitrary weights and develop data-dependent worst-case error bounds. Extensive computational experiments show that the heuristics consistently obtain near-optimal solutions in very reasonable CPU times.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018955111939
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems (1997)
    Springer
    Journal of heuristics 3 (1997), S. 111-137 
    Details
    ISSN: 1572-9397
    Keywords: scheduling ; job shop ; shifting bottleneck ; computation ; heuristics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems where the performance measure to be minimized is makespan (C max) or maximum lateness (L max). Extensive computational experiments are conducted on benchmark problems from the literature as well as several thousand randomly generated test problems with three different routing structures and up to 1000 operations. Several different versions of SB are examined to determine the effect on solution quality and time of different subproblem solution procedures, reoptimization procedures and bottleneck selection criteria. Results show that the performance of SB is significantly affected by job routings, and that SB with optimal subproblem solutions and full reoptimization at each iteration consistently outperforms dispatching rules, but requires high computation times for large problems. High quality subproblem solutions and reoptimization procedures are essential to obtaining good solutions. We also show that schedules developed by SB to minimize L max perform well with respect to several other performance measures, rendering them more attractive for practical use.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009627429878
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Minimizing total tardiness on a batch processing machine with incompatible job families (1998)
    Springer
    IIE transactions 30 (1998), S. 165-178 
    Details
    ISSN: 1573-9724
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Motivated by an application in semiconductor manufacturing, we study the problem of minimizing total tardiness on a batch processing machine with incompatibl8e job families, where all jobs of the same family have identical processing times and jobs of different families cannot be processed together. We present a dynamic programming algorithm which has polynomial time complexity when the number of job families and the batch machine capacity are fixed. We also examine various heuristic solution procedures which can provide near optimal solutions in a reasonable amount of computation time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007466101115
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Book
    Book
    Decomposition methods for complex factory scheduling problems (1997)
    Dordrecht :Kluwer Academic Publishers,
    Details
    Title: Decomposition methods for complex factory scheduling problems
    Author: Ovacik, Irfan M.
    Contributer: Uzsoy, Reha
    Publisher: Dordrecht :Kluwer Academic Publishers,
    Year of publication: 1997
    Pages: 215 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...