DocumentCode :
723953
Title :
A comparison of two-machine flowshop with availability constraints for limited waiting time
Author :
Yanhui Yu
Author_Institution :
Sch. of Math. & Stat., Univ. of Northeastern Univ. at Qinhuangdao, Qinhuangdao, China
fYear :
2015
fDate :
23-25 May 2015
Firstpage :
6529
Lastpage :
6532
Abstract :
This paper has studied the issue for waiting time and availability constraints. Many researchers have studied each of these two kinds of constraints, but, fewer studies about the two constraints at the same time. In this paper, Makespan is the objective function taking into account, the waiting time between stages can not exceed the bound. To clarify the issue, the limited buffer time constraints have extended to solve the problem, and two more well-known algorithms are used for comparison. We can see the impact of experimental parameters on the problem solution, as well as a variety of different adaptive algorithms.
Keywords :
flow shop scheduling; single machine scheduling; adaptive algorithms; availability constraints; limited buffer time constraints; limited waiting time; objective function; two-machine flowshop scheduling; Algorithm design and analysis; Heuristic algorithms; Job shop scheduling; Linear programming; Processor scheduling; Time factors; Availability Constraints; Heuristic Algorithm; Limited Waiting Time; No-wait; Scheduling problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control and Decision Conference (CCDC), 2015 27th Chinese
Conference_Location :
Qingdao
Print_ISBN :
978-1-4799-7016-2
Type :
conf
DOI :
10.1109/CCDC.2015.7161997
Filename :
7161997
Link To Document :
بازگشت