The platform will undergo maintenance on Sep 14 at about 9:30 AM EST and will be unavailable for approximately 1 hour.
2005
DOI: 10.1007/s00170-004-2493-9
|View full text |Cite
|
Sign up to set email alerts
|

Unit sized transfer batch scheduling in an automated two-machine flow-line cell with one transport agent

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…Vickson (1995) [40] employed a fast polynomial algorithm to solve flow shop multi-batch problems, considering the job setting time and sub-batch transfer time. Etinkaya (2006) [41] extended this by incorporating units and independent settings to optimize batch problems in dual-machine process workshops, termed batch flow integration optimization. Despite these advancements, such research mainly focuses on small-scale device environments, with limited exploration of multi-flow integration at the production line level.…”
Section: System Flow Perspectivementioning
confidence: 99%
“…Vickson (1995) [40] employed a fast polynomial algorithm to solve flow shop multi-batch problems, considering the job setting time and sub-batch transfer time. Etinkaya (2006) [41] extended this by incorporating units and independent settings to optimize batch problems in dual-machine process workshops, termed batch flow integration optimization. Despite these advancements, such research mainly focuses on small-scale device environments, with limited exploration of multi-flow integration at the production line level.…”
Section: System Flow Perspectivementioning
confidence: 99%
“…It was -763-Journal of Industrial Engineering and Management -http://dx.doi.org/10.3926/jiem.553 presented some closed form solutions for continuous sublots and a fast polynominally bounded search algorithm for discrete sublots. Other papers proposed the use of removal times (Cetinkaya, 1994), of no-wait condition (Sriskandarajah & Wagneur, 1999) or even allowing interleaving (Cetinkaya, 2006).…”
Section: Problemmentioning
confidence: 99%
“…Flow Shop scheduling problem (FSP) can be described as there are n jobs that they must go through m machines with the same processes, and one of its main objectives is to find out the jobs arrangement which makes the maximum completion time to be shortest. A lot of researches are the assumption of infinite buffer space between machines [1]. But there are numerous situations in which discontinuous processing is not allowed, such as water supply and drainage engineering, steel making etc.…”
Section: Introductionmentioning
confidence: 99%