992 research outputs found

    A Predictive-reactive Approach for JSP with Uncertain Processing Times

    Get PDF
    The paper is supported by the Asia-Link project funded by the European Commission (CN/ASIA-LINK/024 (109093)), the National Natural Science Foundation of China (50705076, 50705077), and the National Hi-Tech R&D Program of China (2007AA04Z187)JSP with discretely controllable processing times (JSP-DCPT) that are perturbed in a turbulent environment is formulated, based on which, a time-cost tradeoff based predictive-reactive scheduling approach is proposed for solving the problem. In the predictive scheduling process, on the basis of a proposed three-step decomposition approach for solving JSP-DCPT, a solution initialization algorithm is presented by incorporating a hybrid algorithm of tabu search and simulated annealing and a fast elitist non-dominated sorting genetic algorithm; in the reactive scheduling process, Pareto-optimal schedules are generated, among which every schedule that is not dominated by any initial schedule can be selected as the responding schedule so as to maintain optimality of the objective that is to minimize both the makespan and the cost. Experimental simulations demonstrate the effectiveness of the proposed approach

    A Predictive-reactive Approach for JSP with Uncertain Processing Times

    Get PDF
    The paper is supported by the Asia-Link project funded by the European Commission (CN/ASIA-LINK/024 (109093)), the National Natural Science Foundation of China (50705076, 50705077), and the National Hi-Tech R&D Program of China (2007AA04Z187)International audienceJSP with discretely controllable processing times (JSP-DCPT) that are perturbed in a turbulent environment is formulated, based on which, a time-cost tradeoff based predictive-reactive scheduling approach is proposed for solving the problem. In the predictive scheduling process, on the basis of a proposed three-step decomposition approach for solving JSP-DCPT, a solution initialization algorithm is presented by incorporating a hybrid algorithm of tabu search and simulated annealing and a fast elitist non-dominated sorting genetic algorithm; in the reactive scheduling process, Pareto-optimal schedules are generated, among which every schedule that is not dominated by any initial schedule can be selected as the responding schedule so as to maintain optimality of the objective that is to minimize both the makespan and the cost. Experimental simulations demonstrate the effectiveness of the proposed approach

    Notes on Max Flow Time Minimization with Controllable Processing Times

    Get PDF
    In a scheduling problem with controllable processing times the job processing time can be compressed through incurring an additional cost. We consider the identical parallel machines max flow time minimization problem with controllable processing times. We address the preemptive and non-preemptive version of the problem. For the preemptive case, a linear programming formulation is presented which solves the problem optimally in polynomial time. For the non-preemptive problem it is shown that the First In First Out (FIFO) heuristic has a tight worst-case performance of 3−2/m, when jobs processing times and costs are set as in some optimal preemptive schedul

    Single machine scheduling with resource dependent release times and processing times

    Get PDF
    Author name used in this publication: T. C. E. Cheng2004-2005 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

    Resource Management in Machine Scheduling Problems: A Survey

    Get PDF
    The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e., the models in which the job processing time or the job release date is given as a linear or convex function dependent on the amount of the additional resource allotted to the job. The scheduling models with resource dependent processing times or resource dependent release dates extend the classical scheduling models to reflect more precisely scheduling problems that appear in real life. Thus, in this paper we present the computational complexity results and solution algorithms that have been developed for this kind of problems

    Order Acceptance and Scheduling: A Taxonomy and Review

    Get PDF
    Over the past 20 years, the topic of order acceptance has attracted considerable attention from those who study scheduling and those who practice it. In a firm that strives to align its functions so that profit is maximized, the coordination of capacity with demand may require that business sometimes be turned away. In particular, there is a trade-off between the revenue brought in by a particular order, and all of its associated costs of processing. The present study focuses on the body of research that approaches this trade-off by considering two decisions: which orders to accept for processing, and how to schedule them. This paper presents a taxonomy and a review of this literature, catalogs its contributions and suggests opportunities for future research in this area

    Models and algorithms for energy-efficient scheduling with immediate start of jobs

    No full text
    We study a scheduling model with speed scaling for machines and the immediate start requirement for jobs. Speed scaling improves the system performance, but incurs the energy cost. The immediate start condition implies that each job should be started exactly at its release time. Such a condition is typical for modern Cloud computing systems with abundant resources. We consider two cost functions, one that represents the quality of service and the other that corresponds to the cost of running. We demonstrate that the basic scheduling model to minimize the aggregated cost function with n jobs is solvable in O(nlogn) time in the single-machine case and in O(n²m) time in the case of m parallel machines. We also address additional features, e.g., the cost of job rejection or the cost of initiating a machine. In the case of a single machine, we present algorithms for minimizing one of the cost functions subject to an upper bound on the value of the other, as well as for finding a Pareto-optimal solution

    Multiple neighborhoods in tabu search: successful applications for operations management problems

    Get PDF
    A metaheuristic is a refined solution method able to find a satisfying solution to a difficult problem in a reasonable amount of time. A local search metaheuristic works on a single solution and tries to improve it iteratively. Tabu search is one of the most famous local search, where at each iteration, a neighbor solution is generated from the current solution by performing a specific modification (called a move) on the latter. In contrast with most of the existing literature, the goal of this paper is to present tabu search approaches where different neighborhood structures (i.e., different types of moves) are jointly used. The discussion is illustrated for various operations management problems: truck loading, job scheduling, inventory management, and dimensioning of assembly lines
    corecore