نتایج جستجو برای: open shop scheduling problem

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

Journal: :Studies in Informatics and Control 2015

Journal: :European Journal of Operational Research 2021

In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Models for Online Printing Shop Scheduling Problem, Computers & Operations Research, to appear) is considered. This challenging real problem, that emerged nowadays industry, corresponds a flexible job with sequencing flexibility; it presents several complicati...

2001
Ana Madureira Carlos Ramos Sílvio do Carmo Silva

The problem of finding good solutions to scheduling problems is very important to real manufacturing systems, since the production rate and production costs are very dependent on the schedules used for controlling the work in the system. Most research in scheduling focuses on optimisation of static problems, where all problem data are known before scheduling starts. However many real world opti...

2015
Jonas Harbering Abhiram Ranade

In this work we consider the Single Track Train Scheduling Problem. The problem consists in scheduling a set of trains from opposite sides along a single track. The track passes intermediate stations and the trains are only allowed to pass each other at those stations. This problem has a close relation to minimizing the makespan in a job shop scheduling problem with two counter routes and no pr...

2005
Heidemarie Bräsel André Herms Marc Mörig Thomas Tautenhahn Jan Tusch Frank Werner

In this paper, we consider the problem of scheduling n jobs on m machines in an open shop environment so that the sum of completion times or mean flow time becomes minimal. For this strongly NP-hard problem, we develop and discuss different constructive heuristic algorithms. Extensive computational results are presented for problems with up to 50 jobs and 50 machines, respectively. The quality ...

2007
D S Todd

Scheduling is a combinatorial problem with important impact on both industry and commerce. If it is performed well it yields time and efficiency benefits and hence reduces costs. Genetic Algorithms have been applied to solve several types of scheduling problems; Flow Shop, Resource, Staff and Line Balancing have all been tackled. However Jobshop Scheduling is the most common problem of interest...

2012
Banafsheh Khosravi Julia A. Bennell Chris N. Potts

This paper introduces a modified shifting bottleneck approach to solve train scheduling and rescheduling problems. The problem is formulated as a job shop scheduling model and a mixed integer linear programming model is also presented. The shifting bottleneck procedure is a wellestablished heuristic method for obtaining solutions to the job shop and other machine scheduling problems. We modify ...

2016
Liang Sun Hongwei Ge Limin Wang

The optimization of job-shop scheduling is very important because of its theoretical and practical significance. In this paper, a computationally effective approach of combining bacterial foraging strategy with particle swarm optimization for solving the minimum makespan problem of job shop scheduling is proposed. In the artificial bacterial foraging system, a novel chemotactic model is designe...

Journal: :Appl. Soft Comput. 2009
Li-Ning Xing Ying-Wu Chen Ke-Wei Yang

Flexible job shop schedule is very important in both fields of combinatorial optimization and production management. In this paper, a simulationmodel is presented to solve themulti-objective flexible job shop scheduling problem. The proposed model has been coded by Matlab which is a special mathematical computation language. After modeling the pending problem, the model is validated by five rep...

Journal: :international journal of supply and operations management 2015
hadi mokhtari mehrdad dadgar

in this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. the main idea is that the processing times of operations may be controlled by consumptions of additional resources. the purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. the proposed model, flexibl...

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

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