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
    Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times (1993)
    Springer
    Applied intelligence 3 (1993), S. 159-172 
    Details
    ISSN: 1573-7497
    Keywords: Production scheduling ; tabu search ; combinatorial optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00871895
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Tabu search methods for a single machine scheduling problem (1991)
    Springer
    Journal of intelligent manufacturing 2 (1991), S. 63-73 
    Details
    ISSN: 1572-8145
    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 discuss the use of three local search strategies within a tabu search (TS) method for the approximate solution of a single machine scheduling problem. The problem consists of minimizing the sum of the set-up costs and linear delay penalties whenN jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. Following a review of a previous study of this problem, we first consider a TS method that uses the common approach of making a succession of pairwise job exchanges, or swaps, to move from one trial solution to another. Next, we consider the use of insert moves to define the local neighborhood of each trial solution. These moves consist of transferring a single job from one position to another in the schedule. Finally, we construct a TS method (TS-hybrid) that employs both swap and insert moves. Experiments with benchmark problems of up to 60 jobs illustrate that there is an advantage in using more than one strategy to move from one trial solution to another within a TS method.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01471219
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A search heuristic for just-in-time scheduling in parallel machines (1991)
    Springer
    Journal of intelligent manufacturing 2 (1991), S. 253-260 
    Details
    ISSN: 1572-8145
    Keywords: Tabu search ; GRASP ; just-in-time ; scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In recent years the Just-in-Time (JIT) production philosophy as been adopted by many companies around the world. This has motivated the study of scheduling models that embrace the essential components of JIT systems. In this paper, we present a search heurustic for the weighted earliness penalty problem with deadlines in parallel identical machines. Our approach combines elements of the solution methods known as greedy randomized adaptive search procedure (GRASP) and tabu search. It also uses a branch-and-bound post-processor to optimize individually the sequence of the jobs assigned to each machine.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01471113
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    A tabu search experience in production scheduling (1993)
    Springer
    Annals of operations research 41 (1993), S. 139-156 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract During the last four years, tabu search has been shown to be a remarkably effective method in solving difficult combinatorial optimization problems. Nowhere has this success been more marked than in the timely and very important area of production scheduling. In this paper, we review some of the research that has contributed to that success. We also give a synthesis of the various tabu search mechanisms that have been employed, giving special attention to advances that have led to major improvements. In the final section of the paper, we suggest directions for future research.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023072
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    General purpose heuristics for integer programming—Part I (1997)
    Springer
    Journal of heuristics 2 (1997), S. 343-358 
    Details
    ISSN: 1572-9397
    Keywords: integer programming ; branch and cut ; cut search ; ray probing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In spite of the many special purpose heuristics for specific classes of integer programming (IP) problems, there are few developments that focus on general purpose integer programming heuristics. This stems partly from the perception that general purpose methods are likely to be less effective than specialized procedures for specific problems, and partly from the perception that there is no unifying theoretical basis for creating general purpose heuristics. Still, there is a general acknowledgment that methods which are not limited to solving IP problems on a “class by class” basis, but which apply to a broader range of problems, have significant value. We show that certain ideas proposed in the 1970s, which are often overlooked, can be reformulated and linked with more recent developments to give a useful theoretical framework for generating general purpose IP heuristics. This framework, which has the appeal of being highly visual, makes use of cutting plane derivations that also give a natural basis for marrying heuristics with exact branch and cut methods for integer programming problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00132504
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    General Purpose Heuristics for Integer Programming—Part II (1997)
    Springer
    Journal of heuristics 3 (1997), S. 161-179 
    Details
    ISSN: 1572-9397
    Keywords: integer programming ; branch and cut ; star-paths ; scatter search
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In spite of the many special purpose heuristics for specific classes of integer programming (IP) problems, there are few developments that focus on general purpose integer programming heuristics. This stems partly from the perception that general purpose methods are likely to be less effective than specialized procedures for specific problems, and partly from the perception that there is no unifying theoretical basis for creating general purpose heuristics. Still, there is a general acknowledgment that methods which are not limited to solving IP problems on a “class by class” basis, but which apply to a broader range of problems, have significant value. We provide a theoretical framework and associated explicit proposals for generating general purpose IP heuristics. Our development, makes use of cutting plane derivations that also give a natural basis for marrying heuristics with exact branch and cut methods for integer programming problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009631530787
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times (1999)
    Springer
    IIE transactions 31 (1999), S. 125-134 
    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 The consideration of sequence-dependent setup times is one of the most difficult aspects of production scheduling problems. This paper reports on the development of a heuristic procedure to address a realistic production and inventory control problem in the presence of sequence-dependent setup times. The problem considers known monthly demands, variable production rates, holding costs, minimum and maximum inventory levels per product, and regular and overtime capacity limits. The problem is formulated as a Mixed-Integer Program (MIP), where subtour elimination constraints are needed to enforce the generation of job sequences in each month. By relaxing the subtour elimination constraints, the MIP formulation can be used to find a lower bound on the optimal solution. CPLEX 3.0 is used to calculate lower bounds for relatively small instances of this production problem, which are then used to assess the merit of a proposed heuristic. The heuristic is based on a simple short-term memory tabu search method that coordinates linear programming and traveling salesperson solvers in the search for optimal or near-optimal production plans.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007560417495
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Book
    Book
    Operations Research at Claio XVII (ALIO/SMIO Joint International Meeting) /; 258/2 (2017)
    Details
    Title: Operations Research at Claio XVII (ALIO/SMIO Joint International Meeting) /; 258/2
    Author: Rios-Mercado, Roger Z.
    Contributer: González-Velarde, José Luis , Laguna, Manuel
    Year of publication: 2017
    Pages: 501 S.
    Series Statement: Annals of operations research 258/2
    Type of Medium: Book
    Language: English
    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...