نتایج جستجو برای: flexible job shop scheduling problem fjsp

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

2006
T. Kapamara K. Sheibani O. C. L. Haas C. R. Reeves D. Petrovic

This paper describes the radiotherapy patient scheduling problem of minimising waiting times. Like many other service industry problems, radiotherapy patient scheduling may be solved by first modelling and formulating it into a shop scheduling problem. Over the years, these shop scheduling models have been researched and solved using various approaches. This paper typifies radiotherapy patient ...

2011
Karin Thörnblad

Volvo Aero has invested in a complex production cell containing a set of multipurpose machines. The problem of finding optimal schedules for this multitask cell is a complex combinatorial optimization problem which is recognized as a flexible job shop problem. This thesis proposes an approach to find such schedules using mathematical optimization. The mathematical models developed so far are pr...

2008
Frédéric Dugardin Hicham Chehade Lionel Amodeo Farouk Yalaoui Christian Prins

Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

Journal: :IEEE Access 2023

An improved multiverse optimization (IMVO) algorithm is proposed herein for the fuzzy flexible job-shop scheduling problem pertaining to non-deterministic polynomial-time hard (NP-hard) problem. First, we designed a hybrid initialization method improve quality of initial solution, and thereafter, introduced self-crossing technique along with an insert-based heuristic simulate process exchanging...

Journal: :Advances in Production Engineering & Management 2017

2007
Tzung-Pei Hong Pei-Ying Huang

Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling can reduce material handling costs and time. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple flow shop problems, each machine operation center...

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

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