Advanced search
Publication Cover
Journal of Information and Optimization Sciences Volume 23, 2002 - Issue 2
Journal homepage
35
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Experimental comparison of heuristics for flow shop scheduling

Hui-Chin Tang Department of Industrial Engineering and Management, Cheng Shiu Institute of Technology, Kaohsiung, 83305, Taiwan Republic of China
Pages 313-321 | Received 01 Sep 2001, Published online: 18 Jun 2013
 
Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days

Abstract

This paper addresses the issue of comparing sixteen heuristics for the flow shop scheduling problem (FSSP) with the objective of minimizing the makespan. Simulations are conducted to compare and evaluate the CPU time and solution quality of these heuristics. The superiority of the heuristic proposed by Nawaz, Enscore, and Ham (NEH) has been numerically confirmed by the experiment we presented. Therefore, heuristic NEH is a good way of generating a near-optimal schedule for the FSSP with minimum makespan criterion.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related Research Data

A Note on Heuristics of Flow-Shop Scheduling
Source: Institute for Operations Research and the Management Sciences (INFORMS)
Some results of the worst-case analysis for flow shop scheduling
Source: Elsevier BV
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
Source: Elsevier BV
Optimal two- and three-stage production schedules with setup times included
Source: Wiley
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
Source: Elsevier BV
Benchmarks for basic scheduling problems
Source: Elsevier BV
An extension of Palmer's heuristic for the flow shop scheduling problem
Source: Informa UK Limited
Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum
Source: Informa UK Limited
The Lessons of Flowshop Scheduling Research
Source: Institute for Operations Research and the Management Sciences (INFORMS)
An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion
Source: Informa UK Limited
Worst-case analysis of an approximation algorithm for flow-shop scheduling
Source: Elsevier BV
New results in the worst-case analysis for flow-shop scheduling
Source: Elsevier BV
A modification to the CGPS algorithm for three-machine flow shop scheduling
Source: Informa UK Limited
A note on worst-case analysis of approximation algorithms for a scheduling problem
Source: Elsevier BV
Some efficient heuristic methods for the flow shop sequencing problem
Source: Elsevier BV
A new heuristic method for the flow shop sequencing problem
Source: Elsevier BV
Heuristics for flow-shop scheduling
Source: Informa UK Limited
A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
Source: JSTOR
The Complexity of Flowshop and Jobshop Scheduling
Source: Institute for Operations Research and the Management Sciences (INFORMS)
Scheduling heuristic for the n-jobm-machine flow shop
Source: Elsevier BV

Linking provided by 

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.