A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies an insertion local search to the partial solution. Then, it inserts the block...
Main Authors: | Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Liang Gao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-05-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/5/100 |
Similar Items
-
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
by: Mehmet Fatih Tasgetiren, et al.
Published: (2016-10-01) -
A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems
by: Nader Ghaffari-Nasab, et al.
Published: (2010-07-01) -
Solving the permutation flow shop problem with blocking and setup time constraints
by: Mauricio Iwama Takano, et al.
Published: (2020-03-01) -
Job shop scheduling with makespan objective: A heuristic approach
by: Mohsen Ziaee
Published: (2014-04-01) -
COMPARISON BETWEEN MIXED INTEGER PROGRAMMING WITH HEURISTIC METHOD FOR JOB SHOP SCHEDULING WITH SEPARABLE SEQUENCE-DEPENDENT SETUPS
by: I Gede Agus Widyadana
Published: (2001-01-01)