298 Hits in 5.8 sec

Games, Critical Paths and Assignment Problems in Permutation Flow Shops and Cyclic Scheduling Flow Line Environments

Selcuk Karabati, Panagiotis Kouvelis, Ali S. Kiran
1992 Journal of the Operational Research Society  
the relative efficiency of the new algorithm with respect to previously developed permutation flow shop branch-and-bound algorithms.  ...  Matsuo et al.” developed a controlled search simulated annealing technique for the permutation flow shop problem with makespan as the scheduling criterion.  ... 
doi:10.1057/jors.1992.33 fatcat:aj527bsjt5gz3jyc6xso77enqu

Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time

Seyedeh Sarah Zabihzadeh, Javad Rezaeian
2016 Applied Soft Computing  
In this research, flexible flow shop scheduling with unrelated parallel machines at each stage are considered.  ...  The main contribution of this study is to present the mixed integer linear programming model for the problem which considers release times for parts in scheduling area, loading and unloading times of parts  ...  Kharbeche et al. [21] proposed an exact branch and bound algorithm for the flow shop robotic cell scheduling problem where a single robot is considered.  ... 
doi:10.1016/j.asoc.2015.11.008 fatcat:oyevf33slzfohabf4s2djg4jhm

Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure

Selcuk Karabati, Panagiotis Kouvelis
1996 Naval Research Logistics  
The exact solution procedure is a branch-and-bound algorithm which uses Lagrangian and station-based relaxations of the integer programming formulation of the problem as the lower bounding method.  ...  In this paper we address the cyclic scheduling problem in flow lines. We develop a modeling framework and an integer programming formulation of the problem.  ...  A BRANCH-AND-BOUND ALGORITHM In this section we present an optimal algorithm for the n / m / P , D / X problem and report on our computational experience with the algorithm.  ... 
doi:10.1002/(sici)1520-6750(199603)43:2<211::aid-nav4>;2-d fatcat:n6xkbuusxzb4vdx4daimeo2qna

Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration

Oğuzhan Ahmet Arık
2020 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
This paper investigates permutation flow shop scheduling (PFSS) problems under the effects of position-dependent learning and linear deterioration.  ...  The search algorithm is built on the basic structure of Tabu search and it searches for the best candidate from a solution population instead of improving the current best candidate at each iteration.  ...  Shiau et al. (2015) proposed a branch-and-bound algorithm and several GA algorithms in order to obtain feasible solutions for a two-agent scheduling problem in a two-machine permutation flow shop with  ... 
doi:10.1007/s00500-020-05234-7 fatcat:bhg6msr5jberddl6iadfqitmci

Literature Review of Open Shop Scheduling Problems

Ellur Anand, Ramasamy Panneerselvam
2015 Intelligent Information Management  
Directions for future research are discussed in the end. 1 2 , n J J J and a set M which consists of m machines { } 1 2  ...  This paper discusses review of literature of open shop scheduling problems.  ...  Acknowledgements The authors thank the anonymous referees for their constructive suggestions, which have improved the paper. References  ... 
doi:10.4236/iim.2015.71004 fatcat:shukynonjrfaleqiousjru3ari

Multiprocessor Scheduling based on Evolutionary Technique for Solving Permutation Flow Shop Problem

Annu Priya, Sudip Kumar Sahana
2020 IEEE Access  
The new technique is implemented in a high-performance computing (HPC) environment using a Message passing interface (MPI) to resolve the permutation flow shop scheduling problem.  ...  Pareto optimality technique is used for sample distribution and the basis of the decision to select the lower bound of the makespan, instead of selecting the makespan directly for the best solution.  ...  ACKNOWLEDGMENT The authors would like to thank the Department of Computer Science and Engineering, B. I. T. Mesra, Ranchi, for resources to carry on the research work.  ... 
doi:10.1109/access.2020.2973575 fatcat:6ea34miwszcdhc6aizc5b2rhea

An Exchange Local Search Heuristic based Scheme for Permutation Flow Shop Problems

Ruey-Maw Chen, Fu-Ren Hsieh
2014 Applied Mathematics & Information Sciences  
Determining the specific flow sequence to minimize the makespan is the well-known scheduling problem named permutation flow-shop problem (PFSP) which has been confirmed to be an NP problem.  ...  In manufacturing organization, one of the mechanisms to minimize makespan (the total completion time) requires machines and operations to be in accordance with a specific flow sequence, i.e., each production  ...  Finally, Section 5 presents the conclusions. Permutation Flow Shop Problem In this study, a named permutation flow shop problem (PFSP) [3] is investigated.  ... 
doi:10.12785/amis/081l26 fatcat:bcs76vos5rf65l7btukn3wxygq

A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking

Pengyu Yan, Shi Qiang Liu, Cheng-Hu Yang, Mahmoud Masoud
2017 Journal of Industrial and Management Optimization  
The comparison shows that the proposed algorithm has the following advantages: i) it is more adaptive because it can be applied to three different types of scheduling problems (i.e., permutation flow-shop  ...  , general flow-shop and job-shop) without any modifications; ii) it is able to quickly evaluate whether a schedule is feasible (acyclic) or infeasible (cyclic) through checking the availability of the  ...  The authors are very grateful to the editors and the anonymous reviewers for their constructive comments and suggestions that have led to an improved version of this paper.  ... 
doi:10.3934/jimo.2018040 fatcat:jkcbpl53hjbhbmvfyvze2cqfoa

The permutation flow shop problem with blocking. A tabu search approach

Józef Grabowski, Jarosław Pempera
2007 Omega : The International Journal of Management Science  
This paper develops a fast tabu search algorithm to minimize makespan in a flow shop problem with blocking.  ...  Some properties of the problem associated with the blocks of jobs have been presented and discussed. These properties allow us to propose a specific neighbourhood of algorithms.  ...  The authors are due to anonymous referees for their valuable comments and suggestions. The present version of the paper has benefited greatly from these comments.  ... 
doi:10.1016/ fatcat:ecw4knm3avetble6mey2oem4iq

A survey of scheduling problems with setup times or costs

Ali Allahverdi, C.T. Ng, T.C.E. Cheng, Mikhail Y. Kovalyov
2008 European Journal of Operational Research  
Allahverdi and Al-Anzi (2002) showed that the MDO scheduling problem for WWW applications can be modeled as a two-machine flow shop scheduling problem with separate setup times. • Kim et al. (2002) considered  ...  It further categorizes the literature according to shop environments, including single-machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others.  ...  , parallel machines, flow shops (regular flow shop, no-wait flow shop, flexible flow shop, assembly flow shop), For multistage processing systems, permutation and non-permutation schedules and schedules  ... 
doi:10.1016/j.ejor.2006.06.060 fatcat:gaq5slhjsjfybjpx54qcveslme


Wojciech Bożejko, Zdzisław Hejducki, Mariusz Uchroński, Mieczysław Wodecki
2014 Journal of Civil Engineering and Management  
The paper concerns the problem of roadworks scheduling executed in the flow-shop system.  ...  We introduce the new: mathematical model, specific properties as an acceleration tools, as well as two new optimization algorithms for the problem considered: construction and tabu search.  ...  Acknowledgements The work was supported by the OPUS grant DEC-2012/05/B/ST7/00102 of Polish National Centre of Science.  ... 
doi:10.3846/13923730.2014.906496 fatcat:kvjztr764nbydhdxajijoa43ba

Mathematical Models Of Flow Shop And Job Shop Scheduling Problems

Miloš Šeda
2007 Zenodo  
In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model.  ...  For the job shop scheduling problem, a mathematical model and its main representation schemes are presented.  ...  skeleton for permutation flow shop scheduling problem III.  ... 
doi:10.5281/zenodo.1082306 fatcat:civegmauivbgpfbawg6hgwarrq

A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem

Amin Jamili, Mohammad Ali Shafia, Reza Tavakkoli-Moghaddam
2010 The International Journal of Advanced Manufacturing Technology  
In this paper, a periodic job shop scheduling problem (PJSSP) based on the periodic event scheduling problem (PESP) is presented, which deviates from the cyclic scheduling.  ...  To evaluate this proposed PSO-SA, we carry out some randomly constructed instances by which the related results are compared with the proposed SA and PSO algorithms as well as a branch-and-bound algorithm  ...  Acknowledgment The authors would like to thank the anonymous referees for their constructive comments on the earlier version of this paper.  ... 
doi:10.1007/s00170-010-2932-8 fatcat:kysflviqg5g3fgxsksmbambtke

Simulation Optimization for the Multihoist Scheduling Problem

Ricardo Pérez-Rodríguez, Mehdi Keshavarz-Ghorabaee
2021 Applied Computational Intelligence and Soft Computing  
Although the Multihoist Scheduling Problem (MHSP) can be detailed as a job-shop configuration, the MHSP has additional constraints.  ...  In addition, the optimization approach is able to identify the best solutions by a distance-based ranking model and the solutions located in the first Pareto-front layer contributes to improve the search  ...  A genetic algorithm approach is presented to solve the multijobs cyclic hoist scheduling problem with a single transportation resource.  ... 
doi:10.1155/2021/6639769 fatcat:7dvulpvh3rg6niz267k4txxx2e

Solving Non-Permutation Flow Shop Scheduling Problem with Time Couplings

Radosław Idzikowski, Jarosław Rudy, Andrzej Gnatowski
2021 Applied Sciences  
In this paper, a non-permutation variant of the Flow Shop Scheduling Problem with Time Couplings and makespan minimization is considered.  ...  Three solving methods, an exact Branch and Bound algorithm, the Tabu Search metaheuristic, and a baseline Genetic Algorithm metaheuristic, are proposed.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app11104425 fatcat:7i7hjlb5yveu7gqyzyhu7dudp4
« Previous Showing results 1 — 15 out of 298 results