نتایج جستجو برای: unrelated machines
تعداد نتایج: 99101 فیلتر نتایج به سال:
This paper considers the minimization of makespan in unrelated parallel batch processing machines scheduling problem with considering non-identical job size and dynamic ready time. The considered have different capacity speed. Each machine processes a number jobs as at same time so that machine’s is not exceeded. are equal to largest batch, respectively. In this paper, Mixed Integer Linear Prog...
The paper presents our efforts in defining UASM, a unified syntax for Abstract State Machines (ASMs), based on the syntaxes of two of the main ASM frameworks, CoreASM and ASMETA, which have been adapted to accept UASM as input syntax of all their validation and
• Durch die starke Vernetzung ehemals unabhängiger Funktionen ergeben sich ungewollte Interaktionen und Seiteneffekte durch Nebenläufigkeit. Als Beispiel sei hier die Zentralverriegelung genannt, die neben der reinen Funktionalität des Verund Aufschließens mit Komfortfunktionen zum Einstellen von Sitz, Spiegeln und Radiosendern in Abhängigkeit vom verwendeten Schlüssel, mit Sicherheitsfunktione...
This paper addresses the resolution of mixed Task Scheduling and Resource Allocation problems in an integrated way. Time and resource constraint propagation is specified on top of a solving procedure directed by a backtracking algorithm. To evaluate the approach, experiments are reported on randomly generated instances. The main features of these instances are general precedence constraints, un...
Let there be m parallel machines and n jobs, where a job j can be scheduled on machine i to take pi, j ∈ Z+ time units. The makespan Cmax is the completion time of a machine that finishes last. The goal is to produce a schedule with all n jobs that has minimum makespan. This is the makespan problem on unrelated parallel machines, denoted as R||Cmax. Assume p,q ∈ Z+ are constants, let A(p,q) = {...
In this paper, we propose a multi-criteria machine-schedules decision making method that can be applied to a production environment involving several unrelated parallel machines and we will focus on three objectives: minimizing makespan, total flow time, and total number of tardy jobs. The decision making method consists of three phases. In the first phase, a mathematical model of a single mach...
0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.09.004 q This manuscript was processed by Area Editor Ma * Corresponding author. Tel./fax: +52 653 5356168 E-mail address: [email protected] (V. Yaurima This paper presents a genetic algorithm for an important production scheduling problem. Since the problem is NP-hard, we focus on suboptimal scheduling solutions for the ...
The goal of this paper is to investigate scheduling heuristics to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static hybrid flow shop environment where at least one production stage is made up of unrelated parallel machines. In addition, sequence and machine dependent setup times are considered. The problem is a combinatorial optimization p...
In this paper, we present an industrial problem found in a company that produces acrylic fibres to be used by the textile industry. The problem is a particular case of the discrete lot sizing and scheduling problem (DLSP). In this problem, lots of similar products must be generated and sequenced in ten unrelated parallel machines, in order to minimize tool changeovers and the quantity of fibre ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید