Analysis of flow shop problems and their algorithms
The combinatorial optimization problem considered in this paper is flow shop scheduling problem arising in logistics, management, business, manufacture and etc. A set of machines and a set of jobs are given. Each job consists of a set of operations. Machines are working with unavailability intervals...
Main Authors: | Lina Rajeckaitė, Narimantas Listopadskis |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University Press
2009-12-01
|
Series: | Lietuvos Matematikos Rinkinys |
Subjects: | |
Online Access: | https://www.journals.vu.lt/LMR/article/view/17966 |
Similar Items
-
Analysis of usage of genetic and tabu search algorithms in shop scheduling
by: Edgaras Šakurovas, et al.
Published: (2008-12-01) -
Multi-Agent Model based on Tabu Search for the Permutation Flow Shop Scheduling Problem
by: Hafewa BARGAOUI, et al.
Published: (2014-10-01) -
A Hybrid Method for the Parallel-Flow Shop-Scheduling Problem
by: Milad Mansouri, et al.
Published: (2023-04-01) -
A TABU SEARCH APPROACH FOR PERMUTATION FLOW SHOP SCHEDULING
by: Cristina Elena DODU, et al.
Published: (2020-06-01) -
Proposed a branch and bound algorithm for Assembly flow shop scheduling problem
by: seyed mohammad hassan hosseini, et al.
Published: (2017-12-01)