نتایج جستجو برای: family setup times
تعداد نتایج: 780130 فیلتر نتایج به سال:
In this paper a multicriteria scheduling problem with sequence-dependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time, maximum tardiness and maximum earliness. An integer programming model is developed for the problem which belongs to NP-hard class. Only small size problems with up to 12 jobs ca...
This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|fmls, prmu, Splk|∑Cj). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing with the latest MILP model for the proposed problem in the literature, the complexity size of the propos...
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m P 2 processors. We take into account both the linear speedup of such jobs and their setup time, i.e., the time to create, dispatch, and destroy multiple processes. Specifically, we define the execution time of a job with length pj running on kj processors to be pj/kj + (kj 1)c, where ...
Alternative IP formulations for scheduling flexible flowlines with sequence-dependent setup times will be presented. While one does not differentiate between the machines at each stage, the other does. The differences in the formulations based on ease of implementation and ease of extension to variants of the problem will be discussed.
The study considers the scheduling problem of identical parallel machines subject to minimization of the maximumcompletion time and the maximum tardiness expressed in a linear convex objective function. The maximum completiontime or makespan is the date when the last job to be completed leaves the system. The maximum tardiness is indicated bythe job that is completed with the lo...
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. Th...
Domain filtering is a powerful technique for reduction of the search space during solving combinatorial problems like scheduling. In this paper we present several filtering algorithms designed specifically for scheduling in batch processing environments with sequence dependent setup times. We extend two known algorithms, namely edge finding and not-first/not-last technique, and we present a new...
In this paper a general shop scheduling problem with sequence dependent setup times arid alternative r[.~ sources is considered, where optimization criteria are both makespan and sum of setup times. Two cooperative models for the problem based on Constraint Programming arc proposed. The first is used to model the scheduling constraints, while the second is a muhipath model used for setup optimi...
much investigation has been given to this issue, the role of setup savings from the perspective of the workload control concept has hardly received attention. This paper reports a simulation study on this matter. The study evaluates the potential for savings in setups, dependent on the level of workload in the shop, for two alternative strategies, namely considering setup times centrally, withi...
This paper presents a heuristic algorithm for solving the job-shop scheduling problem with sequence dependent setup times (SDST-JSSP). The algorithm relies on a core constraint-based search procedure, which generates consistent ordering of activities requiring the same resource by incrementally imposing precedence constraints on a temporal feasible solution. Key to the effectiveness of the sear...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید