Journal ArticleDOI
Heuristics for scheduling in a flowshop with setup, processing and removal times separated
Reads0
Chats0
TLDR
The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan and heuristic algorithms are developed by the introduction of simplifying assumptions.Abstract:
The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan. Heuristic algorithms are developed by the introduction of simplifying assumptions into the scheduling problem under study. An improvement method is incorporated in the heuristics to enhance the quality of their solutions. The proposed heuristics and an existing heuristic are evaluated by a large number of randomly generated problems. The results of an extensive computational investigation for various values of parameters are presented.read more
Citations
More filters
Journal ArticleDOI
A review of scheduling research involving setup considerations
TL;DR: A comprehensive review of the literature on scheduling problems involving setup times (costs) classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops.
Journal ArticleDOI
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
TL;DR: A comparison of solutions yielded by the proposed ant-colony algorithms with the best heuristic solutions known for the benchmark problems, as published in an extensive study by Liu and Reeves is carried out.
Journal ArticleDOI
Flowshop-scheduling problems with makespan criterion: a review
S. Reza Hejazi,Soroush Saghafian +1 more
TL;DR: This paper is a complete survey of flowshop-scheduling problems and contributions from early works of Johnson of 1954 to recent approaches of metaheuristics of 2004 and surveys some exact methods, constructive heuristics and developed improving metaheuristic and evolutionary approaches for this problem.
Journal ArticleDOI
A review of flowshop scheduling research with setup times
Edwin Tai Chiu Cheng,Edwin Tai Chiu Cheng,Edwin Tai Chiu Cheng,Jatinder N. D. Gupta,Jatinder N. D. Gupta,Jatinder N. D. Gupta,Guoqing Wang,Guoqing Wang,Guoqing Wang +8 more
TL;DR: This review of static and deterministic flowshop scheduling research involving machine setup times reveals that, while a considerable body of literature on this subject has been created, there still exist several potential areas worthy of further research.
Journal ArticleDOI
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
TL;DR: This article addresses a multi-stage flow shop scheduling problem with unrelated parallel machines with a simulated annealing (SA)-based heuristic to solve the addressed problem in a reasonable running time.