NDLI: Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization

Content Provider	Springer Nature Link
Author	Gao, Kaizhou Pan, Quanke Suganthan, P. N. Li, Junqing
Copyright Year	2012
Abstract	The no-wait flow shop scheduling problem with total flow time criterion has important applications in industrial systems. Heuristics that explore specific characteristics of the problem are essential to find good solutions in limited computational time for many practical applications. This paper first presents two constructive heuristics, namely improved standard deviation heuristic (ISDH) and improved Bertolissi heuristic (IBH), by combining the standard deviation heuristic (Gao et al., Int J Adv Manf Technol 56:683–692, 2011) and Bertolliso heuristic (Bertolissi, J Mater Process Technol 107:459–465, 2000) with the procedure of the constructive heuristic of Laha (Int J Adv Manf Technol 41:97–109, 2009). Then, four composite heuristics, i.e., ISDH with local search, IBH with local search, ISDH with iteration, and IBH with iteration, are separately proposed using the insertion-based local search method and iteration operator to improve the solutions of the ISDH and IBH. Extensive computational experiments are carried out based on a set of well-known flow shop benchmark instances that are considered as no-wait flow shop instances. Computational results and comparisons show that the proposed composite heuristics perform significantly better than the existing ones, and the proposed composite heuristics further improve the presented constructive heuristics for the no-wait flow shop scheduling problem with total flow time criterion.
Starting Page	1563
Ending Page	1572
Page Count	10
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	66
Issue Number	9-12
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2012-08-17
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Flow shop scheduling No-wait Total flow time Constructive heuristics Composite heuristics Industrial and Production Engineering Production/Logistics/Supply Chain Mechanical Engineering Computer-Aided Engineering (CAD, CAE) and Design
Content Type	Text
Resource Type	Article
Subject	Industrial and Manufacturing Engineering Control and Systems Engineering Mechanical Engineering Computer Science Applications Software

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

A heuristic for no-wait flow shop scheduling

A constructive heuristic for minimizing makespan in no-wait flow shop scheduling

A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time

Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion

Review and classification of constructive heuristics mechanisms for no-wait flow shop problem

An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion

Evaluation of high performance constructive heuristics for the flow shop with makespan minimization

An effective hybrid particle swarm optimization for no-wait flow shop scheduling

Solution algorithms for the total weighted completion time minimization flow shop scheduling with decreasing linear deterioration

Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization

Similar Documents

A heuristic for no-wait flow shop scheduling

A constructive heuristic for minimizing makespan in no-wait flow shop scheduling

A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time

Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion

Review and classification of constructive heuristics mechanisms for no-wait flow shop problem

An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion

Evaluation of high performance constructive heuristics for the flow shop with makespan minimization

An effective hybrid particle swarm optimization for no-wait flow shop scheduling

Solution algorithms for the total weighted completion time minimization flow shop scheduling with decreasing linear deterioration

Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization