A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum block size. After constructing the initial sequence, the VBIH algorithm starts...
Saved in:
Main Authors: | Pan, Quan-Ke, Kizilay, Damla, Gao, Kaizhou, Tasgetiren, Mehmet Fatih |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/84732 http://hdl.handle.net/10220/41963 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A comparative study of algorithms for the flowshop scheduling problem
by: Liu, S., et al.
Published: (2014) -
Novel MILP models for scheduling permutation flowshops
by: Pitty, S.S., et al.
Published: (2014) -
Novel MILP models for scheduling permutation flowshops
by: Pitty, S.S., et al.
Published: (2014) -
Integrated resource allocation and scheduling in a bidirectional flowshop with multimachine and COS constraints
by: Zhao, Z.Y.J., et al.
Published: (2014) -
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
by: Tasgetiren, M. Fatih., et al.
Published: (2013)