NDLI: An efficient bi-objective heuristic for scheduling of hybrid flow shops

Content Provider	Springer Nature Link
Author	Mousavi, S. M. Zandieh, M. Amiri, M.
Copyright Year	2010
Abstract	This paper considers the problem of scheduling n independent jobs in hybrid flow shop environment with sequence-dependent setup times to minimize the makespan and total tardiness. For the optimization problem, an algorithm namely; bi-objective heuristic (BOH) is proposed for searching Pareto-optimal frontier. The aim of the proposed algorithm is to generate a good approximation of the set of efficient solutions. The BOH procedure initiates by generating a seed sequence. Since the output results are strongly dependent on the initial solution and in order to increase the quality of output results algorithm, we have considered how the generation of seed sequence with random way and particular sequencing rules. Two methods named Euclidean distance and percent error have been proposed to compare non-dominated solution sets obtain of each seed sequence. It is perceived from these methods that the generation of seed sequence using earliest due date rule is more effective. Then, the performance of the proposed BOH is compared with a simulated annealing proposed in the literature and a VNS heuristic on a set of test problems. The data envelopment analysis is used to evaluate the performance of approximation methods. From the results obtained, it can be seen that the proposed algorithm is efficient and effective.
Starting Page	287
Ending Page	307
Page Count	21
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	54
Issue Number	1-4
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2010-10-28
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Bi-objective heuristic Hybrid flow shop scheduling Neighborhood search structure Scheduling rule Mechanical Engineering Computer-Aided Engineering (CAD, CAE) and Design Industrial and Production Engineering Production/Logistics
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

Bi-objective hybrid flow shop scheduling: a new local search

Minimizing makespan in reentrant flow-shops using hybrid tabu search

Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers

A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem

An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling

Sequencing and scheduling of nonuniform flow pattern in parallel hybrid flow shop

A hybrid differential evolution method for permutation flow-shop scheduling

A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem

Multi-objective swarm-based neighborhood search for fuzzy flexible job shop scheduling

An efficient bi-objective heuristic for scheduling of hybrid flow shops

Similar Documents

Bi-objective hybrid flow shop scheduling: a new local search

Minimizing makespan in reentrant flow-shops using hybrid tabu search

Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers

A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem

An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling

Sequencing and scheduling of nonuniform flow pattern in parallel hybrid flow shop

A hybrid differential evolution method for permutation flow-shop scheduling

A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem

Multi-objective swarm-based neighborhood search for fuzzy flexible job shop scheduling

An efficient bi-objective heuristic for scheduling of hybrid flow shops