NDLI: A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks

Content Provider	Springer Nature Link
Author	Wang, Ling Xu, Ye Zhou, Gang Wang, Shengyao Liu, Min
Copyright Year	2011
Abstract	As the strongly NP-hard problem, the hybrid flow-shop problem with multiprocessor tasks (HFSPMT) has gained increasing attention due to its academic significance and wide application background. For many heuristics and meta-heuristics to solve the HFSPMT, decoding method is the key element to decode sequences to schedules, which has great effect on the solution quality. To narrow the idle time between the consecutive operations in the processor and to increase the flexibility in selecting processors to schedule the following operations, several rules are proposed to adjust sequences to minimize the makespan of the HFSPMT. Based on the rules, a novel and effective decoding method named forward scheduling (FS) is proposed in this paper for solving the HFSPMT. At each stage, it first decodes the solution according to the non-decreasing order of the jobs’ completion times at the previous stage, and then it adjusts the processing order of the jobs dynamically according to the rules to obtain potentially better schedule. Numerical results based on the well-known benchmarks and comparisons with some existing decoding methods demonstrate the effectiveness of the proposed FS decoding method.
Starting Page	1113
Ending Page	1125
Page Count	13
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	59
Issue Number	9-12
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2011-08-02
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Hybrid flow-shop scheduling Multiprocessor tasks Decoding method Forward scheduling Dynamic adjustment Mechanical Engineering Industrial and Production Engineering Computer-Aided Engineering (CAD, CAE) and Design Production/Logistics/Supply Chain
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

An effective shuffled frog-leaping algorithm for hybrid flow-shop scheduling with multiprocessor tasks

A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan

A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks

An effective immune algorithm based on novel dispatching rules for the flexible flow-shop scheduling problem with multiprocessor tasks

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

An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines

Reentrant two-stage multiprocessor flow shop scheduling with due windows

A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem

A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem

A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks

Similar Documents

An effective shuffled frog-leaping algorithm for hybrid flow-shop scheduling with multiprocessor tasks

A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan

A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks

An effective immune algorithm based on novel dispatching rules for the flexible flow-shop scheduling problem with multiprocessor tasks

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

An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines

Reentrant two-stage multiprocessor flow shop scheduling with due windows

A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem

A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem

A novel decoding method for the hybrid flow-shop scheduling problem with multiprocessor tasks