Results 261 to 270 of about 2,312,652 (293)

Routing and scheduling in a flexible job shop by tabu search

Annals of Operations Research, 1993
A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic. Hierarchical strategies have been proposed in the literature for complex scheduling problems, and the tabu search metaheuristic, being able to cope with different memory levels, provides a natural background for the development of
openaire   +3 more sources

Genetic algorithm for the flexible job-shop scheduling problem

SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), 2004
In this paper, we are interested in the multiobjective optimization of the schedule performance in the flexible job shops. The flexible job shop scheduling problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized.
openaire   +2 more sources

Scheduling complex flexible job shop problems

Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95, 2002
We are developing for some years scheduling softwares for chemical industry. These softwares (developed on C++) are based on heuristics combined with optimisation methods. Our aim is to design a general methodology to cope with a large class of flexible job shop problems.
H. El Maqrini, J. Teghem
openaire   +1 more source

Hybrid frameworks for flexible job shop scheduling

The International Journal of Advanced Manufacturing Technology, 2020
Effective scheduling is essential for manufacturing firms to survive in today’s fiercely competitive marketplace. Improvisation of schedule by simultaneous optimization of the performance measures is imperative for the manufacturing firms to stay ahead of competition and is one of the key responsibilities of shop floor managers.
Puja Bharti, Sushma Jain
openaire   +1 more source

Flexible Job-Shop Scheduling Problems

2005
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like
openaire   +2 more sources

Evaluating Schedule Performance in Flexible Job-Shops

2004
In this paper, we are interested in the multi-objective evaluation of the schedule performance in the flexible job shops. The Flexible Job Shop Scheduling Problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized.
Kacem, Imed, Borne, Pierre
openaire   +2 more sources

Study on Scheduling Optimization for Flexible Job Shop

Applied Mechanics and Materials, 2010
A hybrid genetic algorithm based on Pareto was proposed and applied to flexible job shop scheduling problem (FJSP) with multi-objective, and the multi-objective FJSP optimization model was built, where the make-span and the machine utilization rate were concerned. The algorithm embeds Pareto ranking strategy into Pareto competition method.
Xiao Xia Liu, Chun Bo Liu, Ze Tao
openaire   +1 more source

Stochastic Scheduling for a Network of Flexible Job Shops

2016
In this chapter, we address the problem of optimally routing and sequencing a set of jobs over a network of flexible machines for the objective of minimizing the sum of completion times and the cost incurred, assuming stochastic job processing times.
Subhash C. Sarin, Hanif D. Sherali, Amrusha Varadarajan, Lingrui Liao   +3 more
openaire   +1 more source

Flexible Job-Shop Scheduling with Changeover Priorities

2022
Holden Milne, Opeyemi Adesina, Russell Campbell, Barbara Friesen, Masud Khawaja   +4 more
openaire   +2 more sources

Job Shop Scheduling With Flexible Energy Prices

ECMS 2016 Proceedings edited by Thorsten Claus, Frank Herrmann, Michael Manitz, Oliver Rose, 2016
Maximilian Selmair, Thorsten Claus, Marco Trost, Andreas Bley, Frank Herrmann   +4 more
openaire   +1 more source