The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time

Su, Ling-Huey; Lee, Yuan-Yu

doi:10.1016/j.cor.2007.01.002

Cited by 31 publications

(15 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2kCmax«(J'l PT ):<:; (3k-l) Cmax«(J") (9) and from (6) 2(k + I)Cmax «(J';':;) > (3k + 2) Cmax «(J' ; +I) (10) In view of (8) and (10) Then from (11) 2k 2 Cmax «(J'L P 1) + 2kCmax «(J' L P 1) > k(3k + 2)Cmax «(J' ; +I) + 2k(k + 1)…”

Section: Heuristic Algorithmmentioning

confidence: 97%

See 1 more Smart Citation

Scheduling parallel machines with a single server

Xie

Zhou

et al. 2012

Proceedings of 2012 International Conference on Measurement, Information and Control

View full text Add to dashboard Cite

This paper investigates scheduling parallel machines with a single sever as well as additional constraints on setups and removals. It generalizes classical parallel machine scheduling problem with a single server which needs to perform setup operation of each job only. This model is motivated by a key course of batch annealing process in the steel industry: heating or cooling.The objective is to minimize makespan. For this problem, we first give some complexity results by reduction.Some optimal properties are derived. Based on the properties, a LPT heuristics is proposed which generates a tight worst-case bound 3/ 2 -l/2m .

show abstract

Section: Heuristic Algorithmmentioning

confidence: 97%

“…[8], Iravani and Teo [9] and Su and Lee [10] investigate the server scheduling problems but under tlowshop environment consideration.…”

Section: Literature Reviewmentioning

confidence: 99%

Scheduling parallel machines with a single server

Xie

Zhou

et al. 2012

Proceedings of 2012 International Conference on Measurement, Information and Control

View full text Add to dashboard Cite

show abstract

“…The computational results show that the heuristic can rapidly obtain near-optimal solutions for problems with a realistic scale. Su and Lee [9] studied the scheduling problem where a set of jobs are available for processing in a no-wait and separate setup two-machine flow shop system with a single server. Both the heuristic and the branch and bound algorithms are developed to solve the problem.…”

Section: Mathematical Problems In Engineeringmentioning

confidence: 99%

No-Wait Flexible Flow Shop Scheduling with Due Windows

Huang

Yang

Liu

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

To improve capacity and reduce processing time, the flow shop with multiprocessors (FSMP) system is commonly used in glass, steel, and semiconductor production. No-wait FSMP is a modern production system that responds to periods when zero work is required in process production. The production process must be continuous and uninterrupted. Setup time must also be considered. Just-in-time (JIT) production is very popular in industry, and timely delivery is important to customer satisfaction. Therefore, it is essential to consider the time window constraint, which is also very complex. This study focuses on a no-wait FSMP problem with time window constraint. An improved ant colony optimization (ACO), known as ant colony optimization with flexible update (ACOFU), is developed to solve the problem. The results demonstrate that ACOFU is more effective and robust than ACO when applied to small-scale problems. ACOFU has superior solution capacity and robustness when applied to large-scale problems. Therefore, this study concludes that the proposed algorithm ACOFU performs excellently when applied to the scheduling problem discussed in this study.

show abstract

“…Oulamara [36] investigated a task-scheduling problem in a no-wait flow shop with two batching machines by minimizing makespan as an objective. Su and Lee [44] studied a two-machine flow shop no-wait scheduling problem with a single server, in which the performance measure was the total completion time. They provided both heuristic and branch-andbound (B/B) algorithms to tackle the given problem.…”

Section: Introductionmentioning

confidence: 99%