NDLI: Metaheuristics for two-stage no-wait flexible flow shop scheduling problem

Content Provider	IEEE Xplore Digital Library
Author	Ghaleb, M.A. Suryahatmaja, U.S. Alharkan, I.M.
Copyright Year	2015
Description	Author affiliation: Dept. of Ind. Eng., King Saud Univ., Riyadh, Saudi Arabia (Ghaleb, M.A.; Suryahatmaja, U.S.; Alharkan, I.M.)
Abstract	The flexible flow-shop scheduling problem (FFSSP) is an important branch of production scheduling, the flexible flow shop is a combination of two well-known machine environments, which are flow shops and parallel machines, and it is well known that this problem is NP-hard. The no-wait requirement is a phenomenon that may occur in flow shops, and it's prevent the jobs to wait between two successive machines (or stages), jobs must be processed from the start to finish, without any interruption on machines (or stages) or between them. Many different approaches have been applied to FFSSP with no-wait. In this research, two-stage no-wait flexible flow shop scheduling problem (NWFFSSP) has been solved using two meta-heuristics, which are Tabu Search (TS) and Particle Swarm Optimization (PSO). We solved the NWFFSSP with minimum makespan as a performance measure. The performance of the proposed algorithms are studied and compared with previous research results using the same problem data. The results of the study proposes the effective algorithm.
Starting Page	1
Ending Page	9
File Size	542121
Page Count	9
File Format	PDF
e-ISBN	9781479960651
DOI	10.1109/IEOM.2015.7093943
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-03-03
Publisher Place	United Arab Emirates
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis No-wait Schedules Job shop scheduling Two-stage Flexible flow shop Heuristic algorithms Parallel machines Tabu Search Makespan Particle swarm optimization Optimization Particle Swarm Optimization
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

Improved new particle swarm algorithm solving job shop scheduling optimization problem

Minimizing makespan for a no-wait flowshop using tabu mechanism improved iterated greedy algorithm

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

An effective particle swarm optimization algorithm for flexible job-shop scheduling problem

Based on Tabu Search and Particle Swarm Optimization Algorithms Solving Job Shop Scheduling Optimization Problems

Scheduling the blocking flow shop problem using a harmony search algorithm

An efficient hybrid particle swarm optimization for the Job Shop Scheduling Problem

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

A hybrid algorithm based on Tabu search for no-wait flow shop

Metaheuristics for two-stage no-wait flexible flow shop scheduling problem

Similar Documents

Improved new particle swarm algorithm solving job shop scheduling optimization problem

Minimizing makespan for a no-wait flowshop using tabu mechanism improved iterated greedy algorithm

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

An effective particle swarm optimization algorithm for flexible job-shop scheduling problem

Based on Tabu Search and Particle Swarm Optimization Algorithms Solving Job Shop Scheduling Optimization Problems

Scheduling the blocking flow shop problem using a harmony search algorithm

An efficient hybrid particle swarm optimization for the Job Shop Scheduling Problem

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

A hybrid algorithm based on Tabu search for no-wait flow shop

Metaheuristics for two-stage no-wait flexible flow shop scheduling problem