Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Flow shop-sequencing problem with synchronous transfers and makespan minimization
Date
2007-01-01
Author
Soylu, B.
Kirca, Ou
Azizoğlu, Meral
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
2
views
0
downloads
This study considers a permutation flow shop-sequencing problem with synchronous transfers between stations. The objective is to minimize the makespan. It is shown that the problem is strongly NP-hard. A branch-and-bound algorithm together with several lower and upper bounding procedures are developed. The algorithm returns optimal solutions to moderate-sized problem instances in reasonable solution times.
Subject Keywords
Management Science and Operations Research
,
Strategy and Management
,
Industrial and Manufacturing Engineering
URI
https://hdl.handle.net/11511/34887
Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
DOI
https://doi.org/10.1080/00207540600621672
Collections
Department of Industrial Engineering, Article