NDLI: A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines

Content Provider	Springer Nature Link
Author	Li, Dongni Meng, Xianwen Liang, Qiqiang Zhao, Junqing
Copyright Year	2014
Abstract	This paper addresses the scheduling problem for a multi-stage hybrid flow shop (HFS) with single processing machines and batch processing machines. Each stage consists of nonidentical machines in parallel, and only one of the stages is composed of batch processing machines. Such a variant of the HFS problem is derived from the actual manufacturing of complex products in the equipment manufacturing industry. Aiming at minimizing the maximum completion time and minimizing the total weighted tardiness, respectively, a heuristic-search genetic algorithm (HSGA) is developed in this paper, which selects assignment rules for parts, sequencing rules for machines (including single processing machines and batch processing machines), and batch formation rules for batch processing machines, simultaneously. Then parts and machines are scheduled using the obtained combinatorial heuristic rules. Since the search space composed of the heuristic rules is much smaller than that composed of the schedules, the HSGA results in lower complexity and higher computational efficiency. Computational results indicate that as compared with meta-heuristics that search for scheduling solutions directly, the HSGA has a significant advantage with respect to the computational efficiency. As compared with combinatorial heuristic rules, other heuristic-search approaches, and the CPLEX, the HSGA provides better optimizational performance and is especially suitable to solve large dimension scheduling problems.
Starting Page	873
Ending Page	890
Page Count	18
File Format	PDF
ISSN	09565515
Journal	Journal of Intelligent Manufacturing
Volume Number	26
Issue Number	5
e-ISSN	15728145
Language	English
Publisher	Springer US
Publisher Date	2014-02-21
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Hybrid flow shop Batch processing machine Single processing machine Genetic algorithm Heuristic rule Production/Logistics/Supply Chain Manufacturing, Machines, Tools Control, Robotics, Mechatronics
Content Type	Text
Resource Type	Article
Subject	Industrial and Manufacturing Engineering Artificial Intelligence 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

Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints

A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study

A two-stage hybrid flowshop scheduling problem in machine breakdown condition

Genetic algorithm for rotary machine scheduling with dependent processing times

A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times

Intensified iterative deepening A* with application to job shop scheduling

Note to “Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm”

A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers

A GRASP approach for makespan minimization on parallel batch processing machines

A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines

Similar Documents

Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints

A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study

A two-stage hybrid flowshop scheduling problem in machine breakdown condition

Genetic algorithm for rotary machine scheduling with dependent processing times

A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times

Intensified iterative deepening A* with application to job shop scheduling

Note to “Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm”

A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers

A GRASP approach for makespan minimization on parallel batch processing machines

A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines