NDLI: Harmony search algorithms for Bi-criteria No-idle permutation Flow Shop Scheduling Problem

Content Provider	IEEE Xplore Digital Library
Author	Wen-Juan Ren Jun-Hua Duan Feng-rong Zhang Hong-yan Han Min Zhang
Copyright Year	2011
Description	Author affiliation: College of Computer Science, Liao Cheng, University, CO 252059, China (Wen-Juan Ren; Min Zhang) \|\| College of Computer Science, Liao Cheng University, CO 252059, China (Feng-rong Zhang) \|\| College of Computer, Science, Liao Cheng University, CO 252059, China (Jun-Hua Duan) \|\| College of Mathematic, Liao Cheng University, CO 252059, China (Hong-yan Han)
Abstract	Three hybrid harmony search (HS) algorithms are proposed for solving Bi-criteria No-idle permutation Flow Shop Scheduling Problem in this paper. Tw o objectives, i.e. the maximum completion time (makespan) and the total flow time (TFT), are considered simultaneously. The proposed algorithms firstly convert continuous harmony vectors into job permutations according to the largest position value (LPV) rule. Then the algorithms use the NEH algorithm to initialize one harmony and the others are initialized randomly. Lastly, a local search method is used in the proposed algorithms to enhance the exploitation capability. The extensive computational experiments demonstrate the high effectiveness and searching ability of the hybrid harmony algorithms especially the hybrid Globalbest harmony search (hGHS) algorithm.
Starting Page	2513
Ending Page	2517
File Size	187518
Page Count	5
File Format	PDF
ISBN	9781424487370
e-ISBN	9781424487387
DOI	10.1109/CCDC.2011.5968632
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-05-23
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Total flow time Job shop scheduling Hybrid harmony search Search problems Nickel Multi-objective optimization Makespan Mathematical model Equations
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Hybrid Tabu Search Algorithm for bi-criteria No-idle permutation flow shop scheduling problem

A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop

An effective discrete harmony search for solving bi-criteria FJSP

Shuffled Frog Leaping Algorithm for a Bi-objective No-Idle Permutation Flow Shop

Tabu search algorithm for solving No-idle permutation Flow Shop Scheduling Problem

Scheduling the blocking flow shop problem using a harmony search algorithm

A harmony search algorithm for the no-wait flow shop optimization scheduling

An improved genetic algorithm for solving flexible job shop scheduling problem

A new hybrid genetic algorithm for the bi-criteria no-wait flowshop scheduling problem with makespan and total flow time minimization

Harmony search algorithms for Bi-criteria No-idle permutation Flow Shop Scheduling Problem

Similar Documents

Hybrid Tabu Search Algorithm for bi-criteria No-idle permutation flow shop scheduling problem

A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop

An effective discrete harmony search for solving bi-criteria FJSP

Shuffled Frog Leaping Algorithm for a Bi-objective No-Idle Permutation Flow Shop

Tabu search algorithm for solving No-idle permutation Flow Shop Scheduling Problem

Scheduling the blocking flow shop problem using a harmony search algorithm

A harmony search algorithm for the no-wait flow shop optimization scheduling

An improved genetic algorithm for solving flexible job shop scheduling problem

A new hybrid genetic algorithm for the bi-criteria no-wait flowshop scheduling problem with makespan and total flow time minimization

Harmony search algorithms for Bi-criteria No-idle permutation Flow Shop Scheduling Problem