[HTML][HTML] Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity
Robotic cell scheduling has received considerable attention from researchers. Several
existing review papers have presented then-existing studies on robotic cell scheduling and …
existing review papers have presented then-existing studies on robotic cell scheduling and …
The two stage assembly flowshop scheduling problem to minimize total tardiness
A Allahverdi, H Aydilek - Journal of Intelligent Manufacturing, 2015 - Springer
The two stage assembly flowshop scheduling problem has a lot of applications, and hence,
it has recently received more attention in the scheduling literature. The performance …
it has recently received more attention in the scheduling literature. The performance …
An artificial immune system heuristic for two-stage multi-machine assembly scheduling problem to minimize total completion time
FS Al-Anzi, A Allahverdi - Journal of Manufacturing Systems, 2013 - Elsevier
We address the two-stage multi-machine assembly scheduling problem. The first stage
consists of m independently working machines where each machine produces its own …
consists of m independently working machines where each machine produces its own …
Cyclic jobshop hoist scheduling with multi-capacity reentrant tanks and time-window constraints
This paper studies the cyclic jobshop hoist scheduling with multi-capacity reentrant tanks
and time-window constraints. Parts of different types are processed in a series of tanks with …
and time-window constraints. Parts of different types are processed in a series of tanks with …
An efficient new heuristic for the hoist scheduling problem
A El Amraoui, M Elhafsi - Computers & Operations Research, 2016 - Elsevier
In this paper, we study the hoist scheduling problem. The latter is often encountered in
electroplating processes where a variety of jobs have to be processed in small quantities …
electroplating processes where a variety of jobs have to be processed in small quantities …
Algorithms for no-wait flowshops with total completion time subject to makespan
A Allahverdi, H Aydilek - The International Journal of Advanced …, 2013 - Springer
The m-machine no-wait flowshop scheduling problem, with the objective of minimizing total
completion time subject to the constraint that makespan has to be less than or equal to a …
completion time subject to the constraint that makespan has to be less than or equal to a …
Dynamic hoist scheduling problem with multi-capacity reentrant machines: a mixed integer programming approach
This paper deals with the dynamic hoist scheduling problem with multi-capacity reentrant
machines, where some reentrant machines have parallel processing units and can process …
machines, where some reentrant machines have parallel processing units and can process …
Optimal cyclic scheduling of a robotic flowshop with multiple part types and flexible processing times
W Lei, A Che, C Chu - European Journal of Industrial …, 2014 - inderscienceonline.com
This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic
flowshop with multiple part types in which the processing times of parts can vary within their …
flowshop with multiple part types in which the processing times of parts can vary within their …
A genetic algorithm approach for a single hoist scheduling problem with time windows constraints
A El Amraoui, MA Manier, A El Moudni… - … Applications of Artificial …, 2013 - Elsevier
This study considers a cyclic scheduling of hoist movements in electroplating industry.
Several jobs have to flow through a production line according to an ordered bath sequence …
Several jobs have to flow through a production line according to an ordered bath sequence …
[HTML][HTML] A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
H Aydilek, A Allahverdi - Applied Mathematical Modelling, 2013 - Elsevier
The two-machine flowshop scheduling problem to minimize makespan is addressed. Jobs
have random processing times which are bounded within certain intervals. The distributions …
have random processing times which are bounded within certain intervals. The distributions …