نتایج جستجو برای: parallel machine scheduling

تعداد نتایج: 529014  

Journal: :JORS 2002
R.-H. Huang C.-L. Yang H.-T. Huang

In this paper, we consider a machine scheduling problem where jobs should be completed at times as close as possible to their respective due dates, and hence both earliness and tardiness should be penalized. Specifically, we consider the problem with a set of independent jobs to be processed on several identical parallel machines. All the jobs have a given common due window. If a job is complet...

2003
Thomas Erlebach Vanessa Kääb Rolf H. Möhring

Scheduling precedence constrained jobs on identical parallel machines is a well investigated problem with many applications. AND/OR-networks constitute a useful generalization of standard precedence constraints where certain jobs can be executed as soon as at least one of their direct predecessors is completed. For the problem of scheduling AND/OR-networks on parallel machines, we present a 2-a...

2007
R. TAVAKKOLI-MOGHADDAM A. H. GHAREHGOZLI M. RABBANI N. ZAERPOUR

This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates under the hypothesis of fuzzy processing time’s knowledge. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. At the end, the effectiveness of the pr...

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

Journal: :Journal of Intelligent Manufacturing 2022

Abstract This paper addresses the unrelated parallel machine scheduling problem with sequence and dependent setup times eligibility constraints. The objective is to minimize maximum completion time (makespan). Instances of more than 500 jobs 50 machines are not uncommon in industry. Such large instances become increasingly challenging provide high-quality solutions within limited amount computa...

Journal: :Discrete Applied Mathematics 1996
Yassine Ouazene Farouk Yalaoui

In the literature, most of the parallel-machine scheduling problems, in which the processing time of a job is a linear function of its starting time, are proved to be NP-hard. In this paper, we study a parallel-machine scheduling problem in which the processing time of a job is a linear function of its starting time. The objectives are to minimize the total completion of all jobs and the total ...

2009
Marco Chiarandini

General Optimization Methods Mathematical Programming, Constraint Programming, Heuristics Problem Specific Algorithms (Dynamic Programming, Branch and Bound) Scheduling Single and Parallel Machine Models Flow Shops and Flexible Flow Shops Job Shops Resource-Constrained Project Scheduling Timetabling Interval Scheduling, Reservations Educational Timetabling Workforce and Employee Timetabling Tra...

2006
Patricia A. Randall Mary E. Kurz

The unrelated parallel machine scheduling problem, in its most general form, is applicable to many manufacturing and service environments. This problem requires the scheduling of a group of independent jobs on unrelated parallel machines as well as the sequencing of the jobs on each individual machine. In this paper, we propose a genetic algorithm with adaptive crossover selection to schedule ...

Journal: :Oper. Res. Lett. 2001
Johann Hurink Sigrid Knust

We present complexity results which have influence on the strength of list scheduling in a parallel machine environment where additionally precedence constraints and sequence-dependent setup times are given and the makespan has to be minimized. We show that contrary to various other scheduling problems, in this environment a set of dominant schedules cannot be calculated efficiently with list s...

Journal: :Future Generation Comp. Syst. 1988
K. Ravikanth P. S. Sastry K. R. Ramakrishnan Y. V. Venkatesh

This paper addresses the problem of designing a parallel reduction architecture for applicative languages. An interconnection network that allows for scheduling of binary trees of arbitrary depth is presented. It is shown that using a static scheduling strategy the architecture achieves optimal performance while scheduling complete binary trees. Some issues related to the design of a machine ba...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید