Hybrid sorting immune simulated annealing technique (HSISAT), a Meta heuristic is proposed for solving the multi objective flexible job-shop scheduling problem (FJSP). The major objectives are distributing the time of machines among the set of operations and scheduling them to minimize the criterion (makespan, total workload and maximum workload). The processing time is sorted for isolating the...

Improper assignment of gates may result in flight delays, inefficient use of the resource, customer’s dissatisfaction. A typical metropolitan airport handles hundreds of flights a day. Solving the gate assignment problem (GAP) to optimality is often impractical. Meta-heuristics have recently been proposed to generate good solutions within a reasonable timeframe. In this work, we attempt to asse...

This paper presents a simulated annealing search procedure developed to solve job shop scheduling problems simultaneously subject to tardiness and inventory costs. The procedure is shown to signi cantly increase schedule quality compared to multiple combinations of dispatch rules and release policies, though at the expense of intense computational e orts. A meta-heuristic procedure is developed...

The current drive to reduce packaging waste has led many companies to consider the use of multi-trip containers or shippers in which to transport their products in order to reduce packaging waste. The efficiency of such systems obviously depends on selecting shipper dimensions in such a way as to ensure high volumetric utilisation. As is the case with many practical problems the efficiency/solu...

Real Options for Project Schedules (ROPS) has three recursive sampling/optimization shells. An outer Adaptive Simulated Annealing (ASA) optimization shell optimizes parameters of strategic Plans containing multiple Projects containing ordered Tasks. A middle shell samples probability distributions of durations of Tasks. An inner shell samples probability distributions of costs of Tasks. PATHTRE...

It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...

in this paper, a new approach to overlapping operations in job shop scheduling is presented. in many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. in each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...

this study aims to deal with a more realistic combined problem of project scheduling and material ordering. the goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. the problem is first mathematically modelled. then a hybrid simulated annealing and genetic algorithm is...