473 research outputs found

    Dynamic resource constrained multi-project scheduling problem with weighted earliness/tardiness costs

    Get PDF
    In this study, a conceptual framework is given for the dynamic multi-project scheduling problem with weighted earliness/tardiness costs (DRCMPSPWET) and a mathematical programming formulation of the problem is provided. In DRCMPSPWET, a project arrives on top of an existing project portfolio and a due date has to be quoted for the new project while minimizing the costs of schedule changes. The objective function consists of the weighted earliness tardiness costs of the activities of the existing projects in the current baseline schedule plus a term that increases linearly with the anticipated completion time of the new project. An iterated local search based approach is developed for large instances of this problem. In order to analyze the performance and behavior of the proposed method, a new multi-project data set is created by controlling the total number of activities, the due date tightness, the due date range, the number of resource types, and the completion time factor in an instance. A series of computational experiments are carried out to test the performance of the local search approach. Exact solutions are provided for the small instances. The results indicate that the local search heuristic performs well in terms of both solution quality and solution time

    Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

    Get PDF
    In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies involved in the construction of the greedy randomized schedules. On the other hand, these versions also differ on whether they employ only a final improvement step, or perform a local search after each greedy randomized construction. The proposed heuristics were compared with existing procedures, as well as with optimum solutions for some instance sizes. The computational results show that the proposed procedures clearly outperform their underlying dispatching heuristic, and the best of these procedures provide results that are quite close to the optimum. The best of the proposed algorithms is the new recommended heuristic for large instances, as well as a suitable alternative to the best existing procedure for the larger of the middle size instances.scheduling, single machine, early/tardy, quadratic penalties, greedy randomized dispatching rules

    Improving warehouse responsiveness by job priority management: a European distribution centre field study

    Get PDF
    Warehouses employ order cut-off times to ensure sufficient time for fulfilment. To satisfy increasing consumer’s expectations for higher order responsiveness, warehouses competitively postpone these cut-off times upholding the same pick-up time. This paper, therefore, aims to schedule jobs more efficiently to meet compressed response times. Secondly, this paper provides a data-driven decision-making methodology to guarantee the right implementation by the practitioners. Priority-based job scheduling using flow-shop models has been used mainly for manufacturing systems but can be ingeniously applied for warehouse job scheduling to accommodate tighter cut-off times. To assist warehouse managers in decision making for the practical value of these models, this study presents a computer simulation approach to decide which priority rule performs best under which circumstances. The application of stochastic simulation models for uncertain real-life operational environments contributes to the previous literature on deterministic models for theoretical environments. The performance of each rule is evaluated in terms of a joint cost criterion that integrates the objectives of low earliness, low tardiness, low labour idleness, and low work-in-process stocks. The simulation outcomes provide several findings about the strategic views for improving responsiveness. In particular, the critical ratio rule using the real-time queue status of jobs has the fastest flow-time and performs best for warehouse scenarios with expensive products and high labour costs. The case study limits the coverage of the findings, but it still closes the existent gap regarding data-driven decision-making methodology for practitioners of supply chains

    Synchronized Scheduling of Manufacturing and 3PL Transportation

    Get PDF

    Hybrid genetic algorithm to minimize scheduling cost with unequal and job dependent earliness tardiness cost

    Get PDF
    [EN] This article presents two combinatorial genetic algorithms (GA), unequal earliness tardiness-GA (UET-GA) and job-dependent earliness tardiness-GA (JDET-GA) for the single-machine scheduling problem to minimize earliness tardiness (ET) cost. The sequence of jobs produced in basic UET and JDET as a chromosome is added to the random population of GA. The best sequence from each epoch is also injected as a population member in the subsequent epoch. The proposed improvement seeks to achieve convergence in less time to search for an optimal solution. Although the GA has been implemented very successfully on many different types of optimization problems, it has been learnt that the algorithm has a search ability difficulty that makes computations NP-hard for types of optimization problems, such as permutation-based optimization problems. The use of a plain random population initialization results in this flaw. To reinforce the random population initialization, the proposed enhancement is utilized to obtain convergence and find a promising solution. The cost is further significantly lowered offering the due date as a decision variable with JDET-GA. Multiple tests were run on well-known single-machine benchmark examples to demonstrate the efficacy of the proposed methodology, and the results are displayed by comparing them with the fundamental UET and JDET approaches with a notable improvement in cost reduction.Bari, P.; Karande, P.; Bag, V. (2024). Hybrid genetic algorithm to minimize scheduling cost with unequal and job dependent earliness tardiness cost. International Journal of Production Management and Engineering. 12(1):19-30. https://doi.org/10.4995/ijpme.2024.19277193012

    Scheduling of non-repetitive lean manufacturing systems under uncertainty using intelligent agent simulation

    Get PDF
    World-class manufacturing paradigms emerge from specific types of manufacturing systems with which they remain associated until they are obsolete. Since its introduction the lean paradigm is almost exclusively implemented in repetitive manufacturing systems employing flow-shop layout configurations. Due to its inherent complexity and combinatorial nature, scheduling is one application domain whereby the implementation of manufacturing philosophies and best practices is particularly challenging. The study of the limited reported attempts to extend leanness into the scheduling of non-repetitive manufacturing systems with functional shop-floor configurations confirms that these works have adopted a similar approach which aims to transform the system mainly through reconfiguration in order to increase the degree of manufacturing repetitiveness and thus facilitate the adoption of leanness. This research proposes the use of leading edge intelligent agent simulation to extend the lean principles and techniques to the scheduling of non-repetitive production environments with functional layouts and no prior reconfiguration of any form. The simulated system is a dynamic job-shop with stochastic order arrivals and processing times operating under a variety of dispatching rules. The modelled job-shop is subject to uncertainty expressed in the form of high priority orders unexpectedly arriving at the system, order cancellations and machine breakdowns. The effect of the various forms of the stochastic disruptions considered in this study on system performance prior and post the introduction of leanness is analysed in terms of a number of time, due date and work-in-progress related performance metrics

    Hybrid Genetic Bees Algorithm applied to Single Machine Scheduling with Earliness and Tardiness Penalties

    Get PDF
    This paper presents a hybrid Genetic-Bees Algorithm based optimised solution for the single machine scheduling problem. The enhancement of the Bees Algorithm (BA) is conducted using the Genetic Algorithm's (GA's) operators during the global search stage. The proposed enhancement aims to increase the global search capability of the BA gradually with new additions. Although the BA has very successful implementations on various type of optimisation problems, it has found that the algorithm suffers from weak global search ability which increases the computational complexities on NP-hard type optimisation problems e.g. combinatorial/permutational type optimisation problems. This weakness occurs due to using a simple global random search operation during the search process. To reinforce the global search process in the BA, the proposed enhancement is utilised to increase exploration capability by expanding the number of fittest solutions through the genetical variations of promising solutions. The hybridisation process is realised by including two strategies into the basic BA, named as â\u80\u9creinforced global searchâ\u80\u9d and â\u80\u9cjumping functionâ\u80\u9d strategies. The reinforced global search strategy is the first stage of the hybridisation process and contains the mutation operator of the GA. The second strategy, jumping function strategy, consists of four GA operators as single point crossover, multipoint crossover, mutation and randomisation. To demonstrate the strength of the proposed solution, several experiments were carried out on 280 well-known single machine benchmark instances, and the results are presented by comparing to other well-known heuristic algorithms. According to the experiments, the proposed enhancements provides better capability to basic BA to jump from local minima, and GBA performed better compared to BA in terms of convergence and the quality of results. The convergence time reduced about 60% with about 30% better results for highly constrained jobs

    Improving warehouse responsiveness by job priority management

    Get PDF
    corecore